/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/in-de32.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:02:55,568 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:02:55,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:02:55,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:02:55,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:02:55,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:02:55,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:02:55,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:02:55,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:02:55,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:02:55,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:02:55,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:02:55,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:02:55,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:02:55,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:02:55,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:02:55,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:02:55,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:02:55,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:02:55,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:02:55,617 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:02:55,617 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:02:55,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:02:55,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:02:55,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:02:55,622 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:02:55,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:02:55,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:02:55,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:02:55,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:02:55,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:02:55,625 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:02:55,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:02:55,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:02:55,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:02:55,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:02:55,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:02:55,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:02:55,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:02:55,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:02:55,629 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:02:55,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:02:55,638 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:02:55,645 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:02:55,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:02:55,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:02:55,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:02:55,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:02:55,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:02:55,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:02:55,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:02:55,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:02:55,652 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:02:55,652 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:02:55,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:02:55,653 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:02:55,653 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:02:55,653 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:02:55,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:02:55,653 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:02:55,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:02:55,653 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:02:55,653 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:02:55,654 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:02:55,654 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:02:55,654 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-08 10:02:55,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:02:55,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:02:55,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:02:55,958 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:02:55,958 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:02:55,959 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de32.c [2022-04-08 10:02:56,017 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42694ba3d/01686d80f1d241368572c9accfabab86/FLAG69dbe3245 [2022-04-08 10:02:56,445 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:02:56,446 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de32.c [2022-04-08 10:02:56,452 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42694ba3d/01686d80f1d241368572c9accfabab86/FLAG69dbe3245 [2022-04-08 10:02:56,467 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42694ba3d/01686d80f1d241368572c9accfabab86 [2022-04-08 10:02:56,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:02:56,472 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:02:56,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:02:56,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:02:56,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:02:56,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:02:56" (1/1) ... [2022-04-08 10:02:56,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dda72d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:02:56, skipping insertion in model container [2022-04-08 10:02:56,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:02:56" (1/1) ... [2022-04-08 10:02:56,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:02:56,498 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:02:56,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de32.c[368,381] [2022-04-08 10:02:56,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:02:56,665 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:02:56,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de32.c[368,381] [2022-04-08 10:02:56,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:02:56,691 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:02:56,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:02:56 WrapperNode [2022-04-08 10:02:56,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:02:56,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:02:56,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:02:56,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:02:56,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:02:56" (1/1) ... [2022-04-08 10:02:56,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:02:56" (1/1) ... [2022-04-08 10:02:56,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:02:56" (1/1) ... [2022-04-08 10:02:56,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:02:56" (1/1) ... [2022-04-08 10:02:56,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:02:56" (1/1) ... [2022-04-08 10:02:56,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:02:56" (1/1) ... [2022-04-08 10:02:56,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:02:56" (1/1) ... [2022-04-08 10:02:56,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:02:56,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:02:56,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:02:56,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:02:56,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:02:56" (1/1) ... [2022-04-08 10:02:56,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:02:56,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:56,751 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-08 10:02:56,762 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-08 10:02:56,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:02:56,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:02:56,790 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:02:56,790 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:02:56,791 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:02:56,791 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:02:56,791 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:02:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:02:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:02:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 10:02:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:02:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:02:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:02:56,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:02:56,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:02:56,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:02:56,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:02:56,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:02:56,857 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:02:56,859 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:02:57,101 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:02:57,116 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:02:57,116 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-08 10:02:57,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:02:57 BoogieIcfgContainer [2022-04-08 10:02:57,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:02:57,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:02:57,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:02:57,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:02:57,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:02:56" (1/3) ... [2022-04-08 10:02:57,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9d8655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:02:57, skipping insertion in model container [2022-04-08 10:02:57,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:02:56" (2/3) ... [2022-04-08 10:02:57,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9d8655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:02:57, skipping insertion in model container [2022-04-08 10:02:57,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:02:57" (3/3) ... [2022-04-08 10:02:57,135 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de32.c [2022-04-08 10:02:57,140 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:02:57,141 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:02:57,198 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:02:57,210 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-08 10:02:57,211 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:02:57,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:02:57,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 10:02:57,242 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:57,243 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:57,244 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:57,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:57,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 1 times [2022-04-08 10:02:57,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:57,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2129312003] [2022-04-08 10:02:57,273 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:02:57,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 2 times [2022-04-08 10:02:57,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:57,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241690778] [2022-04-08 10:02:57,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:57,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:57,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:57,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-08 10:02:57,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 10:02:57,583 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-08 10:02:57,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:57,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-08 10:02:57,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 10:02:57,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-08 10:02:57,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret11 := main(); {25#true} is VALID [2022-04-08 10:02:57,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25#true} is VALID [2022-04-08 10:02:57,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !(~x~0 % 4294967296 > 0); {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-08 10:02:57,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} ~z~0 := ~y~0; {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-08 10:02:57,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~z~0 % 4294967296 > 0); {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-08 10:02:57,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~y~0 % 4294967296 > 0); {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-08 10:02:57,596 INFO L272 TraceCheckUtils]: 10: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:02:57,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:02:57,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26#false} is VALID [2022-04-08 10:02:57,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-08 10:02:57,599 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-08 10:02:57,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:57,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241690778] [2022-04-08 10:02:57,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241690778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:57,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:57,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:02:57,605 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:57,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2129312003] [2022-04-08 10:02:57,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2129312003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:57,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:57,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:02:57,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789894165] [2022-04-08 10:02:57,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:57,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 10:02:57,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:57,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:57,649 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-08 10:02:57,649 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:02:57,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:57,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:02:57,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 10:02:57,673 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:58,002 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-08 10:02:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:02:58,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 10:02:58,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-08 10:02:58,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-08 10:02:58,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2022-04-08 10:02:58,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:58,090 INFO L225 Difference]: With dead ends: 47 [2022-04-08 10:02:58,090 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 10:02:58,092 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:02:58,095 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:58,096 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 40 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:02:58,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 10:02:58,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 10:02:58,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:58,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,122 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,123 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:58,125 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-08 10:02:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-08 10:02:58,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:58,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:58,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 10:02:58,126 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 10:02:58,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:58,128 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-08 10:02:58,128 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-08 10:02:58,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:58,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:58,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:58,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-08 10:02:58,131 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2022-04-08 10:02:58,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:58,132 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-08 10:02:58,132 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 20 transitions. [2022-04-08 10:02:58,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-08 10:02:58,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 10:02:58,168 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:58,171 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:58,172 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:02:58,172 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:58,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:58,173 INFO L85 PathProgramCache]: Analyzing trace with hash -222896448, now seen corresponding path program 1 times [2022-04-08 10:02:58,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:58,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1840970710] [2022-04-08 10:02:58,174 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:58,174 INFO L85 PathProgramCache]: Analyzing trace with hash -222896448, now seen corresponding path program 2 times [2022-04-08 10:02:58,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:58,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195165734] [2022-04-08 10:02:58,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:58,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:58,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:58,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {206#true} is VALID [2022-04-08 10:02:58,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#true} assume true; {206#true} is VALID [2022-04-08 10:02:58,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {206#true} {206#true} #61#return; {206#true} is VALID [2022-04-08 10:02:58,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {206#true} call ULTIMATE.init(); {212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:58,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {206#true} is VALID [2022-04-08 10:02:58,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {206#true} assume true; {206#true} is VALID [2022-04-08 10:02:58,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {206#true} {206#true} #61#return; {206#true} is VALID [2022-04-08 10:02:58,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {206#true} call #t~ret11 := main(); {206#true} is VALID [2022-04-08 10:02:58,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {211#(= main_~y~0 0)} is VALID [2022-04-08 10:02:58,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {211#(= main_~y~0 0)} is VALID [2022-04-08 10:02:58,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#(= main_~y~0 0)} ~z~0 := ~y~0; {211#(= main_~y~0 0)} is VALID [2022-04-08 10:02:58,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {211#(= main_~y~0 0)} assume !(~z~0 % 4294967296 > 0); {211#(= main_~y~0 0)} is VALID [2022-04-08 10:02:58,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {211#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {207#false} is VALID [2022-04-08 10:02:58,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {207#false} assume !(~y~0 % 4294967296 > 0); {207#false} is VALID [2022-04-08 10:02:58,289 INFO L272 TraceCheckUtils]: 11: Hoare triple {207#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {207#false} is VALID [2022-04-08 10:02:58,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {207#false} ~cond := #in~cond; {207#false} is VALID [2022-04-08 10:02:58,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {207#false} assume 0 == ~cond; {207#false} is VALID [2022-04-08 10:02:58,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {207#false} assume !false; {207#false} is VALID [2022-04-08 10:02:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:58,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:58,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195165734] [2022-04-08 10:02:58,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195165734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:58,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:58,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:02:58,291 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:58,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1840970710] [2022-04-08 10:02:58,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1840970710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:58,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:58,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:02:58,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980483250] [2022-04-08 10:02:58,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:58,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 10:02:58,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:58,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,305 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-08 10:02:58,305 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 10:02:58,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:58,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 10:02:58,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 10:02:58,307 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:58,385 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-08 10:02:58,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 10:02:58,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 10:02:58,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:58,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-08 10:02:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-08 10:02:58,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-04-08 10:02:58,420 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-08 10:02:58,423 INFO L225 Difference]: With dead ends: 30 [2022-04-08 10:02:58,424 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 10:02:58,424 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:02:58,427 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:58,428 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 21 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:02:58,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 10:02:58,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-08 10:02:58,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:58,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,444 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,444 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:58,446 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-08 10:02:58,446 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 10:02:58,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:58,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:58,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-08 10:02:58,447 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-08 10:02:58,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:58,449 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-08 10:02:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 10:02:58,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:58,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:58,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:58,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-08 10:02:58,451 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 15 [2022-04-08 10:02:58,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:58,451 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-08 10:02:58,451 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 27 transitions. [2022-04-08 10:02:58,484 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-08 10:02:58,484 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-08 10:02:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 10:02:58,485 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:58,485 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:58,485 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 10:02:58,486 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:58,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:58,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1179931951, now seen corresponding path program 1 times [2022-04-08 10:02:58,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:58,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1971654578] [2022-04-08 10:02:58,510 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:58,511 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:58,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1179931951, now seen corresponding path program 2 times [2022-04-08 10:02:58,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:58,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447323641] [2022-04-08 10:02:58,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:58,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:58,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:58,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {367#true} is VALID [2022-04-08 10:02:58,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {367#true} assume true; {367#true} is VALID [2022-04-08 10:02:58,568 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {367#true} {367#true} #61#return; {367#true} is VALID [2022-04-08 10:02:58,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {367#true} call ULTIMATE.init(); {374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:58,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {367#true} is VALID [2022-04-08 10:02:58,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {367#true} assume true; {367#true} is VALID [2022-04-08 10:02:58,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {367#true} {367#true} #61#return; {367#true} is VALID [2022-04-08 10:02:58,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {367#true} call #t~ret11 := main(); {367#true} is VALID [2022-04-08 10:02:58,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {367#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {372#(= main_~y~0 0)} is VALID [2022-04-08 10:02:58,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {372#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {372#(= main_~y~0 0)} is VALID [2022-04-08 10:02:58,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {372#(= main_~y~0 0)} ~z~0 := ~y~0; {373#(= main_~z~0 0)} is VALID [2022-04-08 10:02:58,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {373#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {368#false} is VALID [2022-04-08 10:02:58,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#false} assume !(~z~0 % 4294967296 > 0); {368#false} is VALID [2022-04-08 10:02:58,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#false} assume !(~y~0 % 4294967296 > 0); {368#false} is VALID [2022-04-08 10:02:58,572 INFO L272 TraceCheckUtils]: 11: Hoare triple {368#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {368#false} is VALID [2022-04-08 10:02:58,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {368#false} ~cond := #in~cond; {368#false} is VALID [2022-04-08 10:02:58,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {368#false} assume 0 == ~cond; {368#false} is VALID [2022-04-08 10:02:58,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {368#false} assume !false; {368#false} is VALID [2022-04-08 10:02:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:58,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:58,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447323641] [2022-04-08 10:02:58,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447323641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:58,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:58,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:02:58,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:58,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1971654578] [2022-04-08 10:02:58,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1971654578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:58,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:58,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:02:58,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949325021] [2022-04-08 10:02:58,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:58,575 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-08 10:02:58,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:58,575 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-08 10:02:58,587 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-08 10:02:58,587 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:02:58,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:58,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:02:58,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:02:58,588 INFO L87 Difference]: Start difference. First operand 22 states and 27 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-08 10:02:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:58,684 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-08 10:02:58,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:02:58,684 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-08 10:02:58,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:58,684 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-08 10:02:58,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-08 10:02:58,686 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-08 10:02:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-08 10:02:58,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-08 10:02:58,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:58,714 INFO L225 Difference]: With dead ends: 27 [2022-04-08 10:02:58,714 INFO L226 Difference]: Without dead ends: 18 [2022-04-08 10:02:58,714 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-08 10:02:58,715 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:58,715 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:02:58,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-08 10:02:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-08 10:02:58,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:58,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,720 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,720 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:58,721 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-08 10:02:58,721 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-08 10:02:58,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:58,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:58,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-08 10:02:58,722 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-08 10:02:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:58,723 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-08 10:02:58,723 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-08 10:02:58,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:58,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:58,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:58,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:58,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-08 10:02:58,725 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2022-04-08 10:02:58,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:58,725 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-08 10:02:58,725 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-08 10:02:58,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions. [2022-04-08 10:02:58,745 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-08 10:02:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-08 10:02:58,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 10:02:58,745 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:58,745 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:58,746 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 10:02:58,746 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:58,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:58,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1314021247, now seen corresponding path program 1 times [2022-04-08 10:02:58,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:58,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [958416838] [2022-04-08 10:02:58,752 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:58,752 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:58,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1314021247, now seen corresponding path program 2 times [2022-04-08 10:02:58,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:58,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156367320] [2022-04-08 10:02:58,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:58,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:58,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:58,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {507#true} is VALID [2022-04-08 10:02:58,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-08 10:02:58,876 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {507#true} {507#true} #61#return; {507#true} is VALID [2022-04-08 10:02:58,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:58,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {507#true} is VALID [2022-04-08 10:02:58,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-08 10:02:58,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #61#return; {507#true} is VALID [2022-04-08 10:02:58,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret11 := main(); {507#true} is VALID [2022-04-08 10:02:58,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {512#(= main_~y~0 0)} is VALID [2022-04-08 10:02:58,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {512#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {513#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:58,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {513#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {513#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:58,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {513#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {514#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:02:58,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {514#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {508#false} is VALID [2022-04-08 10:02:58,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {508#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {508#false} is VALID [2022-04-08 10:02:58,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {508#false} assume !(~y~0 % 4294967296 > 0); {508#false} is VALID [2022-04-08 10:02:58,881 INFO L272 TraceCheckUtils]: 12: Hoare triple {508#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {508#false} is VALID [2022-04-08 10:02:58,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {508#false} ~cond := #in~cond; {508#false} is VALID [2022-04-08 10:02:58,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {508#false} assume 0 == ~cond; {508#false} is VALID [2022-04-08 10:02:58,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-08 10:02:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:02:58,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:58,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156367320] [2022-04-08 10:02:58,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156367320] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:58,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346255539] [2022-04-08 10:02:58,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:02:58,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:58,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:58,887 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-08 10:02:58,938 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-08 10:02:58,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:02:58,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:58,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 10:02:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:58,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:59,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2022-04-08 10:02:59,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {507#true} is VALID [2022-04-08 10:02:59,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-08 10:02:59,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #61#return; {507#true} is VALID [2022-04-08 10:02:59,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret11 := main(); {507#true} is VALID [2022-04-08 10:02:59,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {512#(= main_~y~0 0)} is VALID [2022-04-08 10:02:59,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {512#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {513#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:59,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {513#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {513#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:59,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {513#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {543#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:59,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {543#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {508#false} is VALID [2022-04-08 10:02:59,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {508#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {508#false} is VALID [2022-04-08 10:02:59,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {508#false} assume !(~y~0 % 4294967296 > 0); {508#false} is VALID [2022-04-08 10:02:59,130 INFO L272 TraceCheckUtils]: 12: Hoare triple {508#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {508#false} is VALID [2022-04-08 10:02:59,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {508#false} ~cond := #in~cond; {508#false} is VALID [2022-04-08 10:02:59,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {508#false} assume 0 == ~cond; {508#false} is VALID [2022-04-08 10:02:59,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-08 10:02:59,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:02:59,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:59,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-08 10:02:59,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {508#false} assume 0 == ~cond; {508#false} is VALID [2022-04-08 10:02:59,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {508#false} ~cond := #in~cond; {508#false} is VALID [2022-04-08 10:02:59,203 INFO L272 TraceCheckUtils]: 12: Hoare triple {508#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {508#false} is VALID [2022-04-08 10:02:59,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {508#false} assume !(~y~0 % 4294967296 > 0); {508#false} is VALID [2022-04-08 10:02:59,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {580#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {508#false} is VALID [2022-04-08 10:02:59,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {584#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {580#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:02:59,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#true} ~z~0 := ~y~0; {584#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:02:59,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#true} assume !(~x~0 % 4294967296 > 0); {507#true} is VALID [2022-04-08 10:02:59,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {507#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {507#true} is VALID [2022-04-08 10:02:59,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {507#true} is VALID [2022-04-08 10:02:59,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret11 := main(); {507#true} is VALID [2022-04-08 10:02:59,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #61#return; {507#true} is VALID [2022-04-08 10:02:59,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-08 10:02:59,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {507#true} is VALID [2022-04-08 10:02:59,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2022-04-08 10:02:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:02:59,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346255539] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:59,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:02:59,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 9 [2022-04-08 10:02:59,207 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:59,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [958416838] [2022-04-08 10:02:59,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [958416838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:59,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:59,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:02:59,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926743640] [2022-04-08 10:02:59,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:59,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 10:02:59,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:59,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:59,219 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-08 10:02:59,219 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 10:02:59,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:59,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 10:02:59,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:02:59,220 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:59,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:59,275 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 10:02:59,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 10:02:59,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 10:02:59,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:59,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-08 10:02:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-08 10:02:59,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2022-04-08 10:02:59,313 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-08 10:02:59,314 INFO L225 Difference]: With dead ends: 24 [2022-04-08 10:02:59,314 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 10:02:59,315 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:02:59,316 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:59,317 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:02:59,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 10:02:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 10:02:59,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:59,328 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-08 10:02:59,328 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-08 10:02:59,328 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-08 10:02:59,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:59,332 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-08 10:02:59,332 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 10:02:59,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:59,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:59,332 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-08 10:02:59,333 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-08 10:02:59,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:59,335 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-08 10:02:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 10:02:59,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:59,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:59,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:59,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:59,336 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-08 10:02:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-08 10:02:59,342 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2022-04-08 10:02:59,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:59,342 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-08 10:02:59,342 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:59,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-08 10:02:59,360 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-08 10:02:59,360 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 10:02:59,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 10:02:59,361 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:59,361 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:59,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 10:02:59,581 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:59,581 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:59,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:59,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1578117650, now seen corresponding path program 1 times [2022-04-08 10:02:59,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:59,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1468030995] [2022-04-08 10:02:59,587 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:59,587 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:59,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1578117650, now seen corresponding path program 2 times [2022-04-08 10:02:59,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:59,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794268165] [2022-04-08 10:02:59,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:59,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:59,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:59,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {730#true} is VALID [2022-04-08 10:02:59,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {730#true} assume true; {730#true} is VALID [2022-04-08 10:02:59,682 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {730#true} {730#true} #61#return; {730#true} is VALID [2022-04-08 10:02:59,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {730#true} call ULTIMATE.init(); {737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:59,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {730#true} is VALID [2022-04-08 10:02:59,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {730#true} assume true; {730#true} is VALID [2022-04-08 10:02:59,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {730#true} {730#true} #61#return; {730#true} is VALID [2022-04-08 10:02:59,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {730#true} call #t~ret11 := main(); {730#true} is VALID [2022-04-08 10:02:59,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {735#(= main_~y~0 0)} is VALID [2022-04-08 10:02:59,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {735#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {736#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-08 10:02:59,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {736#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {736#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-08 10:02:59,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {736#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} ~z~0 := ~y~0; {736#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-08 10:02:59,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {736#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {736#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-08 10:02:59,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {736#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {736#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-08 10:02:59,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {736#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {731#false} is VALID [2022-04-08 10:02:59,688 INFO L272 TraceCheckUtils]: 12: Hoare triple {731#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {731#false} is VALID [2022-04-08 10:02:59,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {731#false} ~cond := #in~cond; {731#false} is VALID [2022-04-08 10:02:59,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {731#false} assume 0 == ~cond; {731#false} is VALID [2022-04-08 10:02:59,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#false} assume !false; {731#false} is VALID [2022-04-08 10:02:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:02:59,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:59,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794268165] [2022-04-08 10:02:59,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794268165] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:59,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913165682] [2022-04-08 10:02:59,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:02:59,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:59,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:59,691 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-08 10:02:59,716 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-08 10:02:59,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:02:59,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:59,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 10:02:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:59,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:59,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {730#true} call ULTIMATE.init(); {730#true} is VALID [2022-04-08 10:02:59,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {730#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {730#true} is VALID [2022-04-08 10:02:59,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {730#true} assume true; {730#true} is VALID [2022-04-08 10:02:59,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {730#true} {730#true} #61#return; {730#true} is VALID [2022-04-08 10:02:59,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {730#true} call #t~ret11 := main(); {730#true} is VALID [2022-04-08 10:02:59,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {735#(= main_~y~0 0)} is VALID [2022-04-08 10:02:59,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {735#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {759#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-08 10:02:59,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {759#(= (+ (- 1) main_~y~0) 0)} assume !(~x~0 % 4294967296 > 0); {759#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-08 10:02:59,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {759#(= (+ (- 1) main_~y~0) 0)} ~z~0 := ~y~0; {766#(and (= main_~z~0 main_~y~0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-08 10:02:59,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {766#(and (= main_~z~0 main_~y~0) (= (+ (- 1) main_~y~0) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {759#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-08 10:02:59,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {759#(= (+ (- 1) main_~y~0) 0)} assume !(~z~0 % 4294967296 > 0); {759#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-08 10:02:59,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {759#(= (+ (- 1) main_~y~0) 0)} assume !(~y~0 % 4294967296 > 0); {731#false} is VALID [2022-04-08 10:02:59,828 INFO L272 TraceCheckUtils]: 12: Hoare triple {731#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {731#false} is VALID [2022-04-08 10:02:59,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {731#false} ~cond := #in~cond; {731#false} is VALID [2022-04-08 10:02:59,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {731#false} assume 0 == ~cond; {731#false} is VALID [2022-04-08 10:02:59,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#false} assume !false; {731#false} is VALID [2022-04-08 10:02:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:59,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:59,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#false} assume !false; {731#false} is VALID [2022-04-08 10:02:59,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {731#false} assume 0 == ~cond; {731#false} is VALID [2022-04-08 10:02:59,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {731#false} ~cond := #in~cond; {731#false} is VALID [2022-04-08 10:02:59,936 INFO L272 TraceCheckUtils]: 12: Hoare triple {731#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {731#false} is VALID [2022-04-08 10:02:59,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {800#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {731#false} is VALID [2022-04-08 10:02:59,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {800#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {800#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:59,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {807#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {800#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:59,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {730#true} ~z~0 := ~y~0; {807#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:02:59,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {730#true} assume !(~x~0 % 4294967296 > 0); {730#true} is VALID [2022-04-08 10:02:59,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {730#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {730#true} is VALID [2022-04-08 10:02:59,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {730#true} is VALID [2022-04-08 10:02:59,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {730#true} call #t~ret11 := main(); {730#true} is VALID [2022-04-08 10:02:59,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {730#true} {730#true} #61#return; {730#true} is VALID [2022-04-08 10:02:59,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {730#true} assume true; {730#true} is VALID [2022-04-08 10:02:59,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {730#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {730#true} is VALID [2022-04-08 10:02:59,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {730#true} call ULTIMATE.init(); {730#true} is VALID [2022-04-08 10:02:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:02:59,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913165682] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:59,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:02:59,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 9 [2022-04-08 10:02:59,940 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:59,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1468030995] [2022-04-08 10:02:59,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1468030995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:59,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:59,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:02:59,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560499405] [2022-04-08 10:02:59,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:59,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 10:02:59,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:59,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:59,953 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-08 10:02:59,953 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 10:02:59,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:59,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 10:02:59,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:02:59,954 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:59,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:59,998 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-08 10:02:59,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 10:02:59,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 10:02:59,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:59,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-04-08 10:03:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-04-08 10:03:00,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2022-04-08 10:03:00,020 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-08 10:03:00,020 INFO L225 Difference]: With dead ends: 23 [2022-04-08 10:03:00,021 INFO L226 Difference]: Without dead ends: 18 [2022-04-08 10:03:00,021 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:03:00,021 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:00,022 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 26 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:03:00,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-08 10:03:00,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-08 10:03:00,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:00,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:00,031 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:00,031 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:00,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:00,032 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-08 10:03:00,032 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 10:03:00,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:00,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:00,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-08 10:03:00,033 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-08 10:03:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:00,033 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-08 10:03:00,034 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 10:03:00,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:00,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:00,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:00,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:00,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:00,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-08 10:03:00,035 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2022-04-08 10:03:00,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:00,035 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-08 10:03:00,035 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:00,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-08 10:03:00,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:00,053 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 10:03:00,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:03:00,054 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:00,054 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:00,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 10:03:00,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:00,267 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:00,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:00,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1642511809, now seen corresponding path program 1 times [2022-04-08 10:03:00,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:00,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1691053742] [2022-04-08 10:03:00,278 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:00,278 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:00,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1642511809, now seen corresponding path program 2 times [2022-04-08 10:03:00,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:00,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243021059] [2022-04-08 10:03:00,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:00,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:00,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:00,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {955#true} is VALID [2022-04-08 10:03:00,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {955#true} assume true; {955#true} is VALID [2022-04-08 10:03:00,434 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {955#true} {955#true} #61#return; {955#true} is VALID [2022-04-08 10:03:00,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {955#true} call ULTIMATE.init(); {964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:00,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {955#true} is VALID [2022-04-08 10:03:00,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {955#true} assume true; {955#true} is VALID [2022-04-08 10:03:00,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {955#true} {955#true} #61#return; {955#true} is VALID [2022-04-08 10:03:00,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {955#true} call #t~ret11 := main(); {955#true} is VALID [2022-04-08 10:03:00,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {955#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {955#true} is VALID [2022-04-08 10:03:00,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {955#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {955#true} is VALID [2022-04-08 10:03:00,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {955#true} assume !(~x~0 % 4294967296 > 0); {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:03:00,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:03:00,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:03:00,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:03:00,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:03:00,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:03:00,459 INFO L272 TraceCheckUtils]: 13: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {962#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:03:00,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {962#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {963#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:03:00,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {963#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {956#false} is VALID [2022-04-08 10:03:00,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {956#false} assume !false; {956#false} is VALID [2022-04-08 10:03:00,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:03:00,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:00,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243021059] [2022-04-08 10:03:00,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243021059] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:00,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861504882] [2022-04-08 10:03:00,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:00,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:00,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:00,464 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:00,474 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-08 10:03:00,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:00,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:00,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 10:03:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:00,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:00,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {955#true} call ULTIMATE.init(); {955#true} is VALID [2022-04-08 10:03:00,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {955#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {955#true} is VALID [2022-04-08 10:03:00,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {955#true} assume true; {955#true} is VALID [2022-04-08 10:03:00,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {955#true} {955#true} #61#return; {955#true} is VALID [2022-04-08 10:03:00,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {955#true} call #t~ret11 := main(); {955#true} is VALID [2022-04-08 10:03:00,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {955#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {955#true} is VALID [2022-04-08 10:03:00,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {955#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {955#true} is VALID [2022-04-08 10:03:00,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {955#true} assume !(~x~0 % 4294967296 > 0); {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:03:00,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:03:00,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:03:00,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:03:00,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:03:00,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:03:00,842 INFO L272 TraceCheckUtils]: 13: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1007#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:03:00,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {1007#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1011#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:03:00,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {1011#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {956#false} is VALID [2022-04-08 10:03:00,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {956#false} assume !false; {956#false} is VALID [2022-04-08 10:03:00,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:03:00,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:01,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {956#false} assume !false; {956#false} is VALID [2022-04-08 10:03:01,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {1011#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {956#false} is VALID [2022-04-08 10:03:01,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {1007#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1011#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:03:01,157 INFO L272 TraceCheckUtils]: 13: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1007#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:03:01,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:03:01,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:03:01,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:03:01,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:03:01,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:03:01,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {955#true} assume !(~x~0 % 4294967296 > 0); {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:03:01,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {955#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {955#true} is VALID [2022-04-08 10:03:01,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {955#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {955#true} is VALID [2022-04-08 10:03:01,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {955#true} call #t~ret11 := main(); {955#true} is VALID [2022-04-08 10:03:01,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {955#true} {955#true} #61#return; {955#true} is VALID [2022-04-08 10:03:01,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {955#true} assume true; {955#true} is VALID [2022-04-08 10:03:01,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {955#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {955#true} is VALID [2022-04-08 10:03:01,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {955#true} call ULTIMATE.init(); {955#true} is VALID [2022-04-08 10:03:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:03:01,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861504882] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:01,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:01,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-08 10:03:01,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:01,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1691053742] [2022-04-08 10:03:01,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1691053742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:01,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:01,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:03:01,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055271110] [2022-04-08 10:03:01,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:01,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) 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-08 10:03:01,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:01,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) 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-08 10:03:01,184 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-08 10:03:01,184 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:03:01,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:01,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:03:01,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:03:01,185 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) 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-08 10:03:01,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:01,402 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 10:03:01,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:03:01,402 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) 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-08 10:03:01,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:01,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) 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-08 10:03:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-08 10:03:01,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) 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-08 10:03:01,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-08 10:03:01,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2022-04-08 10:03:01,438 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-08 10:03:01,439 INFO L225 Difference]: With dead ends: 26 [2022-04-08 10:03:01,439 INFO L226 Difference]: Without dead ends: 21 [2022-04-08 10:03:01,439 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:03:01,440 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:01,440 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 36 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:01,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-08 10:03:01,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-08 10:03:01,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:01,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:01,453 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:01,453 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:01,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:01,458 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-08 10:03:01,458 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-08 10:03:01,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:01,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:01,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-08 10:03:01,459 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-08 10:03:01,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:01,460 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-08 10:03:01,461 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-08 10:03:01,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:01,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:01,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:01,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:01,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-08 10:03:01,462 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2022-04-08 10:03:01,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:01,463 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-08 10:03:01,464 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) 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-08 10:03:01,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-08 10:03:01,493 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-08 10:03:01,493 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 10:03:01,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 10:03:01,494 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:01,494 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:01,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:01,694 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:01,695 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:01,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:01,695 INFO L85 PathProgramCache]: Analyzing trace with hash 656236558, now seen corresponding path program 3 times [2022-04-08 10:03:01,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:01,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [808184655] [2022-04-08 10:03:01,700 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:01,700 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:01,701 INFO L85 PathProgramCache]: Analyzing trace with hash 656236558, now seen corresponding path program 4 times [2022-04-08 10:03:01,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:01,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260552752] [2022-04-08 10:03:01,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:01,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:01,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:01,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {1217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1210#true} is VALID [2022-04-08 10:03:01,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {1210#true} assume true; {1210#true} is VALID [2022-04-08 10:03:01,780 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1210#true} {1210#true} #61#return; {1210#true} is VALID [2022-04-08 10:03:01,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {1210#true} call ULTIMATE.init(); {1217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:01,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {1217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1210#true} is VALID [2022-04-08 10:03:01,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {1210#true} assume true; {1210#true} is VALID [2022-04-08 10:03:01,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1210#true} {1210#true} #61#return; {1210#true} is VALID [2022-04-08 10:03:01,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {1210#true} call #t~ret11 := main(); {1210#true} is VALID [2022-04-08 10:03:01,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {1210#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1215#(= main_~y~0 0)} is VALID [2022-04-08 10:03:01,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {1215#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:01,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:01,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:01,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:01,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:01,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1215#(= main_~y~0 0)} is VALID [2022-04-08 10:03:01,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {1215#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1211#false} is VALID [2022-04-08 10:03:01,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {1211#false} assume !(~y~0 % 4294967296 > 0); {1211#false} is VALID [2022-04-08 10:03:01,786 INFO L272 TraceCheckUtils]: 14: Hoare triple {1211#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1211#false} is VALID [2022-04-08 10:03:01,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {1211#false} ~cond := #in~cond; {1211#false} is VALID [2022-04-08 10:03:01,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#false} assume 0 == ~cond; {1211#false} is VALID [2022-04-08 10:03:01,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {1211#false} assume !false; {1211#false} is VALID [2022-04-08 10:03:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:03:01,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:01,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260552752] [2022-04-08 10:03:01,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260552752] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:01,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991969659] [2022-04-08 10:03:01,788 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:01,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:01,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:01,792 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-08 10:03:01,819 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-08 10:03:01,834 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:01,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:01,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 10:03:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:01,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:01,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {1210#true} call ULTIMATE.init(); {1210#true} is VALID [2022-04-08 10:03:01,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {1210#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1210#true} is VALID [2022-04-08 10:03:01,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {1210#true} assume true; {1210#true} is VALID [2022-04-08 10:03:01,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1210#true} {1210#true} #61#return; {1210#true} is VALID [2022-04-08 10:03:01,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {1210#true} call #t~ret11 := main(); {1210#true} is VALID [2022-04-08 10:03:01,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {1210#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1215#(= main_~y~0 0)} is VALID [2022-04-08 10:03:01,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {1215#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:01,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:01,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1245#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:01,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {1245#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1249#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:01,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {1249#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:01,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1215#(= main_~y~0 0)} is VALID [2022-04-08 10:03:01,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {1215#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1211#false} is VALID [2022-04-08 10:03:01,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {1211#false} assume !(~y~0 % 4294967296 > 0); {1211#false} is VALID [2022-04-08 10:03:01,980 INFO L272 TraceCheckUtils]: 14: Hoare triple {1211#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1211#false} is VALID [2022-04-08 10:03:01,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {1211#false} ~cond := #in~cond; {1211#false} is VALID [2022-04-08 10:03:01,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#false} assume 0 == ~cond; {1211#false} is VALID [2022-04-08 10:03:01,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {1211#false} assume !false; {1211#false} is VALID [2022-04-08 10:03:01,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:01,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:02,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {1211#false} assume !false; {1211#false} is VALID [2022-04-08 10:03:02,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#false} assume 0 == ~cond; {1211#false} is VALID [2022-04-08 10:03:02,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {1211#false} ~cond := #in~cond; {1211#false} is VALID [2022-04-08 10:03:02,132 INFO L272 TraceCheckUtils]: 14: Hoare triple {1211#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1211#false} is VALID [2022-04-08 10:03:02,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {1211#false} assume !(~y~0 % 4294967296 > 0); {1211#false} is VALID [2022-04-08 10:03:02,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {1289#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1211#false} is VALID [2022-04-08 10:03:02,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {1293#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1289#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:02,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {1297#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {1293#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:02,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {1301#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1297#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:03:02,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {1210#true} ~z~0 := ~y~0; {1301#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:03:02,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {1210#true} assume !(~x~0 % 4294967296 > 0); {1210#true} is VALID [2022-04-08 10:03:02,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {1210#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1210#true} is VALID [2022-04-08 10:03:02,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {1210#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1210#true} is VALID [2022-04-08 10:03:02,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {1210#true} call #t~ret11 := main(); {1210#true} is VALID [2022-04-08 10:03:02,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1210#true} {1210#true} #61#return; {1210#true} is VALID [2022-04-08 10:03:02,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {1210#true} assume true; {1210#true} is VALID [2022-04-08 10:03:02,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {1210#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1210#true} is VALID [2022-04-08 10:03:02,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {1210#true} call ULTIMATE.init(); {1210#true} is VALID [2022-04-08 10:03:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:03:02,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991969659] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:02,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:02,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-04-08 10:03:02,140 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:02,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [808184655] [2022-04-08 10:03:02,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [808184655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:02,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:02,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:03:02,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272762593] [2022-04-08 10:03:02,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:02,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 10:03:02,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:02,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:02,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:02,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:03:02,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:02,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:03:02,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-04-08 10:03:02,159 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:02,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:02,285 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-08 10:03:02,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:03:02,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 10:03:02,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-08 10:03:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-08 10:03:02,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-04-08 10:03:02,314 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-08 10:03:02,315 INFO L225 Difference]: With dead ends: 36 [2022-04-08 10:03:02,315 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 10:03:02,315 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:03:02,316 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:02,316 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 25 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:03:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 10:03:02,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-08 10:03:02,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:02,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:02,339 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:02,339 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:02,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:02,340 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-08 10:03:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-04-08 10:03:02,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:02,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:02,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-08 10:03:02,347 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-08 10:03:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:02,348 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-08 10:03:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-04-08 10:03:02,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:02,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:02,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:02,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-04-08 10:03:02,349 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 18 [2022-04-08 10:03:02,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:02,350 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-04-08 10:03:02,350 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:02,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 32 transitions. [2022-04-08 10:03:02,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:02,387 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-08 10:03:02,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 10:03:02,388 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:02,388 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:02,414 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-08 10:03:02,589 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:02,589 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:02,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:02,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1194243967, now seen corresponding path program 5 times [2022-04-08 10:03:02,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:02,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1090183614] [2022-04-08 10:03:02,593 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:02,593 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:02,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1194243967, now seen corresponding path program 6 times [2022-04-08 10:03:02,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:02,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134614554] [2022-04-08 10:03:02,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:02,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:02,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:02,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {1526#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1517#true} is VALID [2022-04-08 10:03:02,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {1517#true} assume true; {1517#true} is VALID [2022-04-08 10:03:02,686 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1517#true} {1517#true} #61#return; {1517#true} is VALID [2022-04-08 10:03:02,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {1517#true} call ULTIMATE.init(); {1526#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:02,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {1526#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1517#true} is VALID [2022-04-08 10:03:02,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {1517#true} assume true; {1517#true} is VALID [2022-04-08 10:03:02,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1517#true} {1517#true} #61#return; {1517#true} is VALID [2022-04-08 10:03:02,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {1517#true} call #t~ret11 := main(); {1517#true} is VALID [2022-04-08 10:03:02,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {1517#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1522#(= main_~y~0 0)} is VALID [2022-04-08 10:03:02,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {1522#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:02,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {1523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:02,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {1523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1524#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:02,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {1524#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1525#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:03:02,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {1525#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1518#false} is VALID [2022-04-08 10:03:02,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {1518#false} assume !(~z~0 % 4294967296 > 0); {1518#false} is VALID [2022-04-08 10:03:02,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {1518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1518#false} is VALID [2022-04-08 10:03:02,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {1518#false} assume !(~y~0 % 4294967296 > 0); {1518#false} is VALID [2022-04-08 10:03:02,690 INFO L272 TraceCheckUtils]: 14: Hoare triple {1518#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1518#false} is VALID [2022-04-08 10:03:02,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {1518#false} ~cond := #in~cond; {1518#false} is VALID [2022-04-08 10:03:02,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {1518#false} assume 0 == ~cond; {1518#false} is VALID [2022-04-08 10:03:02,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {1518#false} assume !false; {1518#false} is VALID [2022-04-08 10:03:02,691 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:03:02,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:02,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134614554] [2022-04-08 10:03:02,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134614554] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:02,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851722467] [2022-04-08 10:03:02,692 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:02,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:02,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:02,693 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-08 10:03:02,694 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-08 10:03:02,741 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-08 10:03:02,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:02,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 10:03:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:02,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:02,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {1517#true} call ULTIMATE.init(); {1517#true} is VALID [2022-04-08 10:03:02,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {1517#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1517#true} is VALID [2022-04-08 10:03:02,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {1517#true} assume true; {1517#true} is VALID [2022-04-08 10:03:02,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1517#true} {1517#true} #61#return; {1517#true} is VALID [2022-04-08 10:03:02,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {1517#true} call #t~ret11 := main(); {1517#true} is VALID [2022-04-08 10:03:02,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {1517#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1522#(= main_~y~0 0)} is VALID [2022-04-08 10:03:02,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {1522#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:02,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {1523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:02,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {1523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1554#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:02,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {1554#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1558#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:02,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {1558#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1518#false} is VALID [2022-04-08 10:03:02,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {1518#false} assume !(~z~0 % 4294967296 > 0); {1518#false} is VALID [2022-04-08 10:03:02,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {1518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1518#false} is VALID [2022-04-08 10:03:02,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {1518#false} assume !(~y~0 % 4294967296 > 0); {1518#false} is VALID [2022-04-08 10:03:02,852 INFO L272 TraceCheckUtils]: 14: Hoare triple {1518#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1518#false} is VALID [2022-04-08 10:03:02,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {1518#false} ~cond := #in~cond; {1518#false} is VALID [2022-04-08 10:03:02,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {1518#false} assume 0 == ~cond; {1518#false} is VALID [2022-04-08 10:03:02,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {1518#false} assume !false; {1518#false} is VALID [2022-04-08 10:03:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:03:02,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:02,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {1518#false} assume !false; {1518#false} is VALID [2022-04-08 10:03:02,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {1518#false} assume 0 == ~cond; {1518#false} is VALID [2022-04-08 10:03:02,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {1518#false} ~cond := #in~cond; {1518#false} is VALID [2022-04-08 10:03:02,990 INFO L272 TraceCheckUtils]: 14: Hoare triple {1518#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1518#false} is VALID [2022-04-08 10:03:02,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {1595#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1518#false} is VALID [2022-04-08 10:03:02,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {1599#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1595#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:02,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {1599#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1599#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:02,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {1606#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1599#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:02,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {1610#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1606#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-08 10:03:02,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {1517#true} ~z~0 := ~y~0; {1610#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:02,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {1517#true} assume !(~x~0 % 4294967296 > 0); {1517#true} is VALID [2022-04-08 10:03:02,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {1517#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1517#true} is VALID [2022-04-08 10:03:02,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {1517#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1517#true} is VALID [2022-04-08 10:03:02,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {1517#true} call #t~ret11 := main(); {1517#true} is VALID [2022-04-08 10:03:02,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1517#true} {1517#true} #61#return; {1517#true} is VALID [2022-04-08 10:03:02,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {1517#true} assume true; {1517#true} is VALID [2022-04-08 10:03:02,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {1517#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1517#true} is VALID [2022-04-08 10:03:02,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {1517#true} call ULTIMATE.init(); {1517#true} is VALID [2022-04-08 10:03:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:03:02,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851722467] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:02,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:02,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-04-08 10:03:02,997 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:02,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1090183614] [2022-04-08 10:03:02,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1090183614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:02,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:02,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:03:02,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627477604] [2022-04-08 10:03:02,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:02,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 10:03:02,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:02,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:03,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:03,016 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:03:03,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:03,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:03:03,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:03:03,016 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:03,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:03,211 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-08 10:03:03,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:03:03,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 10:03:03,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:03,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-08 10:03:03,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:03,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-08 10:03:03,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-08 10:03:03,240 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-08 10:03:03,241 INFO L225 Difference]: With dead ends: 32 [2022-04-08 10:03:03,241 INFO L226 Difference]: Without dead ends: 21 [2022-04-08 10:03:03,241 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2022-04-08 10:03:03,242 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:03,242 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 36 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:03,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-08 10:03:03,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-08 10:03:03,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:03,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:03,260 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:03,261 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:03,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:03,261 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-08 10:03:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-08 10:03:03,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:03,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:03,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-08 10:03:03,262 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-08 10:03:03,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:03,263 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-08 10:03:03,263 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-08 10:03:03,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:03,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:03,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:03,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:03,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:03,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-08 10:03:03,264 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 18 [2022-04-08 10:03:03,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:03,264 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-08 10:03:03,264 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:03,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-08 10:03:03,289 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-08 10:03:03,290 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-08 10:03:03,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 10:03:03,290 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:03,290 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:03,308 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-08 10:03:03,491 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:03,491 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:03,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:03,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1675054353, now seen corresponding path program 7 times [2022-04-08 10:03:03,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:03,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1906567124] [2022-04-08 10:03:03,495 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:03,496 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:03,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1675054353, now seen corresponding path program 8 times [2022-04-08 10:03:03,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:03,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460115560] [2022-04-08 10:03:03,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:03,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:03,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:03,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {1806#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1796#true} is VALID [2022-04-08 10:03:03,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#true} assume true; {1796#true} is VALID [2022-04-08 10:03:03,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1796#true} {1796#true} #61#return; {1796#true} is VALID [2022-04-08 10:03:03,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {1796#true} call ULTIMATE.init(); {1806#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:03,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {1806#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1796#true} is VALID [2022-04-08 10:03:03,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {1796#true} assume true; {1796#true} is VALID [2022-04-08 10:03:03,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1796#true} {1796#true} #61#return; {1796#true} is VALID [2022-04-08 10:03:03,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {1796#true} call #t~ret11 := main(); {1796#true} is VALID [2022-04-08 10:03:03,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {1796#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1801#(= main_~y~0 0)} is VALID [2022-04-08 10:03:03,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {1801#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1802#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:03,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {1802#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1803#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:03,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {1803#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {1803#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:03,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {1803#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {1804#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:03,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {1804#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1805#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:03,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {1805#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1797#false} is VALID [2022-04-08 10:03:03,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {1797#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1797#false} is VALID [2022-04-08 10:03:03,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {1797#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1797#false} is VALID [2022-04-08 10:03:03,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {1797#false} assume !(~y~0 % 4294967296 > 0); {1797#false} is VALID [2022-04-08 10:03:03,599 INFO L272 TraceCheckUtils]: 15: Hoare triple {1797#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1797#false} is VALID [2022-04-08 10:03:03,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {1797#false} ~cond := #in~cond; {1797#false} is VALID [2022-04-08 10:03:03,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {1797#false} assume 0 == ~cond; {1797#false} is VALID [2022-04-08 10:03:03,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {1797#false} assume !false; {1797#false} is VALID [2022-04-08 10:03:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:03,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:03,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460115560] [2022-04-08 10:03:03,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460115560] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:03,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337700021] [2022-04-08 10:03:03,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:03,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:03,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:03,604 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-08 10:03:03,633 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-08 10:03:03,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:03,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:03,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:03:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:03,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:03,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {1796#true} call ULTIMATE.init(); {1796#true} is VALID [2022-04-08 10:03:03,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1796#true} is VALID [2022-04-08 10:03:03,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {1796#true} assume true; {1796#true} is VALID [2022-04-08 10:03:03,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1796#true} {1796#true} #61#return; {1796#true} is VALID [2022-04-08 10:03:03,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {1796#true} call #t~ret11 := main(); {1796#true} is VALID [2022-04-08 10:03:03,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {1796#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1801#(= main_~y~0 0)} is VALID [2022-04-08 10:03:03,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {1801#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1802#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:03,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {1802#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1803#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:03,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {1803#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {1803#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:03,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {1803#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {1837#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:03,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {1837#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1841#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:03,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {1841#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {1797#false} is VALID [2022-04-08 10:03:03,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {1797#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1797#false} is VALID [2022-04-08 10:03:03,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {1797#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1797#false} is VALID [2022-04-08 10:03:03,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {1797#false} assume !(~y~0 % 4294967296 > 0); {1797#false} is VALID [2022-04-08 10:03:03,776 INFO L272 TraceCheckUtils]: 15: Hoare triple {1797#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1797#false} is VALID [2022-04-08 10:03:03,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {1797#false} ~cond := #in~cond; {1797#false} is VALID [2022-04-08 10:03:03,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {1797#false} assume 0 == ~cond; {1797#false} is VALID [2022-04-08 10:03:03,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {1797#false} assume !false; {1797#false} is VALID [2022-04-08 10:03:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:03,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:03,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {1797#false} assume !false; {1797#false} is VALID [2022-04-08 10:03:03,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {1797#false} assume 0 == ~cond; {1797#false} is VALID [2022-04-08 10:03:03,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {1797#false} ~cond := #in~cond; {1797#false} is VALID [2022-04-08 10:03:03,902 INFO L272 TraceCheckUtils]: 15: Hoare triple {1797#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1797#false} is VALID [2022-04-08 10:03:03,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {1797#false} assume !(~y~0 % 4294967296 > 0); {1797#false} is VALID [2022-04-08 10:03:03,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {1881#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1797#false} is VALID [2022-04-08 10:03:03,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {1885#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1881#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:03,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {1889#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {1885#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:03,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {1893#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1889#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:03:03,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {1796#true} ~z~0 := ~y~0; {1893#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:03:03,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {1796#true} assume !(~x~0 % 4294967296 > 0); {1796#true} is VALID [2022-04-08 10:03:03,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {1796#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1796#true} is VALID [2022-04-08 10:03:03,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {1796#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1796#true} is VALID [2022-04-08 10:03:03,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {1796#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1796#true} is VALID [2022-04-08 10:03:03,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {1796#true} call #t~ret11 := main(); {1796#true} is VALID [2022-04-08 10:03:03,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1796#true} {1796#true} #61#return; {1796#true} is VALID [2022-04-08 10:03:03,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {1796#true} assume true; {1796#true} is VALID [2022-04-08 10:03:03,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1796#true} is VALID [2022-04-08 10:03:03,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {1796#true} call ULTIMATE.init(); {1796#true} is VALID [2022-04-08 10:03:03,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:03,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337700021] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:03,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:03,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-04-08 10:03:03,913 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:03,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1906567124] [2022-04-08 10:03:03,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1906567124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:03,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:03,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:03:03,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29322547] [2022-04-08 10:03:03,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:03,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 10:03:03,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:03,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:03,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:03,943 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:03:03,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:03,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:03:03,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:03:03,944 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:04,241 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-04-08 10:03:04,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:03:04,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 10:03:04,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-08 10:03:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:04,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-08 10:03:04,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-08 10:03:04,282 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-08 10:03:04,283 INFO L225 Difference]: With dead ends: 38 [2022-04-08 10:03:04,283 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 10:03:04,283 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:03:04,284 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:04,284 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 39 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:04,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 10:03:04,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-08 10:03:04,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:04,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:04,314 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:04,314 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:04,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:04,315 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-08 10:03:04,315 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-08 10:03:04,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:04,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:04,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-08 10:03:04,316 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-08 10:03:04,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:04,317 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-08 10:03:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-08 10:03:04,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:04,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:04,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:04,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-04-08 10:03:04,318 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 19 [2022-04-08 10:03:04,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:04,319 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-04-08 10:03:04,319 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:04,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 34 transitions. [2022-04-08 10:03:04,371 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-08 10:03:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-08 10:03:04,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 10:03:04,372 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:04,372 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:04,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:04,572 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:04,573 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:04,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:04,573 INFO L85 PathProgramCache]: Analyzing trace with hash -854221811, now seen corresponding path program 9 times [2022-04-08 10:03:04,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:04,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [345578108] [2022-04-08 10:03:04,577 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:04,577 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:04,577 INFO L85 PathProgramCache]: Analyzing trace with hash -854221811, now seen corresponding path program 10 times [2022-04-08 10:03:04,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:04,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174994932] [2022-04-08 10:03:04,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:04,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:04,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:04,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {2140#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2130#true} is VALID [2022-04-08 10:03:04,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {2130#true} assume true; {2130#true} is VALID [2022-04-08 10:03:04,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2130#true} {2130#true} #61#return; {2130#true} is VALID [2022-04-08 10:03:04,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {2130#true} call ULTIMATE.init(); {2140#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:04,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {2140#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2130#true} is VALID [2022-04-08 10:03:04,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {2130#true} assume true; {2130#true} is VALID [2022-04-08 10:03:04,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2130#true} {2130#true} #61#return; {2130#true} is VALID [2022-04-08 10:03:04,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {2130#true} call #t~ret11 := main(); {2130#true} is VALID [2022-04-08 10:03:04,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {2130#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2130#true} is VALID [2022-04-08 10:03:04,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {2130#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2130#true} is VALID [2022-04-08 10:03:04,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {2130#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2130#true} is VALID [2022-04-08 10:03:04,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {2130#true} assume !(~x~0 % 4294967296 > 0); {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:04,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:04,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2136#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:04,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {2136#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:04,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:04,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2136#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:04,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {2136#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:04,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:04,728 INFO L272 TraceCheckUtils]: 16: Hoare triple {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2138#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:03:04,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {2138#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2139#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:03:04,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {2139#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2131#false} is VALID [2022-04-08 10:03:04,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {2131#false} assume !false; {2131#false} is VALID [2022-04-08 10:03:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:04,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:04,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174994932] [2022-04-08 10:03:04,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174994932] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:04,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89422525] [2022-04-08 10:03:04,729 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:04,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:04,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:04,730 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-08 10:03:04,740 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-08 10:03:04,777 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:04,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:04,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 10:03:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:04,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:05,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {2130#true} call ULTIMATE.init(); {2130#true} is VALID [2022-04-08 10:03:05,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {2130#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2130#true} is VALID [2022-04-08 10:03:05,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {2130#true} assume true; {2130#true} is VALID [2022-04-08 10:03:05,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2130#true} {2130#true} #61#return; {2130#true} is VALID [2022-04-08 10:03:05,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {2130#true} call #t~ret11 := main(); {2130#true} is VALID [2022-04-08 10:03:05,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {2130#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2130#true} is VALID [2022-04-08 10:03:05,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {2130#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2130#true} is VALID [2022-04-08 10:03:05,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {2130#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2130#true} is VALID [2022-04-08 10:03:05,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {2130#true} assume !(~x~0 % 4294967296 > 0); {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:05,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:05,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2136#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:05,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {2136#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:05,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:05,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2136#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:05,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {2136#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:05,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:05,050 INFO L272 TraceCheckUtils]: 16: Hoare triple {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2192#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:03:05,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {2192#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2196#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:03:05,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {2196#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2131#false} is VALID [2022-04-08 10:03:05,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {2131#false} assume !false; {2131#false} is VALID [2022-04-08 10:03:05,051 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:05,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:05,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {2131#false} assume !false; {2131#false} is VALID [2022-04-08 10:03:05,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {2196#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2131#false} is VALID [2022-04-08 10:03:05,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {2192#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2196#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:03:05,335 INFO L272 TraceCheckUtils]: 16: Hoare triple {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2192#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:03:05,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:05,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {2136#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:05,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2136#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:05,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:05,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {2136#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:05,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2136#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:05,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:05,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {2130#true} assume !(~x~0 % 4294967296 > 0); {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:05,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {2130#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2130#true} is VALID [2022-04-08 10:03:05,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {2130#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2130#true} is VALID [2022-04-08 10:03:05,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {2130#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2130#true} is VALID [2022-04-08 10:03:05,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {2130#true} call #t~ret11 := main(); {2130#true} is VALID [2022-04-08 10:03:05,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2130#true} {2130#true} #61#return; {2130#true} is VALID [2022-04-08 10:03:05,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {2130#true} assume true; {2130#true} is VALID [2022-04-08 10:03:05,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {2130#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2130#true} is VALID [2022-04-08 10:03:05,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {2130#true} call ULTIMATE.init(); {2130#true} is VALID [2022-04-08 10:03:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:05,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89422525] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:05,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:05,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-08 10:03:05,342 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:05,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [345578108] [2022-04-08 10:03:05,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [345578108] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:05,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:05,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:03:05,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207119489] [2022-04-08 10:03:05,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:05,343 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) 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 20 [2022-04-08 10:03:05,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:05,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 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-08 10:03:05,361 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-08 10:03:05,361 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:03:05,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:05,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:03:05,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:03:05,362 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 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-08 10:03:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:05,678 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-08 10:03:05,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:03:05,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) 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 20 [2022-04-08 10:03:05,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:05,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) 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-08 10:03:05,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-08 10:03:05,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) 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-08 10:03:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-08 10:03:05,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2022-04-08 10:03:05,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:05,713 INFO L225 Difference]: With dead ends: 44 [2022-04-08 10:03:05,713 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 10:03:05,713 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:03:05,714 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:05,714 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 44 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:05,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 10:03:05,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2022-04-08 10:03:05,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:05,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:05,752 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:05,753 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:05,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:05,754 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-08 10:03:05,754 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-08 10:03:05,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:05,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:05,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-08 10:03:05,757 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-08 10:03:05,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:05,759 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-08 10:03:05,760 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-08 10:03:05,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:05,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:05,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:05,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:05,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:05,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-04-08 10:03:05,761 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2022-04-08 10:03:05,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:05,763 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-04-08 10:03:05,763 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) 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-08 10:03:05,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 40 transitions. [2022-04-08 10:03:05,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-08 10:03:05,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 10:03:05,809 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:05,810 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:05,826 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-08 10:03:06,010 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:06,011 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:06,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:06,011 INFO L85 PathProgramCache]: Analyzing trace with hash -930628562, now seen corresponding path program 11 times [2022-04-08 10:03:06,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:06,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [95431173] [2022-04-08 10:03:06,017 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:06,017 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:06,017 INFO L85 PathProgramCache]: Analyzing trace with hash -930628562, now seen corresponding path program 12 times [2022-04-08 10:03:06,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:06,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470684125] [2022-04-08 10:03:06,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:06,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:06,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:06,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {2509#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2498#true} is VALID [2022-04-08 10:03:06,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {2498#true} assume true; {2498#true} is VALID [2022-04-08 10:03:06,132 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2498#true} {2498#true} #61#return; {2498#true} is VALID [2022-04-08 10:03:06,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {2498#true} call ULTIMATE.init(); {2509#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:06,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {2509#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2498#true} is VALID [2022-04-08 10:03:06,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {2498#true} assume true; {2498#true} is VALID [2022-04-08 10:03:06,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2498#true} {2498#true} #61#return; {2498#true} is VALID [2022-04-08 10:03:06,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {2498#true} call #t~ret11 := main(); {2498#true} is VALID [2022-04-08 10:03:06,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {2498#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2503#(= main_~y~0 0)} is VALID [2022-04-08 10:03:06,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {2503#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2504#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:06,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {2504#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2505#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:06,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {2505#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2506#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:06,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {2506#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2506#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:06,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {2506#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {2507#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:06,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {2507#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2508#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:06,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {2508#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2499#false} is VALID [2022-04-08 10:03:06,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {2499#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2499#false} is VALID [2022-04-08 10:03:06,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {2499#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2499#false} is VALID [2022-04-08 10:03:06,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {2499#false} assume !(~y~0 % 4294967296 > 0); {2499#false} is VALID [2022-04-08 10:03:06,137 INFO L272 TraceCheckUtils]: 16: Hoare triple {2499#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2499#false} is VALID [2022-04-08 10:03:06,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {2499#false} ~cond := #in~cond; {2499#false} is VALID [2022-04-08 10:03:06,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {2499#false} assume 0 == ~cond; {2499#false} is VALID [2022-04-08 10:03:06,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {2499#false} assume !false; {2499#false} is VALID [2022-04-08 10:03:06,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:06,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:06,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470684125] [2022-04-08 10:03:06,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470684125] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:06,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300102236] [2022-04-08 10:03:06,138 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:06,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:06,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:06,139 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-08 10:03:06,164 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-08 10:03:06,184 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:03:06,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:06,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 10:03:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:06,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:06,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {2498#true} call ULTIMATE.init(); {2498#true} is VALID [2022-04-08 10:03:06,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {2498#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2498#true} is VALID [2022-04-08 10:03:06,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {2498#true} assume true; {2498#true} is VALID [2022-04-08 10:03:06,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2498#true} {2498#true} #61#return; {2498#true} is VALID [2022-04-08 10:03:06,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {2498#true} call #t~ret11 := main(); {2498#true} is VALID [2022-04-08 10:03:06,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {2498#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2503#(= main_~y~0 0)} is VALID [2022-04-08 10:03:06,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {2503#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2504#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:06,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {2504#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2505#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:06,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {2505#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2506#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:06,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {2506#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2506#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:06,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {2506#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {2543#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:06,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {2543#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2547#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:06,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {2547#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {2499#false} is VALID [2022-04-08 10:03:06,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {2499#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2499#false} is VALID [2022-04-08 10:03:06,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {2499#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2499#false} is VALID [2022-04-08 10:03:06,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {2499#false} assume !(~y~0 % 4294967296 > 0); {2499#false} is VALID [2022-04-08 10:03:06,332 INFO L272 TraceCheckUtils]: 16: Hoare triple {2499#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2499#false} is VALID [2022-04-08 10:03:06,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {2499#false} ~cond := #in~cond; {2499#false} is VALID [2022-04-08 10:03:06,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {2499#false} assume 0 == ~cond; {2499#false} is VALID [2022-04-08 10:03:06,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {2499#false} assume !false; {2499#false} is VALID [2022-04-08 10:03:06,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:06,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:06,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {2499#false} assume !false; {2499#false} is VALID [2022-04-08 10:03:06,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {2499#false} assume 0 == ~cond; {2499#false} is VALID [2022-04-08 10:03:06,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {2499#false} ~cond := #in~cond; {2499#false} is VALID [2022-04-08 10:03:06,453 INFO L272 TraceCheckUtils]: 16: Hoare triple {2499#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2499#false} is VALID [2022-04-08 10:03:06,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {2499#false} assume !(~y~0 % 4294967296 > 0); {2499#false} is VALID [2022-04-08 10:03:06,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {2587#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2499#false} is VALID [2022-04-08 10:03:06,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {2591#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2587#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:06,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {2595#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2591#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:06,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {2599#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2595#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:03:06,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {2498#true} ~z~0 := ~y~0; {2599#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:03:06,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {2498#true} assume !(~x~0 % 4294967296 > 0); {2498#true} is VALID [2022-04-08 10:03:06,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {2498#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2498#true} is VALID [2022-04-08 10:03:06,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {2498#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2498#true} is VALID [2022-04-08 10:03:06,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {2498#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2498#true} is VALID [2022-04-08 10:03:06,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {2498#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2498#true} is VALID [2022-04-08 10:03:06,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {2498#true} call #t~ret11 := main(); {2498#true} is VALID [2022-04-08 10:03:06,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2498#true} {2498#true} #61#return; {2498#true} is VALID [2022-04-08 10:03:06,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {2498#true} assume true; {2498#true} is VALID [2022-04-08 10:03:06,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {2498#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2498#true} is VALID [2022-04-08 10:03:06,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {2498#true} call ULTIMATE.init(); {2498#true} is VALID [2022-04-08 10:03:06,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:03:06,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300102236] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:06,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:06,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 15 [2022-04-08 10:03:06,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:06,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [95431173] [2022-04-08 10:03:06,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [95431173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:06,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:06,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:03:06,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991465948] [2022-04-08 10:03:06,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:06,459 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 10:03:06,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:06,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:06,474 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-08 10:03:06,475 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:03:06,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:06,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:03:06,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:03:06,475 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:06,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:06,931 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-08 10:03:06,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:03:06,931 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 10:03:06,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:06,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-04-08 10:03:06,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-04-08 10:03:06,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 47 transitions. [2022-04-08 10:03:06,976 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-08 10:03:06,977 INFO L225 Difference]: With dead ends: 55 [2022-04-08 10:03:06,978 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 10:03:06,978 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:03:06,978 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:06,979 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 46 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:06,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 10:03:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2022-04-08 10:03:07,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:07,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:07,042 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:07,042 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:07,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:07,044 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-08 10:03:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-08 10:03:07,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:07,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:07,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 3 states have call successors, (3), 3 states 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-08 10:03:07,044 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 3 states have call successors, (3), 3 states 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-08 10:03:07,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:07,045 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-08 10:03:07,045 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-08 10:03:07,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:07,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:07,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:07,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:07,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2022-04-08 10:03:07,047 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 20 [2022-04-08 10:03:07,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:07,047 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-04-08 10:03:07,047 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:07,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 48 transitions. [2022-04-08 10:03:07,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:07,109 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-04-08 10:03:07,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 10:03:07,109 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:07,109 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:07,137 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-08 10:03:07,310 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 10:03:07,310 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:07,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:07,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1178216785, now seen corresponding path program 13 times [2022-04-08 10:03:07,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:07,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2053422603] [2022-04-08 10:03:07,314 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:07,314 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:07,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1178216785, now seen corresponding path program 14 times [2022-04-08 10:03:07,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:07,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58098077] [2022-04-08 10:03:07,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:07,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:07,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:07,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {2942#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2931#true} is VALID [2022-04-08 10:03:07,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {2931#true} assume true; {2931#true} is VALID [2022-04-08 10:03:07,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2931#true} {2931#true} #61#return; {2931#true} is VALID [2022-04-08 10:03:07,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {2931#true} call ULTIMATE.init(); {2942#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:07,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {2942#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2931#true} is VALID [2022-04-08 10:03:07,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {2931#true} assume true; {2931#true} is VALID [2022-04-08 10:03:07,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2931#true} {2931#true} #61#return; {2931#true} is VALID [2022-04-08 10:03:07,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {2931#true} call #t~ret11 := main(); {2931#true} is VALID [2022-04-08 10:03:07,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {2931#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2936#(= main_~y~0 0)} is VALID [2022-04-08 10:03:07,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {2936#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2937#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:07,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {2937#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:07,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {2938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:07,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {2938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2939#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:07,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {2939#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2940#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:07,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {2940#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2941#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:03:07,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {2941#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2932#false} is VALID [2022-04-08 10:03:07,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {2932#false} assume !(~z~0 % 4294967296 > 0); {2932#false} is VALID [2022-04-08 10:03:07,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {2932#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2932#false} is VALID [2022-04-08 10:03:07,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {2932#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2932#false} is VALID [2022-04-08 10:03:07,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {2932#false} assume !(~y~0 % 4294967296 > 0); {2932#false} is VALID [2022-04-08 10:03:07,417 INFO L272 TraceCheckUtils]: 17: Hoare triple {2932#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2932#false} is VALID [2022-04-08 10:03:07,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {2932#false} ~cond := #in~cond; {2932#false} is VALID [2022-04-08 10:03:07,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {2932#false} assume 0 == ~cond; {2932#false} is VALID [2022-04-08 10:03:07,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {2932#false} assume !false; {2932#false} is VALID [2022-04-08 10:03:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:07,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:07,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58098077] [2022-04-08 10:03:07,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58098077] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:07,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121185511] [2022-04-08 10:03:07,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:07,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:07,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:07,419 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-08 10:03:07,419 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-08 10:03:07,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:07,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:07,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 10:03:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:07,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:07,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {2931#true} call ULTIMATE.init(); {2931#true} is VALID [2022-04-08 10:03:07,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {2931#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2931#true} is VALID [2022-04-08 10:03:07,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {2931#true} assume true; {2931#true} is VALID [2022-04-08 10:03:07,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2931#true} {2931#true} #61#return; {2931#true} is VALID [2022-04-08 10:03:07,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {2931#true} call #t~ret11 := main(); {2931#true} is VALID [2022-04-08 10:03:07,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {2931#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2936#(= main_~y~0 0)} is VALID [2022-04-08 10:03:07,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {2936#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2937#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:07,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {2937#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:07,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {2938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:07,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {2938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2973#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:07,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {2973#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2977#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:07,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {2977#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2981#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:03:07,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {2981#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2932#false} is VALID [2022-04-08 10:03:07,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {2932#false} assume !(~z~0 % 4294967296 > 0); {2932#false} is VALID [2022-04-08 10:03:07,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {2932#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2932#false} is VALID [2022-04-08 10:03:07,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {2932#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2932#false} is VALID [2022-04-08 10:03:07,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {2932#false} assume !(~y~0 % 4294967296 > 0); {2932#false} is VALID [2022-04-08 10:03:07,618 INFO L272 TraceCheckUtils]: 17: Hoare triple {2932#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2932#false} is VALID [2022-04-08 10:03:07,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {2932#false} ~cond := #in~cond; {2932#false} is VALID [2022-04-08 10:03:07,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {2932#false} assume 0 == ~cond; {2932#false} is VALID [2022-04-08 10:03:07,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {2932#false} assume !false; {2932#false} is VALID [2022-04-08 10:03:07,619 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:07,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:07,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {2932#false} assume !false; {2932#false} is VALID [2022-04-08 10:03:07,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {2932#false} assume 0 == ~cond; {2932#false} is VALID [2022-04-08 10:03:07,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {2932#false} ~cond := #in~cond; {2932#false} is VALID [2022-04-08 10:03:07,798 INFO L272 TraceCheckUtils]: 17: Hoare triple {2932#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2932#false} is VALID [2022-04-08 10:03:07,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {3021#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2932#false} is VALID [2022-04-08 10:03:07,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {3025#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3021#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:07,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {3029#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3025#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:07,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {3029#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3029#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:07,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {3036#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3029#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:07,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {3040#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3036#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-08 10:03:07,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {3044#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3040#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:03:07,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {2931#true} ~z~0 := ~y~0; {3044#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:03:07,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {2931#true} assume !(~x~0 % 4294967296 > 0); {2931#true} is VALID [2022-04-08 10:03:07,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {2931#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2931#true} is VALID [2022-04-08 10:03:07,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {2931#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2931#true} is VALID [2022-04-08 10:03:07,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {2931#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2931#true} is VALID [2022-04-08 10:03:07,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {2931#true} call #t~ret11 := main(); {2931#true} is VALID [2022-04-08 10:03:07,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2931#true} {2931#true} #61#return; {2931#true} is VALID [2022-04-08 10:03:07,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {2931#true} assume true; {2931#true} is VALID [2022-04-08 10:03:07,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {2931#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2931#true} is VALID [2022-04-08 10:03:07,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {2931#true} call ULTIMATE.init(); {2931#true} is VALID [2022-04-08 10:03:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:07,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121185511] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:07,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:07,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-08 10:03:07,806 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:07,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2053422603] [2022-04-08 10:03:07,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2053422603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:07,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:07,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:03:07,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331679884] [2022-04-08 10:03:07,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:07,807 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 10:03:07,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:07,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:07,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:07,824 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:03:07,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:07,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:03:07,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:03:07,825 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:08,147 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-08 10:03:08,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:03:08,147 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 10:03:08,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:08,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2022-04-08 10:03:08,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2022-04-08 10:03:08,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 33 transitions. [2022-04-08 10:03:08,177 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-08 10:03:08,178 INFO L225 Difference]: With dead ends: 47 [2022-04-08 10:03:08,178 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 10:03:08,178 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:03:08,179 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:08,179 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 46 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:08,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 10:03:08,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 10:03:08,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:08,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 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-08 10:03:08,230 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 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-08 10:03:08,230 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 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-08 10:03:08,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:08,232 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-08 10:03:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-08 10:03:08,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:08,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:08,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 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 34 states. [2022-04-08 10:03:08,232 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 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 34 states. [2022-04-08 10:03:08,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:08,233 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-08 10:03:08,233 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-08 10:03:08,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:08,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:08,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:08,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 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-08 10:03:08,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-04-08 10:03:08,234 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 21 [2022-04-08 10:03:08,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:08,235 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-04-08 10:03:08,235 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:08,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 41 transitions. [2022-04-08 10:03:08,296 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-08 10:03:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-08 10:03:08,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 10:03:08,297 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:08,297 INFO L499 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:08,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-08 10:03:08,497 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:08,498 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:08,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:08,498 INFO L85 PathProgramCache]: Analyzing trace with hash 671734479, now seen corresponding path program 15 times [2022-04-08 10:03:08,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:08,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1248099411] [2022-04-08 10:03:08,502 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:08,502 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:08,502 INFO L85 PathProgramCache]: Analyzing trace with hash 671734479, now seen corresponding path program 16 times [2022-04-08 10:03:08,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:08,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62477363] [2022-04-08 10:03:08,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:08,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:08,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:08,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {3331#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3319#true} is VALID [2022-04-08 10:03:08,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {3319#true} assume true; {3319#true} is VALID [2022-04-08 10:03:08,635 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3319#true} {3319#true} #61#return; {3319#true} is VALID [2022-04-08 10:03:08,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {3319#true} call ULTIMATE.init(); {3331#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:08,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {3331#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3319#true} is VALID [2022-04-08 10:03:08,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {3319#true} assume true; {3319#true} is VALID [2022-04-08 10:03:08,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3319#true} {3319#true} #61#return; {3319#true} is VALID [2022-04-08 10:03:08,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {3319#true} call #t~ret11 := main(); {3319#true} is VALID [2022-04-08 10:03:08,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {3319#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3324#(= main_~y~0 0)} is VALID [2022-04-08 10:03:08,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {3324#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3325#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:08,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {3325#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3326#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:08,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {3326#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3327#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:08,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {3327#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3328#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:08,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {3328#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3328#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:08,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {3328#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {3329#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:08,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {3329#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3330#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:08,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {3330#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {3320#false} is VALID [2022-04-08 10:03:08,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {3320#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3320#false} is VALID [2022-04-08 10:03:08,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {3320#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3320#false} is VALID [2022-04-08 10:03:08,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {3320#false} assume !(~y~0 % 4294967296 > 0); {3320#false} is VALID [2022-04-08 10:03:08,640 INFO L272 TraceCheckUtils]: 17: Hoare triple {3320#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3320#false} is VALID [2022-04-08 10:03:08,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {3320#false} ~cond := #in~cond; {3320#false} is VALID [2022-04-08 10:03:08,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {3320#false} assume 0 == ~cond; {3320#false} is VALID [2022-04-08 10:03:08,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {3320#false} assume !false; {3320#false} is VALID [2022-04-08 10:03:08,641 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:08,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:08,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62477363] [2022-04-08 10:03:08,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62477363] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:08,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488658108] [2022-04-08 10:03:08,641 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:08,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:08,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:08,642 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-08 10:03:08,657 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-08 10:03:08,691 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:08,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:08,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 10:03:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:08,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:08,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {3319#true} call ULTIMATE.init(); {3319#true} is VALID [2022-04-08 10:03:08,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {3319#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3319#true} is VALID [2022-04-08 10:03:08,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {3319#true} assume true; {3319#true} is VALID [2022-04-08 10:03:08,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3319#true} {3319#true} #61#return; {3319#true} is VALID [2022-04-08 10:03:08,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {3319#true} call #t~ret11 := main(); {3319#true} is VALID [2022-04-08 10:03:08,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {3319#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3324#(= main_~y~0 0)} is VALID [2022-04-08 10:03:08,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {3324#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3325#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:08,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {3325#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3326#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:08,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {3326#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3327#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:08,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {3327#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3328#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:08,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {3328#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3328#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:08,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {3328#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {3368#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:08,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {3368#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3372#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:08,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {3372#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {3320#false} is VALID [2022-04-08 10:03:08,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {3320#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3320#false} is VALID [2022-04-08 10:03:08,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {3320#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3320#false} is VALID [2022-04-08 10:03:08,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {3320#false} assume !(~y~0 % 4294967296 > 0); {3320#false} is VALID [2022-04-08 10:03:08,850 INFO L272 TraceCheckUtils]: 17: Hoare triple {3320#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3320#false} is VALID [2022-04-08 10:03:08,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {3320#false} ~cond := #in~cond; {3320#false} is VALID [2022-04-08 10:03:08,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {3320#false} assume 0 == ~cond; {3320#false} is VALID [2022-04-08 10:03:08,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {3320#false} assume !false; {3320#false} is VALID [2022-04-08 10:03:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:08,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:08,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {3320#false} assume !false; {3320#false} is VALID [2022-04-08 10:03:08,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {3320#false} assume 0 == ~cond; {3320#false} is VALID [2022-04-08 10:03:08,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {3320#false} ~cond := #in~cond; {3320#false} is VALID [2022-04-08 10:03:08,977 INFO L272 TraceCheckUtils]: 17: Hoare triple {3320#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3320#false} is VALID [2022-04-08 10:03:08,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {3320#false} assume !(~y~0 % 4294967296 > 0); {3320#false} is VALID [2022-04-08 10:03:08,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {3412#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3320#false} is VALID [2022-04-08 10:03:08,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {3416#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3412#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:08,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {3420#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3416#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:08,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {3424#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3420#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:03:08,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {3319#true} ~z~0 := ~y~0; {3424#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:03:08,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {3319#true} assume !(~x~0 % 4294967296 > 0); {3319#true} is VALID [2022-04-08 10:03:08,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {3319#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3319#true} is VALID [2022-04-08 10:03:08,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {3319#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3319#true} is VALID [2022-04-08 10:03:08,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {3319#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3319#true} is VALID [2022-04-08 10:03:08,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {3319#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3319#true} is VALID [2022-04-08 10:03:08,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {3319#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3319#true} is VALID [2022-04-08 10:03:08,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {3319#true} call #t~ret11 := main(); {3319#true} is VALID [2022-04-08 10:03:08,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3319#true} {3319#true} #61#return; {3319#true} is VALID [2022-04-08 10:03:08,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {3319#true} assume true; {3319#true} is VALID [2022-04-08 10:03:08,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {3319#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3319#true} is VALID [2022-04-08 10:03:08,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {3319#true} call ULTIMATE.init(); {3319#true} is VALID [2022-04-08 10:03:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:03:08,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488658108] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:08,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:08,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 6] total 16 [2022-04-08 10:03:08,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:08,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1248099411] [2022-04-08 10:03:08,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1248099411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:08,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:08,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:03:08,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690776620] [2022-04-08 10:03:08,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:08,983 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 10:03:08,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:08,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:08,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:08,999 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:03:08,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:08,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:03:09,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:03:09,000 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:09,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:09,518 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-08 10:03:09,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:03:09,518 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 10:03:09,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:09,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:09,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-04-08 10:03:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:09,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-04-08 10:03:09,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2022-04-08 10:03:09,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:09,574 INFO L225 Difference]: With dead ends: 57 [2022-04-08 10:03:09,574 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 10:03:09,574 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:03:09,575 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:09,575 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:03:09,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 10:03:09,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2022-04-08 10:03:09,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:09,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 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-08 10:03:09,641 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 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-08 10:03:09,641 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 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-08 10:03:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:09,642 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-08 10:03:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-08 10:03:09,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:09,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:09,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 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 49 states. [2022-04-08 10:03:09,643 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 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 49 states. [2022-04-08 10:03:09,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:09,644 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-08 10:03:09,644 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-08 10:03:09,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:09,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:09,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:09,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:09,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 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-08 10:03:09,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-08 10:03:09,646 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 21 [2022-04-08 10:03:09,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:09,646 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-08 10:03:09,646 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:09,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 49 transitions. [2022-04-08 10:03:09,711 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-08 10:03:09,711 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-08 10:03:09,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:03:09,712 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:09,712 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:09,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:09,912 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,SelfDestructingSolverStorable12 [2022-04-08 10:03:09,912 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:09,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:09,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1752036735, now seen corresponding path program 17 times [2022-04-08 10:03:09,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:09,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [202343662] [2022-04-08 10:03:09,925 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:09,925 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:09,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1752036735, now seen corresponding path program 18 times [2022-04-08 10:03:09,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:09,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79983056] [2022-04-08 10:03:09,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:09,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:10,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:10,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {3783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3771#true} is VALID [2022-04-08 10:03:10,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {3771#true} assume true; {3771#true} is VALID [2022-04-08 10:03:10,047 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3771#true} {3771#true} #61#return; {3771#true} is VALID [2022-04-08 10:03:10,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {3771#true} call ULTIMATE.init(); {3783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:10,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {3783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3771#true} is VALID [2022-04-08 10:03:10,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {3771#true} assume true; {3771#true} is VALID [2022-04-08 10:03:10,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3771#true} {3771#true} #61#return; {3771#true} is VALID [2022-04-08 10:03:10,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {3771#true} call #t~ret11 := main(); {3771#true} is VALID [2022-04-08 10:03:10,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {3771#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3776#(= main_~y~0 0)} is VALID [2022-04-08 10:03:10,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {3776#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3777#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:10,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {3777#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3778#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:10,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {3778#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:10,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {3779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:10,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {3779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {3780#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:10,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {3780#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3781#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:10,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {3781#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3782#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:10,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {3782#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3772#false} is VALID [2022-04-08 10:03:10,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {3772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3772#false} is VALID [2022-04-08 10:03:10,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {3772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3772#false} is VALID [2022-04-08 10:03:10,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {3772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3772#false} is VALID [2022-04-08 10:03:10,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {3772#false} assume !(~y~0 % 4294967296 > 0); {3772#false} is VALID [2022-04-08 10:03:10,053 INFO L272 TraceCheckUtils]: 18: Hoare triple {3772#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3772#false} is VALID [2022-04-08 10:03:10,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {3772#false} ~cond := #in~cond; {3772#false} is VALID [2022-04-08 10:03:10,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {3772#false} assume 0 == ~cond; {3772#false} is VALID [2022-04-08 10:03:10,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {3772#false} assume !false; {3772#false} is VALID [2022-04-08 10:03:10,054 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:03:10,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:10,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79983056] [2022-04-08 10:03:10,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79983056] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:10,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73680645] [2022-04-08 10:03:10,054 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:10,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:10,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:10,055 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-08 10:03:10,081 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-08 10:03:10,101 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:03:10,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:10,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 10:03:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:10,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:10,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {3771#true} call ULTIMATE.init(); {3771#true} is VALID [2022-04-08 10:03:10,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {3771#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3771#true} is VALID [2022-04-08 10:03:10,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {3771#true} assume true; {3771#true} is VALID [2022-04-08 10:03:10,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3771#true} {3771#true} #61#return; {3771#true} is VALID [2022-04-08 10:03:10,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {3771#true} call #t~ret11 := main(); {3771#true} is VALID [2022-04-08 10:03:10,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {3771#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3776#(= main_~y~0 0)} is VALID [2022-04-08 10:03:10,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {3776#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3777#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:10,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {3777#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3778#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:10,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {3778#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:10,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {3779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:10,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {3779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {3817#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:10,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {3817#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3821#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:10,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {3821#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3825#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:10,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {3825#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {3772#false} is VALID [2022-04-08 10:03:10,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {3772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3772#false} is VALID [2022-04-08 10:03:10,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {3772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3772#false} is VALID [2022-04-08 10:03:10,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {3772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3772#false} is VALID [2022-04-08 10:03:10,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {3772#false} assume !(~y~0 % 4294967296 > 0); {3772#false} is VALID [2022-04-08 10:03:10,260 INFO L272 TraceCheckUtils]: 18: Hoare triple {3772#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3772#false} is VALID [2022-04-08 10:03:10,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {3772#false} ~cond := #in~cond; {3772#false} is VALID [2022-04-08 10:03:10,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {3772#false} assume 0 == ~cond; {3772#false} is VALID [2022-04-08 10:03:10,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {3772#false} assume !false; {3772#false} is VALID [2022-04-08 10:03:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:03:10,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:10,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {3772#false} assume !false; {3772#false} is VALID [2022-04-08 10:03:10,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {3772#false} assume 0 == ~cond; {3772#false} is VALID [2022-04-08 10:03:10,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {3772#false} ~cond := #in~cond; {3772#false} is VALID [2022-04-08 10:03:10,453 INFO L272 TraceCheckUtils]: 18: Hoare triple {3772#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3772#false} is VALID [2022-04-08 10:03:10,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {3772#false} assume !(~y~0 % 4294967296 > 0); {3772#false} is VALID [2022-04-08 10:03:10,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {3868#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3772#false} is VALID [2022-04-08 10:03:10,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {3872#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3868#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:10,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {3876#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3872#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:10,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {3880#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3876#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:03:10,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {3884#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3880#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:03:10,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {3888#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3884#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:10,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {3771#true} ~z~0 := ~y~0; {3888#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:03:10,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {3771#true} assume !(~x~0 % 4294967296 > 0); {3771#true} is VALID [2022-04-08 10:03:10,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {3771#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3771#true} is VALID [2022-04-08 10:03:10,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {3771#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3771#true} is VALID [2022-04-08 10:03:10,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {3771#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3771#true} is VALID [2022-04-08 10:03:10,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {3771#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3771#true} is VALID [2022-04-08 10:03:10,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {3771#true} call #t~ret11 := main(); {3771#true} is VALID [2022-04-08 10:03:10,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3771#true} {3771#true} #61#return; {3771#true} is VALID [2022-04-08 10:03:10,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {3771#true} assume true; {3771#true} is VALID [2022-04-08 10:03:10,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {3771#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3771#true} is VALID [2022-04-08 10:03:10,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {3771#true} call ULTIMATE.init(); {3771#true} is VALID [2022-04-08 10:03:10,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:03:10,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73680645] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:10,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:10,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 19 [2022-04-08 10:03:10,460 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:10,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [202343662] [2022-04-08 10:03:10,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [202343662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:10,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:10,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:03:10,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387157116] [2022-04-08 10:03:10,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:10,461 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 10:03:10,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:10,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:10,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:10,478 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:03:10,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:10,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:03:10,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:03:10,479 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:10,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:10,932 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-08 10:03:10,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:03:10,933 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 10:03:10,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-08 10:03:10,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-08 10:03:10,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2022-04-08 10:03:10,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:10,972 INFO L225 Difference]: With dead ends: 55 [2022-04-08 10:03:10,972 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 10:03:10,972 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:03:10,973 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:10,973 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 46 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:10,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 10:03:11,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2022-04-08 10:03:11,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:11,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 41 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:11,047 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 41 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:11,047 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 41 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:11,048 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-08 10:03:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-08 10:03:11,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:11,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:11,049 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-08 10:03:11,049 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-08 10:03:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:11,050 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-08 10:03:11,050 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-08 10:03:11,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:11,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:11,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:11,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-04-08 10:03:11,052 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2022-04-08 10:03:11,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:11,052 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-04-08 10:03:11,052 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:11,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 50 transitions. [2022-04-08 10:03:11,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-08 10:03:11,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:03:11,123 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:11,123 INFO L499 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:11,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:11,334 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,SelfDestructingSolverStorable13 [2022-04-08 10:03:11,334 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:11,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:11,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1194618802, now seen corresponding path program 19 times [2022-04-08 10:03:11,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:11,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [681811569] [2022-04-08 10:03:11,338 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:11,338 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:11,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1194618802, now seen corresponding path program 20 times [2022-04-08 10:03:11,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:11,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422009472] [2022-04-08 10:03:11,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:11,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:11,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:11,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {4235#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4222#true} is VALID [2022-04-08 10:03:11,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {4222#true} assume true; {4222#true} is VALID [2022-04-08 10:03:11,478 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4222#true} {4222#true} #61#return; {4222#true} is VALID [2022-04-08 10:03:11,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {4222#true} call ULTIMATE.init(); {4235#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:11,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {4235#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4222#true} is VALID [2022-04-08 10:03:11,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {4222#true} assume true; {4222#true} is VALID [2022-04-08 10:03:11,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4222#true} {4222#true} #61#return; {4222#true} is VALID [2022-04-08 10:03:11,479 INFO L272 TraceCheckUtils]: 4: Hoare triple {4222#true} call #t~ret11 := main(); {4222#true} is VALID [2022-04-08 10:03:11,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {4222#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4227#(= main_~y~0 0)} is VALID [2022-04-08 10:03:11,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {4227#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:11,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {4228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:11,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {4229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:11,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {4230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:11,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {4231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:11,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {4232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {4232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:11,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {4232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {4233#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:11,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {4233#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4234#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:11,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {4234#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {4223#false} is VALID [2022-04-08 10:03:11,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {4223#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4223#false} is VALID [2022-04-08 10:03:11,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {4223#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4223#false} is VALID [2022-04-08 10:03:11,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {4223#false} assume !(~y~0 % 4294967296 > 0); {4223#false} is VALID [2022-04-08 10:03:11,486 INFO L272 TraceCheckUtils]: 18: Hoare triple {4223#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4223#false} is VALID [2022-04-08 10:03:11,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {4223#false} ~cond := #in~cond; {4223#false} is VALID [2022-04-08 10:03:11,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {4223#false} assume 0 == ~cond; {4223#false} is VALID [2022-04-08 10:03:11,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {4223#false} assume !false; {4223#false} is VALID [2022-04-08 10:03:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:11,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:11,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422009472] [2022-04-08 10:03:11,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422009472] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:11,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844719186] [2022-04-08 10:03:11,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:11,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:11,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:11,492 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-08 10:03:11,493 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-08 10:03:11,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:11,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:11,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 10:03:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:11,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:11,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {4222#true} call ULTIMATE.init(); {4222#true} is VALID [2022-04-08 10:03:11,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {4222#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4222#true} is VALID [2022-04-08 10:03:11,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {4222#true} assume true; {4222#true} is VALID [2022-04-08 10:03:11,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4222#true} {4222#true} #61#return; {4222#true} is VALID [2022-04-08 10:03:11,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {4222#true} call #t~ret11 := main(); {4222#true} is VALID [2022-04-08 10:03:11,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {4222#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4227#(= main_~y~0 0)} is VALID [2022-04-08 10:03:11,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {4227#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:11,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {4228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:11,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {4229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:11,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {4230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:11,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {4231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:11,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {4232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {4232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:11,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {4232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {4233#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:11,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {4233#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4278#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:11,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {4278#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {4223#false} is VALID [2022-04-08 10:03:11,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {4223#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4223#false} is VALID [2022-04-08 10:03:11,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {4223#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4223#false} is VALID [2022-04-08 10:03:11,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {4223#false} assume !(~y~0 % 4294967296 > 0); {4223#false} is VALID [2022-04-08 10:03:11,766 INFO L272 TraceCheckUtils]: 18: Hoare triple {4223#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4223#false} is VALID [2022-04-08 10:03:11,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {4223#false} ~cond := #in~cond; {4223#false} is VALID [2022-04-08 10:03:11,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {4223#false} assume 0 == ~cond; {4223#false} is VALID [2022-04-08 10:03:11,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {4223#false} assume !false; {4223#false} is VALID [2022-04-08 10:03:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:11,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:11,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {4223#false} assume !false; {4223#false} is VALID [2022-04-08 10:03:11,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {4223#false} assume 0 == ~cond; {4223#false} is VALID [2022-04-08 10:03:11,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {4223#false} ~cond := #in~cond; {4223#false} is VALID [2022-04-08 10:03:11,951 INFO L272 TraceCheckUtils]: 18: Hoare triple {4223#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4223#false} is VALID [2022-04-08 10:03:11,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {4223#false} assume !(~y~0 % 4294967296 > 0); {4223#false} is VALID [2022-04-08 10:03:11,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {4223#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4223#false} is VALID [2022-04-08 10:03:11,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {4223#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4223#false} is VALID [2022-04-08 10:03:11,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {4324#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4223#false} is VALID [2022-04-08 10:03:11,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {4328#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4324#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:11,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {4332#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {4328#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:11,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {4332#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4332#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:11,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {4339#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4332#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:11,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {4343#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4339#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:11,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {4347#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4343#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:11,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {4351#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4347#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:11,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {4355#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4351#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:11,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {4222#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4355#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:11,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {4222#true} call #t~ret11 := main(); {4222#true} is VALID [2022-04-08 10:03:11,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4222#true} {4222#true} #61#return; {4222#true} is VALID [2022-04-08 10:03:11,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {4222#true} assume true; {4222#true} is VALID [2022-04-08 10:03:11,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {4222#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4222#true} is VALID [2022-04-08 10:03:11,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {4222#true} call ULTIMATE.init(); {4222#true} is VALID [2022-04-08 10:03:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:11,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844719186] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:11,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:11,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-08 10:03:11,960 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:11,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [681811569] [2022-04-08 10:03:11,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [681811569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:11,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:11,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:03:11,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397804312] [2022-04-08 10:03:11,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:11,961 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 10:03:11,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:11,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:11,981 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-08 10:03:11,981 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:03:11,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:11,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:03:11,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:03:11,982 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:12,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:12,660 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-04-08 10:03:12,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:03:12,661 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 10:03:12,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:12,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2022-04-08 10:03:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:12,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2022-04-08 10:03:12,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 57 transitions. [2022-04-08 10:03:12,728 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-08 10:03:12,730 INFO L225 Difference]: With dead ends: 65 [2022-04-08 10:03:12,730 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 10:03:12,732 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2022-04-08 10:03:12,732 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:12,733 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 59 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:03:12,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 10:03:12,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2022-04-08 10:03:12,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:12,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:12,825 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:12,825 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:12,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:12,826 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2022-04-08 10:03:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-04-08 10:03:12,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:12,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:12,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-08 10:03:12,827 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-08 10:03:12,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:12,828 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2022-04-08 10:03:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-04-08 10:03:12,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:12,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:12,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:12,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:12,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2022-04-08 10:03:12,830 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 22 [2022-04-08 10:03:12,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:12,830 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2022-04-08 10:03:12,830 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:12,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 58 transitions. [2022-04-08 10:03:12,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:12,920 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-08 10:03:12,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:03:12,921 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:12,921 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:12,946 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-08 10:03:13,121 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,SelfDestructingSolverStorable14 [2022-04-08 10:03:13,122 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:13,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:13,122 INFO L85 PathProgramCache]: Analyzing trace with hash 142103551, now seen corresponding path program 21 times [2022-04-08 10:03:13,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:13,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1899257037] [2022-04-08 10:03:13,125 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:13,126 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:13,126 INFO L85 PathProgramCache]: Analyzing trace with hash 142103551, now seen corresponding path program 22 times [2022-04-08 10:03:13,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:13,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545168986] [2022-04-08 10:03:13,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:13,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:13,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:13,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {4743#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4732#true} is VALID [2022-04-08 10:03:13,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {4732#true} assume true; {4732#true} is VALID [2022-04-08 10:03:13,273 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4732#true} {4732#true} #61#return; {4732#true} is VALID [2022-04-08 10:03:13,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {4732#true} call ULTIMATE.init(); {4743#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:13,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {4743#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4732#true} is VALID [2022-04-08 10:03:13,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {4732#true} assume true; {4732#true} is VALID [2022-04-08 10:03:13,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4732#true} {4732#true} #61#return; {4732#true} is VALID [2022-04-08 10:03:13,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {4732#true} call #t~ret11 := main(); {4732#true} is VALID [2022-04-08 10:03:13,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {4732#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4732#true} is VALID [2022-04-08 10:03:13,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {4732#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4732#true} is VALID [2022-04-08 10:03:13,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {4732#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4732#true} is VALID [2022-04-08 10:03:13,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {4732#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4732#true} is VALID [2022-04-08 10:03:13,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {4732#true} assume !(~x~0 % 4294967296 > 0); {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:13,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:13,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:13,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {4738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:13,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {4739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:13,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:13,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:13,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {4739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:13,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {4738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:13,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:13,282 INFO L272 TraceCheckUtils]: 19: Hoare triple {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4741#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:03:13,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {4741#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4742#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:03:13,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {4742#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4733#false} is VALID [2022-04-08 10:03:13,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {4733#false} assume !false; {4733#false} is VALID [2022-04-08 10:03:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:03:13,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:13,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545168986] [2022-04-08 10:03:13,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545168986] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:13,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281936897] [2022-04-08 10:03:13,284 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:13,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:13,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:13,288 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-08 10:03:13,315 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-08 10:03:13,334 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:13,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:13,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 10:03:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:13,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:13,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {4732#true} call ULTIMATE.init(); {4732#true} is VALID [2022-04-08 10:03:13,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {4732#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4732#true} is VALID [2022-04-08 10:03:13,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {4732#true} assume true; {4732#true} is VALID [2022-04-08 10:03:13,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4732#true} {4732#true} #61#return; {4732#true} is VALID [2022-04-08 10:03:13,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {4732#true} call #t~ret11 := main(); {4732#true} is VALID [2022-04-08 10:03:13,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {4732#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4732#true} is VALID [2022-04-08 10:03:13,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {4732#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4732#true} is VALID [2022-04-08 10:03:13,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {4732#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4732#true} is VALID [2022-04-08 10:03:13,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {4732#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4732#true} is VALID [2022-04-08 10:03:13,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {4732#true} assume !(~x~0 % 4294967296 > 0); {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:13,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:13,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:13,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {4738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:13,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {4739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:13,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:13,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:13,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {4739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:13,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {4738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:13,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:13,573 INFO L272 TraceCheckUtils]: 19: Hoare triple {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4804#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:03:13,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {4804#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4808#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:03:13,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {4808#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4733#false} is VALID [2022-04-08 10:03:13,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {4733#false} assume !false; {4733#false} is VALID [2022-04-08 10:03:13,574 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:03:13,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:13,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {4733#false} assume !false; {4733#false} is VALID [2022-04-08 10:03:13,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {4808#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4733#false} is VALID [2022-04-08 10:03:13,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {4804#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4808#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:03:13,844 INFO L272 TraceCheckUtils]: 19: Hoare triple {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4804#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:03:13,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:13,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {4738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:13,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {4739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:13,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:13,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:13,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {4739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:13,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {4738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:13,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:13,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:13,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {4732#true} assume !(~x~0 % 4294967296 > 0); {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:13,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {4732#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4732#true} is VALID [2022-04-08 10:03:13,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {4732#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4732#true} is VALID [2022-04-08 10:03:13,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {4732#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4732#true} is VALID [2022-04-08 10:03:13,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {4732#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4732#true} is VALID [2022-04-08 10:03:13,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {4732#true} call #t~ret11 := main(); {4732#true} is VALID [2022-04-08 10:03:13,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4732#true} {4732#true} #61#return; {4732#true} is VALID [2022-04-08 10:03:13,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {4732#true} assume true; {4732#true} is VALID [2022-04-08 10:03:13,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {4732#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4732#true} is VALID [2022-04-08 10:03:13,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {4732#true} call ULTIMATE.init(); {4732#true} is VALID [2022-04-08 10:03:13,859 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:03:13,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281936897] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:13,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:13,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2022-04-08 10:03:13,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:13,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1899257037] [2022-04-08 10:03:13,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1899257037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:13,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:13,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:03:13,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525061971] [2022-04-08 10:03:13,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:13,860 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) 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 23 [2022-04-08 10:03:13,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:13,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) 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-08 10:03:13,882 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-08 10:03:13,883 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:03:13,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:13,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:03:13,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-08 10:03:13,883 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) 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-08 10:03:14,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:14,379 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2022-04-08 10:03:14,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:03:14,379 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) 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 23 [2022-04-08 10:03:14,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:14,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) 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-08 10:03:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-08 10:03:14,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) 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-08 10:03:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-08 10:03:14,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 37 transitions. [2022-04-08 10:03:14,413 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-08 10:03:14,415 INFO L225 Difference]: With dead ends: 80 [2022-04-08 10:03:14,415 INFO L226 Difference]: Without dead ends: 71 [2022-04-08 10:03:14,415 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-04-08 10:03:14,416 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 20 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:14,416 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 52 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:14,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-08 10:03:14,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2022-04-08 10:03:14,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:14,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:14,532 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:14,532 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:14,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:14,534 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2022-04-08 10:03:14,534 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2022-04-08 10:03:14,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:14,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:14,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 3 states 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-08 10:03:14,535 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 3 states 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-08 10:03:14,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:14,536 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2022-04-08 10:03:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2022-04-08 10:03:14,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:14,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:14,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:14,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:14,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2022-04-08 10:03:14,538 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 23 [2022-04-08 10:03:14,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:14,538 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2022-04-08 10:03:14,538 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) 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-08 10:03:14,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 64 transitions. [2022-04-08 10:03:14,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-08 10:03:14,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:03:14,626 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:14,626 INFO L499 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:14,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-08 10:03:14,826 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,SelfDestructingSolverStorable15 [2022-04-08 10:03:14,827 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:14,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:14,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1077971631, now seen corresponding path program 23 times [2022-04-08 10:03:14,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:14,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1867650465] [2022-04-08 10:03:14,829 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:14,830 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:14,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1077971631, now seen corresponding path program 24 times [2022-04-08 10:03:14,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:14,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032294688] [2022-04-08 10:03:14,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:14,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:14,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:14,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {5313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5299#true} is VALID [2022-04-08 10:03:14,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {5299#true} assume true; {5299#true} is VALID [2022-04-08 10:03:14,970 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5299#true} {5299#true} #61#return; {5299#true} is VALID [2022-04-08 10:03:14,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {5299#true} call ULTIMATE.init(); {5313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:14,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {5313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5299#true} is VALID [2022-04-08 10:03:14,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {5299#true} assume true; {5299#true} is VALID [2022-04-08 10:03:14,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5299#true} {5299#true} #61#return; {5299#true} is VALID [2022-04-08 10:03:14,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {5299#true} call #t~ret11 := main(); {5299#true} is VALID [2022-04-08 10:03:14,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {5299#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5304#(= main_~y~0 0)} is VALID [2022-04-08 10:03:14,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {5304#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5305#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:14,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {5305#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5306#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:14,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {5306#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5307#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:14,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {5307#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5308#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:14,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {5308#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5309#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:14,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {5309#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5310#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:14,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {5310#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5310#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:14,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {5310#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {5311#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:14,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {5311#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5312#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:14,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {5312#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {5300#false} is VALID [2022-04-08 10:03:14,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {5300#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5300#false} is VALID [2022-04-08 10:03:14,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {5300#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5300#false} is VALID [2022-04-08 10:03:14,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {5300#false} assume !(~y~0 % 4294967296 > 0); {5300#false} is VALID [2022-04-08 10:03:14,976 INFO L272 TraceCheckUtils]: 19: Hoare triple {5300#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5300#false} is VALID [2022-04-08 10:03:14,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {5300#false} ~cond := #in~cond; {5300#false} is VALID [2022-04-08 10:03:14,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {5300#false} assume 0 == ~cond; {5300#false} is VALID [2022-04-08 10:03:14,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {5300#false} assume !false; {5300#false} is VALID [2022-04-08 10:03:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:14,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:14,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032294688] [2022-04-08 10:03:14,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032294688] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:14,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270839146] [2022-04-08 10:03:14,977 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:14,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:14,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:14,978 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-08 10:03:14,979 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-08 10:03:15,010 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:03:15,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:15,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 10:03:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:15,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:15,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {5299#true} call ULTIMATE.init(); {5299#true} is VALID [2022-04-08 10:03:15,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {5299#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5299#true} is VALID [2022-04-08 10:03:15,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {5299#true} assume true; {5299#true} is VALID [2022-04-08 10:03:15,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5299#true} {5299#true} #61#return; {5299#true} is VALID [2022-04-08 10:03:15,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {5299#true} call #t~ret11 := main(); {5299#true} is VALID [2022-04-08 10:03:15,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {5299#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5299#true} is VALID [2022-04-08 10:03:15,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {5299#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5299#true} is VALID [2022-04-08 10:03:15,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {5299#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5299#true} is VALID [2022-04-08 10:03:15,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {5299#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5299#true} is VALID [2022-04-08 10:03:15,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {5299#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5299#true} is VALID [2022-04-08 10:03:15,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {5299#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5299#true} is VALID [2022-04-08 10:03:15,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {5299#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5299#true} is VALID [2022-04-08 10:03:15,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {5299#true} assume !(~x~0 % 4294967296 > 0); {5299#true} is VALID [2022-04-08 10:03:15,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {5299#true} ~z~0 := ~y~0; {5356#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:03:15,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {5356#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5360#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:03:15,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {5360#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {5364#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:15,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {5364#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5368#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:15,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {5368#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5300#false} is VALID [2022-04-08 10:03:15,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {5300#false} assume !(~y~0 % 4294967296 > 0); {5300#false} is VALID [2022-04-08 10:03:15,131 INFO L272 TraceCheckUtils]: 19: Hoare triple {5300#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5300#false} is VALID [2022-04-08 10:03:15,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {5300#false} ~cond := #in~cond; {5300#false} is VALID [2022-04-08 10:03:15,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {5300#false} assume 0 == ~cond; {5300#false} is VALID [2022-04-08 10:03:15,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {5300#false} assume !false; {5300#false} is VALID [2022-04-08 10:03:15,131 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:03:15,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:15,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {5300#false} assume !false; {5300#false} is VALID [2022-04-08 10:03:15,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {5300#false} assume 0 == ~cond; {5300#false} is VALID [2022-04-08 10:03:15,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {5300#false} ~cond := #in~cond; {5300#false} is VALID [2022-04-08 10:03:15,240 INFO L272 TraceCheckUtils]: 19: Hoare triple {5300#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5300#false} is VALID [2022-04-08 10:03:15,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {5300#false} assume !(~y~0 % 4294967296 > 0); {5300#false} is VALID [2022-04-08 10:03:15,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {5368#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5300#false} is VALID [2022-04-08 10:03:15,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {5364#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5368#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:15,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {5408#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5364#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:15,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {5412#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5408#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:03:15,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {5299#true} ~z~0 := ~y~0; {5412#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:03:15,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {5299#true} assume !(~x~0 % 4294967296 > 0); {5299#true} is VALID [2022-04-08 10:03:15,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {5299#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5299#true} is VALID [2022-04-08 10:03:15,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {5299#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5299#true} is VALID [2022-04-08 10:03:15,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {5299#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5299#true} is VALID [2022-04-08 10:03:15,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {5299#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5299#true} is VALID [2022-04-08 10:03:15,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {5299#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5299#true} is VALID [2022-04-08 10:03:15,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {5299#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5299#true} is VALID [2022-04-08 10:03:15,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {5299#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5299#true} is VALID [2022-04-08 10:03:15,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {5299#true} call #t~ret11 := main(); {5299#true} is VALID [2022-04-08 10:03:15,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5299#true} {5299#true} #61#return; {5299#true} is VALID [2022-04-08 10:03:15,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {5299#true} assume true; {5299#true} is VALID [2022-04-08 10:03:15,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {5299#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5299#true} is VALID [2022-04-08 10:03:15,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {5299#true} call ULTIMATE.init(); {5299#true} is VALID [2022-04-08 10:03:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:03:15,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270839146] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:15,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:15,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 18 [2022-04-08 10:03:15,246 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:15,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1867650465] [2022-04-08 10:03:15,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1867650465] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:15,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:15,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:03:15,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636408081] [2022-04-08 10:03:15,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:15,247 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 10:03:15,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:15,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:15,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:15,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:03:15,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:15,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:03:15,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:03:15,269 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:16,015 INFO L93 Difference]: Finished difference Result 81 states and 108 transitions. [2022-04-08 10:03:16,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:03:16,015 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 10:03:16,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:16,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-08 10:03:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:16,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-08 10:03:16,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2022-04-08 10:03:16,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:16,069 INFO L225 Difference]: With dead ends: 81 [2022-04-08 10:03:16,069 INFO L226 Difference]: Without dead ends: 73 [2022-04-08 10:03:16,070 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:03:16,070 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:16,070 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 62 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:03:16,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-08 10:03:16,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2022-04-08 10:03:16,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:16,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 57 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:16,178 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 57 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:16,178 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 57 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:16,179 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2022-04-08 10:03:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2022-04-08 10:03:16,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:16,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:16,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 3 states have call successors, (3), 3 states 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-08 10:03:16,180 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 3 states have call successors, (3), 3 states 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-08 10:03:16,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:16,181 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2022-04-08 10:03:16,181 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2022-04-08 10:03:16,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:16,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:16,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:16,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2022-04-08 10:03:16,183 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 23 [2022-04-08 10:03:16,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:16,183 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2022-04-08 10:03:16,183 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:16,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 72 transitions. [2022-04-08 10:03:16,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:16,284 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2022-04-08 10:03:16,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:03:16,284 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:16,284 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:16,301 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-08 10:03:16,484 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:16,494 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:16,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:16,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1773782399, now seen corresponding path program 25 times [2022-04-08 10:03:16,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:16,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [621578293] [2022-04-08 10:03:16,499 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:16,499 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:16,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1773782399, now seen corresponding path program 26 times [2022-04-08 10:03:16,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:16,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281290741] [2022-04-08 10:03:16,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:16,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:16,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:16,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {5912#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5899#true} is VALID [2022-04-08 10:03:16,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {5899#true} assume true; {5899#true} is VALID [2022-04-08 10:03:16,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5899#true} {5899#true} #61#return; {5899#true} is VALID [2022-04-08 10:03:16,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {5899#true} call ULTIMATE.init(); {5912#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:16,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {5912#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5899#true} is VALID [2022-04-08 10:03:16,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {5899#true} assume true; {5899#true} is VALID [2022-04-08 10:03:16,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5899#true} {5899#true} #61#return; {5899#true} is VALID [2022-04-08 10:03:16,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {5899#true} call #t~ret11 := main(); {5899#true} is VALID [2022-04-08 10:03:16,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {5899#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5904#(= main_~y~0 0)} is VALID [2022-04-08 10:03:16,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {5904#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5905#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:16,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {5905#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5906#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:16,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {5906#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:16,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {5907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:16,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {5907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {5908#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:16,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {5908#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5909#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:16,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {5909#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5910#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:16,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {5910#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5911#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:03:16,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {5911#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5900#false} is VALID [2022-04-08 10:03:16,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {5900#false} assume !(~z~0 % 4294967296 > 0); {5900#false} is VALID [2022-04-08 10:03:16,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {5900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5900#false} is VALID [2022-04-08 10:03:16,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {5900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5900#false} is VALID [2022-04-08 10:03:16,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {5900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5900#false} is VALID [2022-04-08 10:03:16,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {5900#false} assume !(~y~0 % 4294967296 > 0); {5900#false} is VALID [2022-04-08 10:03:16,644 INFO L272 TraceCheckUtils]: 20: Hoare triple {5900#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5900#false} is VALID [2022-04-08 10:03:16,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {5900#false} ~cond := #in~cond; {5900#false} is VALID [2022-04-08 10:03:16,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {5900#false} assume 0 == ~cond; {5900#false} is VALID [2022-04-08 10:03:16,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {5900#false} assume !false; {5900#false} is VALID [2022-04-08 10:03:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:03:16,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:16,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281290741] [2022-04-08 10:03:16,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281290741] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:16,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972852853] [2022-04-08 10:03:16,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:16,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:16,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:16,647 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-08 10:03:16,673 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-08 10:03:16,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:16,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:16,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 10:03:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:16,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:16,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {5899#true} call ULTIMATE.init(); {5899#true} is VALID [2022-04-08 10:03:16,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {5899#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5899#true} is VALID [2022-04-08 10:03:16,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {5899#true} assume true; {5899#true} is VALID [2022-04-08 10:03:16,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5899#true} {5899#true} #61#return; {5899#true} is VALID [2022-04-08 10:03:16,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {5899#true} call #t~ret11 := main(); {5899#true} is VALID [2022-04-08 10:03:16,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {5899#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5904#(= main_~y~0 0)} is VALID [2022-04-08 10:03:16,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {5904#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5905#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:16,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {5905#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5906#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:16,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {5906#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:16,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {5907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:16,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {5907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {5946#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:16,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {5946#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5950#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:16,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {5950#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5954#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:16,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {5954#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5958#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-08 10:03:16,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {5958#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5900#false} is VALID [2022-04-08 10:03:16,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {5900#false} assume !(~z~0 % 4294967296 > 0); {5900#false} is VALID [2022-04-08 10:03:16,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {5900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5900#false} is VALID [2022-04-08 10:03:16,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {5900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5900#false} is VALID [2022-04-08 10:03:16,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {5900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5900#false} is VALID [2022-04-08 10:03:16,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {5900#false} assume !(~y~0 % 4294967296 > 0); {5900#false} is VALID [2022-04-08 10:03:16,866 INFO L272 TraceCheckUtils]: 20: Hoare triple {5900#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5900#false} is VALID [2022-04-08 10:03:16,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {5900#false} ~cond := #in~cond; {5900#false} is VALID [2022-04-08 10:03:16,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {5900#false} assume 0 == ~cond; {5900#false} is VALID [2022-04-08 10:03:16,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {5900#false} assume !false; {5900#false} is VALID [2022-04-08 10:03:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:03:16,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:17,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {5900#false} assume !false; {5900#false} is VALID [2022-04-08 10:03:17,111 INFO L290 TraceCheckUtils]: 22: Hoare triple {5900#false} assume 0 == ~cond; {5900#false} is VALID [2022-04-08 10:03:17,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {5900#false} ~cond := #in~cond; {5900#false} is VALID [2022-04-08 10:03:17,111 INFO L272 TraceCheckUtils]: 20: Hoare triple {5900#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5900#false} is VALID [2022-04-08 10:03:17,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {6001#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5900#false} is VALID [2022-04-08 10:03:17,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {6005#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6001#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:17,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {6009#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6005#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:17,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {6013#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6009#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:17,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {6013#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {6013#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:17,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {6020#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6013#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:17,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {6024#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6020#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:03:17,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {6028#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6024#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:03:17,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {6032#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6028#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:03:17,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {5899#true} ~z~0 := ~y~0; {6032#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:03:17,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {5899#true} assume !(~x~0 % 4294967296 > 0); {5899#true} is VALID [2022-04-08 10:03:17,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {5899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5899#true} is VALID [2022-04-08 10:03:17,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {5899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5899#true} is VALID [2022-04-08 10:03:17,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {5899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5899#true} is VALID [2022-04-08 10:03:17,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {5899#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5899#true} is VALID [2022-04-08 10:03:17,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {5899#true} call #t~ret11 := main(); {5899#true} is VALID [2022-04-08 10:03:17,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5899#true} {5899#true} #61#return; {5899#true} is VALID [2022-04-08 10:03:17,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {5899#true} assume true; {5899#true} is VALID [2022-04-08 10:03:17,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {5899#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5899#true} is VALID [2022-04-08 10:03:17,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {5899#true} call ULTIMATE.init(); {5899#true} is VALID [2022-04-08 10:03:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:03:17,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972852853] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:17,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:17,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2022-04-08 10:03:17,120 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:17,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [621578293] [2022-04-08 10:03:17,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [621578293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:17,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:17,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:03:17,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645407374] [2022-04-08 10:03:17,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:17,121 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 10:03:17,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:17,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:17,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:17,135 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:03:17,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:17,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:03:17,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:03:17,136 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:17,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:17,563 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-04-08 10:03:17,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:03:17,563 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 10:03:17,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 35 transitions. [2022-04-08 10:03:17,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:17,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 35 transitions. [2022-04-08 10:03:17,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 35 transitions. [2022-04-08 10:03:17,602 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-08 10:03:17,603 INFO L225 Difference]: With dead ends: 66 [2022-04-08 10:03:17,603 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 10:03:17,604 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2022-04-08 10:03:17,605 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:17,605 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 56 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:17,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 10:03:17,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-08 10:03:17,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:17,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:17,689 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:17,689 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:17,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:17,690 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-04-08 10:03:17,690 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-08 10:03:17,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:17,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:17,691 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 3 states 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-08 10:03:17,691 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 3 states 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-08 10:03:17,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:17,692 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-04-08 10:03:17,692 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-08 10:03:17,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:17,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:17,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:17,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:17,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:17,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2022-04-08 10:03:17,693 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 24 [2022-04-08 10:03:17,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:17,693 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2022-04-08 10:03:17,693 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:17,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 64 transitions. [2022-04-08 10:03:17,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-08 10:03:17,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:03:17,773 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:17,773 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:17,789 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-08 10:03:17,973 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 10:03:17,974 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:17,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:17,974 INFO L85 PathProgramCache]: Analyzing trace with hash 243885709, now seen corresponding path program 27 times [2022-04-08 10:03:17,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:17,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1017799206] [2022-04-08 10:03:17,977 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:17,977 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:17,977 INFO L85 PathProgramCache]: Analyzing trace with hash 243885709, now seen corresponding path program 28 times [2022-04-08 10:03:17,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:17,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175283807] [2022-04-08 10:03:17,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:17,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:18,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:18,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {6433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6420#true} is VALID [2022-04-08 10:03:18,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {6420#true} assume true; {6420#true} is VALID [2022-04-08 10:03:18,109 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6420#true} {6420#true} #61#return; {6420#true} is VALID [2022-04-08 10:03:18,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {6420#true} call ULTIMATE.init(); {6433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:18,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {6433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6420#true} is VALID [2022-04-08 10:03:18,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {6420#true} assume true; {6420#true} is VALID [2022-04-08 10:03:18,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6420#true} {6420#true} #61#return; {6420#true} is VALID [2022-04-08 10:03:18,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {6420#true} call #t~ret11 := main(); {6420#true} is VALID [2022-04-08 10:03:18,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {6420#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6425#(= main_~y~0 0)} is VALID [2022-04-08 10:03:18,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {6425#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6426#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:18,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {6426#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6427#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:18,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {6427#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6428#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:18,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {6428#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:18,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {6429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:18,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {6429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {6430#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:18,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {6430#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6431#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:18,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {6431#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6432#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:18,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {6432#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6421#false} is VALID [2022-04-08 10:03:18,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {6421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6421#false} is VALID [2022-04-08 10:03:18,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {6421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6421#false} is VALID [2022-04-08 10:03:18,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {6421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6421#false} is VALID [2022-04-08 10:03:18,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {6421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6421#false} is VALID [2022-04-08 10:03:18,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {6421#false} assume !(~y~0 % 4294967296 > 0); {6421#false} is VALID [2022-04-08 10:03:18,116 INFO L272 TraceCheckUtils]: 20: Hoare triple {6421#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6421#false} is VALID [2022-04-08 10:03:18,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {6421#false} ~cond := #in~cond; {6421#false} is VALID [2022-04-08 10:03:18,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {6421#false} assume 0 == ~cond; {6421#false} is VALID [2022-04-08 10:03:18,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {6421#false} assume !false; {6421#false} is VALID [2022-04-08 10:03:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:03:18,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:18,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175283807] [2022-04-08 10:03:18,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175283807] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:18,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339638779] [2022-04-08 10:03:18,117 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:18,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:18,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:18,118 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-08 10:03:18,143 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-08 10:03:18,168 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:18,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:18,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 10:03:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:18,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:18,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {6420#true} call ULTIMATE.init(); {6420#true} is VALID [2022-04-08 10:03:18,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {6420#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6420#true} is VALID [2022-04-08 10:03:18,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {6420#true} assume true; {6420#true} is VALID [2022-04-08 10:03:18,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6420#true} {6420#true} #61#return; {6420#true} is VALID [2022-04-08 10:03:18,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {6420#true} call #t~ret11 := main(); {6420#true} is VALID [2022-04-08 10:03:18,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {6420#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6425#(= main_~y~0 0)} is VALID [2022-04-08 10:03:18,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {6425#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6426#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:18,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {6426#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6427#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:18,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {6427#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6428#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:18,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {6428#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:18,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {6429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:18,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {6429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {6470#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:18,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {6470#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6474#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:18,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {6474#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6478#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:18,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {6478#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {6421#false} is VALID [2022-04-08 10:03:18,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {6421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6421#false} is VALID [2022-04-08 10:03:18,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {6421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6421#false} is VALID [2022-04-08 10:03:18,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {6421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6421#false} is VALID [2022-04-08 10:03:18,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {6421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6421#false} is VALID [2022-04-08 10:03:18,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {6421#false} assume !(~y~0 % 4294967296 > 0); {6421#false} is VALID [2022-04-08 10:03:18,345 INFO L272 TraceCheckUtils]: 20: Hoare triple {6421#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6421#false} is VALID [2022-04-08 10:03:18,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {6421#false} ~cond := #in~cond; {6421#false} is VALID [2022-04-08 10:03:18,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {6421#false} assume 0 == ~cond; {6421#false} is VALID [2022-04-08 10:03:18,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {6421#false} assume !false; {6421#false} is VALID [2022-04-08 10:03:18,345 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:03:18,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:18,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {6421#false} assume !false; {6421#false} is VALID [2022-04-08 10:03:18,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {6421#false} assume 0 == ~cond; {6421#false} is VALID [2022-04-08 10:03:18,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {6421#false} ~cond := #in~cond; {6421#false} is VALID [2022-04-08 10:03:18,506 INFO L272 TraceCheckUtils]: 20: Hoare triple {6421#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6421#false} is VALID [2022-04-08 10:03:18,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {6421#false} assume !(~y~0 % 4294967296 > 0); {6421#false} is VALID [2022-04-08 10:03:18,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {6421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6421#false} is VALID [2022-04-08 10:03:18,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {6527#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6421#false} is VALID [2022-04-08 10:03:18,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {6531#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6527#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:18,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {6535#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6531#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:18,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {6539#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {6535#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:03:18,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {6543#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6539#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:03:18,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {6547#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6543#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:18,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {6420#true} ~z~0 := ~y~0; {6547#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:03:18,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {6420#true} assume !(~x~0 % 4294967296 > 0); {6420#true} is VALID [2022-04-08 10:03:18,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {6420#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6420#true} is VALID [2022-04-08 10:03:18,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {6420#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6420#true} is VALID [2022-04-08 10:03:18,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {6420#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6420#true} is VALID [2022-04-08 10:03:18,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {6420#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6420#true} is VALID [2022-04-08 10:03:18,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {6420#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6420#true} is VALID [2022-04-08 10:03:18,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {6420#true} call #t~ret11 := main(); {6420#true} is VALID [2022-04-08 10:03:18,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6420#true} {6420#true} #61#return; {6420#true} is VALID [2022-04-08 10:03:18,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {6420#true} assume true; {6420#true} is VALID [2022-04-08 10:03:18,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {6420#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6420#true} is VALID [2022-04-08 10:03:18,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {6420#true} call ULTIMATE.init(); {6420#true} is VALID [2022-04-08 10:03:18,511 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 10:03:18,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339638779] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:18,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:18,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 20 [2022-04-08 10:03:18,511 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:18,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1017799206] [2022-04-08 10:03:18,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1017799206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:18,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:18,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:03:18,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977898783] [2022-04-08 10:03:18,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:18,512 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 10:03:18,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:18,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:18,529 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-08 10:03:18,529 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:03:18,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:18,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:03:18,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:03:18,530 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:19,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:19,002 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2022-04-08 10:03:19,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:03:19,002 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 10:03:19,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:19,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-08 10:03:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-08 10:03:19,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 42 transitions. [2022-04-08 10:03:19,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:19,050 INFO L225 Difference]: With dead ends: 68 [2022-04-08 10:03:19,051 INFO L226 Difference]: Without dead ends: 58 [2022-04-08 10:03:19,051 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:03:19,051 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:19,051 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 51 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:19,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-08 10:03:19,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2022-04-08 10:03:19,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:19,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 52 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 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-08 10:03:19,141 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 52 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 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-08 10:03:19,141 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 52 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 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-08 10:03:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:19,142 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-08 10:03:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-04-08 10:03:19,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:19,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:19,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 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 58 states. [2022-04-08 10:03:19,149 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 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 58 states. [2022-04-08 10:03:19,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:19,150 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-08 10:03:19,150 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-04-08 10:03:19,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:19,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:19,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:19,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 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-08 10:03:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2022-04-08 10:03:19,156 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 24 [2022-04-08 10:03:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:19,156 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2022-04-08 10:03:19,156 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:19,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 65 transitions. [2022-04-08 10:03:19,240 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-08 10:03:19,240 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2022-04-08 10:03:19,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:03:19,241 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:19,241 INFO L499 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:19,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-08 10:03:19,443 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:19,443 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:19,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:19,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1486168978, now seen corresponding path program 29 times [2022-04-08 10:03:19,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:19,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1318788369] [2022-04-08 10:03:19,447 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:19,447 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:19,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1486168978, now seen corresponding path program 30 times [2022-04-08 10:03:19,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:19,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797662933] [2022-04-08 10:03:19,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:19,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:19,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:19,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {6973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6958#true} is VALID [2022-04-08 10:03:19,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {6958#true} assume true; {6958#true} is VALID [2022-04-08 10:03:19,591 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6958#true} {6958#true} #61#return; {6958#true} is VALID [2022-04-08 10:03:19,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {6958#true} call ULTIMATE.init(); {6973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:19,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {6973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6958#true} is VALID [2022-04-08 10:03:19,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {6958#true} assume true; {6958#true} is VALID [2022-04-08 10:03:19,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6958#true} {6958#true} #61#return; {6958#true} is VALID [2022-04-08 10:03:19,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {6958#true} call #t~ret11 := main(); {6958#true} is VALID [2022-04-08 10:03:19,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {6958#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6963#(= main_~y~0 0)} is VALID [2022-04-08 10:03:19,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {6963#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:19,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {6964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:19,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {6965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:19,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {6966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:19,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {6967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:19,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {6968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6969#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:19,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {6969#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6970#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:19,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {6970#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {6970#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:19,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {6970#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {6971#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:03:19,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {6971#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6972#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:19,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {6972#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6959#false} is VALID [2022-04-08 10:03:19,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {6959#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6959#false} is VALID [2022-04-08 10:03:19,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {6959#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6959#false} is VALID [2022-04-08 10:03:19,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {6959#false} assume !(~y~0 % 4294967296 > 0); {6959#false} is VALID [2022-04-08 10:03:19,597 INFO L272 TraceCheckUtils]: 20: Hoare triple {6959#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6959#false} is VALID [2022-04-08 10:03:19,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {6959#false} ~cond := #in~cond; {6959#false} is VALID [2022-04-08 10:03:19,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {6959#false} assume 0 == ~cond; {6959#false} is VALID [2022-04-08 10:03:19,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {6959#false} assume !false; {6959#false} is VALID [2022-04-08 10:03:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:19,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:19,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797662933] [2022-04-08 10:03:19,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797662933] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:19,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696767071] [2022-04-08 10:03:19,598 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:19,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:19,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:19,599 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-08 10:03:19,601 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-08 10:03:19,631 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:03:19,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:19,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 10:03:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:19,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:19,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {6958#true} call ULTIMATE.init(); {6958#true} is VALID [2022-04-08 10:03:19,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {6958#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6958#true} is VALID [2022-04-08 10:03:19,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {6958#true} assume true; {6958#true} is VALID [2022-04-08 10:03:19,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6958#true} {6958#true} #61#return; {6958#true} is VALID [2022-04-08 10:03:19,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {6958#true} call #t~ret11 := main(); {6958#true} is VALID [2022-04-08 10:03:19,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {6958#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6958#true} is VALID [2022-04-08 10:03:19,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {6958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6958#true} is VALID [2022-04-08 10:03:19,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {6958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6958#true} is VALID [2022-04-08 10:03:19,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {6958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6958#true} is VALID [2022-04-08 10:03:19,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {6958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6958#true} is VALID [2022-04-08 10:03:19,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {6958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6958#true} is VALID [2022-04-08 10:03:19,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {6958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6958#true} is VALID [2022-04-08 10:03:19,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {6958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6958#true} is VALID [2022-04-08 10:03:19,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {6958#true} assume !(~x~0 % 4294967296 > 0); {6958#true} is VALID [2022-04-08 10:03:19,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {6958#true} ~z~0 := ~y~0; {7019#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:03:19,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {7019#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7023#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:03:19,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {7023#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {7027#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:19,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {7027#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7031#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:19,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {7031#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6959#false} is VALID [2022-04-08 10:03:19,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {6959#false} assume !(~y~0 % 4294967296 > 0); {6959#false} is VALID [2022-04-08 10:03:19,738 INFO L272 TraceCheckUtils]: 20: Hoare triple {6959#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6959#false} is VALID [2022-04-08 10:03:19,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {6959#false} ~cond := #in~cond; {6959#false} is VALID [2022-04-08 10:03:19,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {6959#false} assume 0 == ~cond; {6959#false} is VALID [2022-04-08 10:03:19,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {6959#false} assume !false; {6959#false} is VALID [2022-04-08 10:03:19,738 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:03:19,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:19,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {6959#false} assume !false; {6959#false} is VALID [2022-04-08 10:03:19,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {6959#false} assume 0 == ~cond; {6959#false} is VALID [2022-04-08 10:03:19,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {6959#false} ~cond := #in~cond; {6959#false} is VALID [2022-04-08 10:03:19,836 INFO L272 TraceCheckUtils]: 20: Hoare triple {6959#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6959#false} is VALID [2022-04-08 10:03:19,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {6959#false} assume !(~y~0 % 4294967296 > 0); {6959#false} is VALID [2022-04-08 10:03:19,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {7031#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6959#false} is VALID [2022-04-08 10:03:19,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {7027#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7031#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:19,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {7071#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {7027#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:19,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {7075#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7071#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:03:19,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {6958#true} ~z~0 := ~y~0; {7075#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:03:19,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {6958#true} assume !(~x~0 % 4294967296 > 0); {6958#true} is VALID [2022-04-08 10:03:19,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {6958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6958#true} is VALID [2022-04-08 10:03:19,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {6958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6958#true} is VALID [2022-04-08 10:03:19,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {6958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6958#true} is VALID [2022-04-08 10:03:19,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {6958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6958#true} is VALID [2022-04-08 10:03:19,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {6958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6958#true} is VALID [2022-04-08 10:03:19,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {6958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6958#true} is VALID [2022-04-08 10:03:19,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {6958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6958#true} is VALID [2022-04-08 10:03:19,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {6958#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6958#true} is VALID [2022-04-08 10:03:19,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {6958#true} call #t~ret11 := main(); {6958#true} is VALID [2022-04-08 10:03:19,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6958#true} {6958#true} #61#return; {6958#true} is VALID [2022-04-08 10:03:19,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {6958#true} assume true; {6958#true} is VALID [2022-04-08 10:03:19,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {6958#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6958#true} is VALID [2022-04-08 10:03:19,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {6958#true} call ULTIMATE.init(); {6958#true} is VALID [2022-04-08 10:03:19,840 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:03:19,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696767071] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:19,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:19,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 19 [2022-04-08 10:03:19,840 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:19,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1318788369] [2022-04-08 10:03:19,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1318788369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:19,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:19,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:03:19,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677745612] [2022-04-08 10:03:19,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:19,841 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 10:03:19,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:19,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:19,857 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-08 10:03:19,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:03:19,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:19,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:03:19,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:03:19,858 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:20,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:20,707 INFO L93 Difference]: Finished difference Result 83 states and 111 transitions. [2022-04-08 10:03:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 10:03:20,707 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 10:03:20,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:20,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:20,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 67 transitions. [2022-04-08 10:03:20,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:20,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 67 transitions. [2022-04-08 10:03:20,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 67 transitions. [2022-04-08 10:03:20,768 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-08 10:03:20,769 INFO L225 Difference]: With dead ends: 83 [2022-04-08 10:03:20,769 INFO L226 Difference]: Without dead ends: 75 [2022-04-08 10:03:20,769 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:03:20,769 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:20,770 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 67 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:03:20,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-08 10:03:20,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 58. [2022-04-08 10:03:20,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:20,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 58 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 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-08 10:03:20,899 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 58 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 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-08 10:03:20,899 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 58 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 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-08 10:03:20,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:20,900 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2022-04-08 10:03:20,900 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2022-04-08 10:03:20,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:20,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:20,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 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 75 states. [2022-04-08 10:03:20,901 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 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 75 states. [2022-04-08 10:03:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:20,902 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2022-04-08 10:03:20,902 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2022-04-08 10:03:20,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:20,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:20,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:20,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:20,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 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-08 10:03:20,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2022-04-08 10:03:20,904 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 24 [2022-04-08 10:03:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:20,904 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2022-04-08 10:03:20,904 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:20,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 73 transitions. [2022-04-08 10:03:21,016 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-08 10:03:21,017 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2022-04-08 10:03:21,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:03:21,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:21,017 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:21,038 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-08 10:03:21,218 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:21,218 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:21,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:21,219 INFO L85 PathProgramCache]: Analyzing trace with hash -2034209681, now seen corresponding path program 31 times [2022-04-08 10:03:21,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:21,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1723318663] [2022-04-08 10:03:21,221 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:21,221 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:21,221 INFO L85 PathProgramCache]: Analyzing trace with hash -2034209681, now seen corresponding path program 32 times [2022-04-08 10:03:21,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:21,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954557063] [2022-04-08 10:03:21,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:21,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:21,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:21,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {7591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7577#true} is VALID [2022-04-08 10:03:21,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {7577#true} assume true; {7577#true} is VALID [2022-04-08 10:03:21,365 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7577#true} {7577#true} #61#return; {7577#true} is VALID [2022-04-08 10:03:21,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {7577#true} call ULTIMATE.init(); {7591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:21,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {7591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7577#true} is VALID [2022-04-08 10:03:21,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {7577#true} assume true; {7577#true} is VALID [2022-04-08 10:03:21,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7577#true} {7577#true} #61#return; {7577#true} is VALID [2022-04-08 10:03:21,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {7577#true} call #t~ret11 := main(); {7577#true} is VALID [2022-04-08 10:03:21,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {7577#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7582#(= main_~y~0 0)} is VALID [2022-04-08 10:03:21,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {7582#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7583#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:21,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {7583#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7584#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:21,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {7584#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7585#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:21,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {7585#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:21,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {7586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:21,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {7586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {7587#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:21,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {7587#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7588#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:21,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {7588#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7589#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:21,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {7589#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7590#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:21,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {7590#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7578#false} is VALID [2022-04-08 10:03:21,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {7578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7578#false} is VALID [2022-04-08 10:03:21,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {7578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7578#false} is VALID [2022-04-08 10:03:21,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {7578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7578#false} is VALID [2022-04-08 10:03:21,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {7578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7578#false} is VALID [2022-04-08 10:03:21,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {7578#false} assume !(~y~0 % 4294967296 > 0); {7578#false} is VALID [2022-04-08 10:03:21,373 INFO L272 TraceCheckUtils]: 21: Hoare triple {7578#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7578#false} is VALID [2022-04-08 10:03:21,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {7578#false} ~cond := #in~cond; {7578#false} is VALID [2022-04-08 10:03:21,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {7578#false} assume 0 == ~cond; {7578#false} is VALID [2022-04-08 10:03:21,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {7578#false} assume !false; {7578#false} is VALID [2022-04-08 10:03:21,374 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:03:21,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:21,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954557063] [2022-04-08 10:03:21,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954557063] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:21,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555844927] [2022-04-08 10:03:21,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:21,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:21,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:21,376 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-08 10:03:21,389 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-08 10:03:21,417 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:21,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:21,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 10:03:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:21,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:21,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {7577#true} call ULTIMATE.init(); {7577#true} is VALID [2022-04-08 10:03:21,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {7577#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7577#true} is VALID [2022-04-08 10:03:21,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {7577#true} assume true; {7577#true} is VALID [2022-04-08 10:03:21,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7577#true} {7577#true} #61#return; {7577#true} is VALID [2022-04-08 10:03:21,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {7577#true} call #t~ret11 := main(); {7577#true} is VALID [2022-04-08 10:03:21,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {7577#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7582#(= main_~y~0 0)} is VALID [2022-04-08 10:03:21,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {7582#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7583#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:21,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {7583#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7584#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:21,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {7584#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7585#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:21,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {7585#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:21,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {7586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:21,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {7586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {7628#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:21,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {7628#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7632#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:21,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {7632#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7636#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:21,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {7636#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7640#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-08 10:03:21,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {7640#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {7578#false} is VALID [2022-04-08 10:03:21,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {7578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7578#false} is VALID [2022-04-08 10:03:21,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {7578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7578#false} is VALID [2022-04-08 10:03:21,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {7578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7578#false} is VALID [2022-04-08 10:03:21,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {7578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7578#false} is VALID [2022-04-08 10:03:21,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {7578#false} assume !(~y~0 % 4294967296 > 0); {7578#false} is VALID [2022-04-08 10:03:21,605 INFO L272 TraceCheckUtils]: 21: Hoare triple {7578#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7578#false} is VALID [2022-04-08 10:03:21,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {7578#false} ~cond := #in~cond; {7578#false} is VALID [2022-04-08 10:03:21,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {7578#false} assume 0 == ~cond; {7578#false} is VALID [2022-04-08 10:03:21,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {7578#false} assume !false; {7578#false} is VALID [2022-04-08 10:03:21,606 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:03:21,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:21,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {7578#false} assume !false; {7578#false} is VALID [2022-04-08 10:03:21,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {7578#false} assume 0 == ~cond; {7578#false} is VALID [2022-04-08 10:03:21,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {7578#false} ~cond := #in~cond; {7578#false} is VALID [2022-04-08 10:03:21,873 INFO L272 TraceCheckUtils]: 21: Hoare triple {7578#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7578#false} is VALID [2022-04-08 10:03:21,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {7578#false} assume !(~y~0 % 4294967296 > 0); {7578#false} is VALID [2022-04-08 10:03:21,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {7686#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7578#false} is VALID [2022-04-08 10:03:21,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {7690#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7686#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:21,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {7694#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7690#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:21,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {7698#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7694#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:03:21,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {7702#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {7698#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:03:21,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {7706#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7702#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-08 10:03:21,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {7710#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7706#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:21,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {7714#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7710#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-08 10:03:21,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {7577#true} ~z~0 := ~y~0; {7714#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:03:21,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {7577#true} assume !(~x~0 % 4294967296 > 0); {7577#true} is VALID [2022-04-08 10:03:21,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {7577#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7577#true} is VALID [2022-04-08 10:03:21,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {7577#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7577#true} is VALID [2022-04-08 10:03:21,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {7577#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7577#true} is VALID [2022-04-08 10:03:21,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {7577#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7577#true} is VALID [2022-04-08 10:03:21,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {7577#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7577#true} is VALID [2022-04-08 10:03:21,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {7577#true} call #t~ret11 := main(); {7577#true} is VALID [2022-04-08 10:03:21,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7577#true} {7577#true} #61#return; {7577#true} is VALID [2022-04-08 10:03:21,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {7577#true} assume true; {7577#true} is VALID [2022-04-08 10:03:21,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {7577#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7577#true} is VALID [2022-04-08 10:03:21,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {7577#true} call ULTIMATE.init(); {7577#true} is VALID [2022-04-08 10:03:21,879 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:03:21,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555844927] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:21,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:21,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 24 [2022-04-08 10:03:21,880 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:21,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1723318663] [2022-04-08 10:03:21,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1723318663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:21,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:21,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:03:21,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252655588] [2022-04-08 10:03:21,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:21,880 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 10:03:21,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:21,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:21,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:21,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:03:21,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:21,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:03:21,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:03:21,897 INFO L87 Difference]: Start difference. First operand 58 states and 73 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:22,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:22,490 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-04-08 10:03:22,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:03:22,490 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 10:03:22,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:22,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-08 10:03:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-08 10:03:22,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 43 transitions. [2022-04-08 10:03:22,524 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-08 10:03:22,525 INFO L225 Difference]: With dead ends: 75 [2022-04-08 10:03:22,525 INFO L226 Difference]: Without dead ends: 65 [2022-04-08 10:03:22,526 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 10:03:22,526 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:22,526 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:03:22,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-08 10:03:22,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2022-04-08 10:03:22,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:22,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 59 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:22,645 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 59 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:22,645 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 59 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:22,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:22,646 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2022-04-08 10:03:22,646 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2022-04-08 10:03:22,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:22,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:22,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 3 states have call successors, (3), 3 states 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-08 10:03:22,647 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 3 states have call successors, (3), 3 states 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-08 10:03:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:22,648 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2022-04-08 10:03:22,648 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2022-04-08 10:03:22,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:22,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:22,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:22,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:22,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:22,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2022-04-08 10:03:22,650 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 25 [2022-04-08 10:03:22,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:22,650 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2022-04-08 10:03:22,650 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:22,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 74 transitions. [2022-04-08 10:03:22,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:22,741 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-04-08 10:03:22,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:03:22,741 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:22,741 INFO L499 BasicCegarLoop]: trace histogram [8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:22,761 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-08 10:03:22,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:22,956 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:22,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:22,956 INFO L85 PathProgramCache]: Analyzing trace with hash 629850767, now seen corresponding path program 33 times [2022-04-08 10:03:22,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:22,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1467937182] [2022-04-08 10:03:22,958 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:22,958 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:22,958 INFO L85 PathProgramCache]: Analyzing trace with hash 629850767, now seen corresponding path program 34 times [2022-04-08 10:03:22,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:22,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292284424] [2022-04-08 10:03:22,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:22,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:23,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:23,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {8185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8169#true} is VALID [2022-04-08 10:03:23,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {8169#true} assume true; {8169#true} is VALID [2022-04-08 10:03:23,122 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8169#true} {8169#true} #61#return; {8169#true} is VALID [2022-04-08 10:03:23,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {8169#true} call ULTIMATE.init(); {8185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:23,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {8185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8169#true} is VALID [2022-04-08 10:03:23,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {8169#true} assume true; {8169#true} is VALID [2022-04-08 10:03:23,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8169#true} {8169#true} #61#return; {8169#true} is VALID [2022-04-08 10:03:23,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {8169#true} call #t~ret11 := main(); {8169#true} is VALID [2022-04-08 10:03:23,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {8169#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8174#(= main_~y~0 0)} is VALID [2022-04-08 10:03:23,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {8174#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8175#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:23,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {8175#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8176#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:23,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {8176#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8177#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:23,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {8177#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8178#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:23,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {8178#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8179#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:23,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {8179#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8180#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:23,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {8180#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8181#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:23,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {8181#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:23,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {8182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {8182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:23,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {8182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {8183#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:03:23,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {8183#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8184#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:23,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {8184#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {8170#false} is VALID [2022-04-08 10:03:23,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {8170#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8170#false} is VALID [2022-04-08 10:03:23,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {8170#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8170#false} is VALID [2022-04-08 10:03:23,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {8170#false} assume !(~y~0 % 4294967296 > 0); {8170#false} is VALID [2022-04-08 10:03:23,129 INFO L272 TraceCheckUtils]: 21: Hoare triple {8170#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8170#false} is VALID [2022-04-08 10:03:23,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {8170#false} ~cond := #in~cond; {8170#false} is VALID [2022-04-08 10:03:23,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {8170#false} assume 0 == ~cond; {8170#false} is VALID [2022-04-08 10:03:23,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {8170#false} assume !false; {8170#false} is VALID [2022-04-08 10:03:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:23,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:23,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292284424] [2022-04-08 10:03:23,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292284424] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:23,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134757066] [2022-04-08 10:03:23,129 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:23,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:23,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:23,130 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-08 10:03:23,131 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-08 10:03:23,163 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:23,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:23,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:03:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:23,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:23,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {8169#true} call ULTIMATE.init(); {8169#true} is VALID [2022-04-08 10:03:23,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {8169#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8169#true} is VALID [2022-04-08 10:03:23,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {8169#true} assume true; {8169#true} is VALID [2022-04-08 10:03:23,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8169#true} {8169#true} #61#return; {8169#true} is VALID [2022-04-08 10:03:23,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {8169#true} call #t~ret11 := main(); {8169#true} is VALID [2022-04-08 10:03:23,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {8169#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8174#(= main_~y~0 0)} is VALID [2022-04-08 10:03:23,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {8174#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8175#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:23,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {8175#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8176#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:23,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {8176#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8177#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:23,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {8177#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8178#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:23,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {8178#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8179#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:23,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {8179#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8180#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:23,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {8180#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8181#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:23,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {8181#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:23,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {8182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {8182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:23,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {8182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {8183#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:03:23,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {8183#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8237#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:03:23,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {8237#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {8170#false} is VALID [2022-04-08 10:03:23,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {8170#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8170#false} is VALID [2022-04-08 10:03:23,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {8170#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8170#false} is VALID [2022-04-08 10:03:23,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {8170#false} assume !(~y~0 % 4294967296 > 0); {8170#false} is VALID [2022-04-08 10:03:23,390 INFO L272 TraceCheckUtils]: 21: Hoare triple {8170#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8170#false} is VALID [2022-04-08 10:03:23,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {8170#false} ~cond := #in~cond; {8170#false} is VALID [2022-04-08 10:03:23,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {8170#false} assume 0 == ~cond; {8170#false} is VALID [2022-04-08 10:03:23,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {8170#false} assume !false; {8170#false} is VALID [2022-04-08 10:03:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:23,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:23,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {8170#false} assume !false; {8170#false} is VALID [2022-04-08 10:03:23,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {8170#false} assume 0 == ~cond; {8170#false} is VALID [2022-04-08 10:03:23,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {8170#false} ~cond := #in~cond; {8170#false} is VALID [2022-04-08 10:03:23,656 INFO L272 TraceCheckUtils]: 21: Hoare triple {8170#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8170#false} is VALID [2022-04-08 10:03:23,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {8170#false} assume !(~y~0 % 4294967296 > 0); {8170#false} is VALID [2022-04-08 10:03:23,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {8170#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8170#false} is VALID [2022-04-08 10:03:23,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {8170#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8170#false} is VALID [2022-04-08 10:03:23,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {8283#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8170#false} is VALID [2022-04-08 10:03:23,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {8287#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8283#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:23,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {8291#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {8287#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:23,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {8291#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {8291#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:23,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {8298#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8291#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:23,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {8302#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8298#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:23,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {8306#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8302#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:23,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {8310#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8306#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:23,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {8314#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8310#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:23,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {8318#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8314#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:23,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {8322#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8318#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:23,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {8326#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8322#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:23,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {8169#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8326#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:23,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {8169#true} call #t~ret11 := main(); {8169#true} is VALID [2022-04-08 10:03:23,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8169#true} {8169#true} #61#return; {8169#true} is VALID [2022-04-08 10:03:23,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {8169#true} assume true; {8169#true} is VALID [2022-04-08 10:03:23,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {8169#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8169#true} is VALID [2022-04-08 10:03:23,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {8169#true} call ULTIMATE.init(); {8169#true} is VALID [2022-04-08 10:03:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:23,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134757066] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:23,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:23,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-08 10:03:23,665 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:23,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1467937182] [2022-04-08 10:03:23,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1467937182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:23,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:23,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:03:23,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948134334] [2022-04-08 10:03:23,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:23,666 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 10:03:23,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:23,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:23,684 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-08 10:03:23,684 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:03:23,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:23,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:03:23,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:03:23,685 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:24,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:24,715 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2022-04-08 10:03:24,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:03:24,715 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 10:03:24,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:24,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:24,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-08 10:03:24,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-08 10:03:24,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 74 transitions. [2022-04-08 10:03:24,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:24,796 INFO L225 Difference]: With dead ends: 91 [2022-04-08 10:03:24,796 INFO L226 Difference]: Without dead ends: 83 [2022-04-08 10:03:24,797 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:03:24,798 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 51 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:24,798 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 75 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:03:24,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-08 10:03:24,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65. [2022-04-08 10:03:24,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:24,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 65 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:24,958 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 65 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:24,958 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 65 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:24,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:24,960 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-04-08 10:03:24,960 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2022-04-08 10:03:24,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:24,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:24,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-08 10:03:24,960 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-08 10:03:24,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:24,962 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-04-08 10:03:24,962 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2022-04-08 10:03:24,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:24,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:24,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:24,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:24,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2022-04-08 10:03:24,963 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 25 [2022-04-08 10:03:24,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:24,963 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2022-04-08 10:03:24,964 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:24,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 82 transitions. [2022-04-08 10:03:25,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:25,092 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2022-04-08 10:03:25,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:03:25,093 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:25,093 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:25,123 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-08 10:03:25,293 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:25,294 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:25,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:25,294 INFO L85 PathProgramCache]: Analyzing trace with hash 359277261, now seen corresponding path program 35 times [2022-04-08 10:03:25,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:25,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2104428932] [2022-04-08 10:03:25,296 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:25,296 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:25,296 INFO L85 PathProgramCache]: Analyzing trace with hash 359277261, now seen corresponding path program 36 times [2022-04-08 10:03:25,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:25,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370700052] [2022-04-08 10:03:25,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:25,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:25,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:25,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {8861#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8849#true} is VALID [2022-04-08 10:03:25,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {8849#true} assume true; {8849#true} is VALID [2022-04-08 10:03:25,439 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8849#true} {8849#true} #61#return; {8849#true} is VALID [2022-04-08 10:03:25,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {8849#true} call ULTIMATE.init(); {8861#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:25,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {8861#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8849#true} is VALID [2022-04-08 10:03:25,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {8849#true} assume true; {8849#true} is VALID [2022-04-08 10:03:25,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8849#true} {8849#true} #61#return; {8849#true} is VALID [2022-04-08 10:03:25,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {8849#true} call #t~ret11 := main(); {8849#true} is VALID [2022-04-08 10:03:25,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {8849#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8849#true} is VALID [2022-04-08 10:03:25,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {8849#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8849#true} is VALID [2022-04-08 10:03:25,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {8849#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8849#true} is VALID [2022-04-08 10:03:25,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {8849#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8849#true} is VALID [2022-04-08 10:03:25,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {8849#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8849#true} is VALID [2022-04-08 10:03:25,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {8849#true} assume !(~x~0 % 4294967296 > 0); {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:25,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:25,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8855#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:25,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {8855#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8856#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:25,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {8856#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8857#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:25,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {8857#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:25,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:25,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8857#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:25,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {8857#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8856#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:25,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {8856#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8855#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:25,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {8855#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:25,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:25,448 INFO L272 TraceCheckUtils]: 22: Hoare triple {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:03:25,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {8859#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8860#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:03:25,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {8860#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8850#false} is VALID [2022-04-08 10:03:25,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {8850#false} assume !false; {8850#false} is VALID [2022-04-08 10:03:25,449 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:03:25,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:25,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370700052] [2022-04-08 10:03:25,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370700052] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:25,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606998303] [2022-04-08 10:03:25,449 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:25,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:25,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:25,450 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-08 10:03:25,451 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-08 10:03:25,488 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:03:25,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:25,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 10:03:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:25,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:25,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {8849#true} call ULTIMATE.init(); {8849#true} is VALID [2022-04-08 10:03:25,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {8849#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8849#true} is VALID [2022-04-08 10:03:25,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {8849#true} assume true; {8849#true} is VALID [2022-04-08 10:03:25,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8849#true} {8849#true} #61#return; {8849#true} is VALID [2022-04-08 10:03:25,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {8849#true} call #t~ret11 := main(); {8849#true} is VALID [2022-04-08 10:03:25,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {8849#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8849#true} is VALID [2022-04-08 10:03:25,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {8849#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8849#true} is VALID [2022-04-08 10:03:25,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {8849#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8849#true} is VALID [2022-04-08 10:03:25,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {8849#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8849#true} is VALID [2022-04-08 10:03:25,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {8849#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8849#true} is VALID [2022-04-08 10:03:25,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {8849#true} assume !(~x~0 % 4294967296 > 0); {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:25,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:25,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8855#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:25,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {8855#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8856#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:25,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {8856#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8857#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:25,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {8857#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:25,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:25,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8857#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:25,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {8857#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8856#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:25,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {8856#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8855#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:25,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {8855#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:25,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:25,760 INFO L272 TraceCheckUtils]: 22: Hoare triple {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8931#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:03:25,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {8931#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8935#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:03:25,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {8935#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8850#false} is VALID [2022-04-08 10:03:25,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {8850#false} assume !false; {8850#false} is VALID [2022-04-08 10:03:25,761 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:03:25,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:25,992 INFO L290 TraceCheckUtils]: 25: Hoare triple {8850#false} assume !false; {8850#false} is VALID [2022-04-08 10:03:25,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {8935#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8850#false} is VALID [2022-04-08 10:03:25,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {8931#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8935#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:03:25,994 INFO L272 TraceCheckUtils]: 22: Hoare triple {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8931#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:03:25,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:25,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {8855#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:25,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {8856#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8855#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:25,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {8857#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8856#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:25,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8857#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:25,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:25,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {8857#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:25,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {8856#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8857#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:25,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {8855#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8856#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:26,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8855#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:26,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:26,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {8849#true} assume !(~x~0 % 4294967296 > 0); {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:26,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {8849#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8849#true} is VALID [2022-04-08 10:03:26,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {8849#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8849#true} is VALID [2022-04-08 10:03:26,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {8849#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8849#true} is VALID [2022-04-08 10:03:26,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {8849#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8849#true} is VALID [2022-04-08 10:03:26,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {8849#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8849#true} is VALID [2022-04-08 10:03:26,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {8849#true} call #t~ret11 := main(); {8849#true} is VALID [2022-04-08 10:03:26,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8849#true} {8849#true} #61#return; {8849#true} is VALID [2022-04-08 10:03:26,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {8849#true} assume true; {8849#true} is VALID [2022-04-08 10:03:26,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {8849#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8849#true} is VALID [2022-04-08 10:03:26,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {8849#true} call ULTIMATE.init(); {8849#true} is VALID [2022-04-08 10:03:26,001 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:03:26,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606998303] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:26,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:26,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2022-04-08 10:03:26,002 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:26,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2104428932] [2022-04-08 10:03:26,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2104428932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:26,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:26,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:03:26,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108890582] [2022-04-08 10:03:26,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:26,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) 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 26 [2022-04-08 10:03:26,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:26,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) 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-08 10:03:26,020 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-08 10:03:26,020 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:03:26,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:26,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:03:26,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-04-08 10:03:26,021 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 10 states, 10 states have (on average 1.9) 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-08 10:03:26,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:26,762 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2022-04-08 10:03:26,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:03:26,762 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) 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 26 [2022-04-08 10:03:26,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:26,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) 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-08 10:03:26,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-08 10:03:26,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) 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-08 10:03:26,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-08 10:03:26,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2022-04-08 10:03:26,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:26,800 INFO L225 Difference]: With dead ends: 125 [2022-04-08 10:03:26,800 INFO L226 Difference]: Without dead ends: 115 [2022-04-08 10:03:26,800 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:03:26,801 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:26,801 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 60 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:03:26,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-08 10:03:26,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 69. [2022-04-08 10:03:26,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:26,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:26,965 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:26,965 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:26,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:26,967 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2022-04-08 10:03:26,967 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 148 transitions. [2022-04-08 10:03:26,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:26,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:26,968 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 115 states. [2022-04-08 10:03:26,968 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 115 states. [2022-04-08 10:03:26,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:26,970 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2022-04-08 10:03:26,971 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 148 transitions. [2022-04-08 10:03:26,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:26,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:26,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:26,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:26,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2022-04-08 10:03:26,972 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 26 [2022-04-08 10:03:26,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:26,973 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2022-04-08 10:03:26,973 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) 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-08 10:03:26,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 88 transitions. [2022-04-08 10:03:27,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:27,114 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2022-04-08 10:03:27,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:03:27,114 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:27,114 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:27,138 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-08 10:03:27,314 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,SelfDestructingSolverStorable22 [2022-04-08 10:03:27,315 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:27,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:27,315 INFO L85 PathProgramCache]: Analyzing trace with hash 177120127, now seen corresponding path program 37 times [2022-04-08 10:03:27,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:27,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1755027056] [2022-04-08 10:03:27,319 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:27,319 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:27,319 INFO L85 PathProgramCache]: Analyzing trace with hash 177120127, now seen corresponding path program 38 times [2022-04-08 10:03:27,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:27,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146688288] [2022-04-08 10:03:27,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:27,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:27,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:27,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {9665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9651#true} is VALID [2022-04-08 10:03:27,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {9651#true} assume true; {9651#true} is VALID [2022-04-08 10:03:27,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9651#true} {9651#true} #61#return; {9651#true} is VALID [2022-04-08 10:03:27,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {9651#true} call ULTIMATE.init(); {9665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:27,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {9665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9651#true} is VALID [2022-04-08 10:03:27,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {9651#true} assume true; {9651#true} is VALID [2022-04-08 10:03:27,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9651#true} {9651#true} #61#return; {9651#true} is VALID [2022-04-08 10:03:27,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {9651#true} call #t~ret11 := main(); {9651#true} is VALID [2022-04-08 10:03:27,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {9651#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9656#(= main_~y~0 0)} is VALID [2022-04-08 10:03:27,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {9656#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9657#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:27,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {9657#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9658#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:27,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {9658#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9659#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:27,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {9659#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9660#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:27,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {9660#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9661#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:27,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {9661#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {9661#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:27,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {9661#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {9662#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:27,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {9662#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9663#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:27,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {9663#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9664#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:27,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {9664#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {9652#false} is VALID [2022-04-08 10:03:27,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-08 10:03:27,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-08 10:03:27,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-08 10:03:27,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-08 10:03:27,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-08 10:03:27,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {9652#false} assume !(~y~0 % 4294967296 > 0); {9652#false} is VALID [2022-04-08 10:03:27,487 INFO L272 TraceCheckUtils]: 22: Hoare triple {9652#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9652#false} is VALID [2022-04-08 10:03:27,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {9652#false} ~cond := #in~cond; {9652#false} is VALID [2022-04-08 10:03:27,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {9652#false} assume 0 == ~cond; {9652#false} is VALID [2022-04-08 10:03:27,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {9652#false} assume !false; {9652#false} is VALID [2022-04-08 10:03:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:03:27,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:27,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146688288] [2022-04-08 10:03:27,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146688288] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:27,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879520524] [2022-04-08 10:03:27,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:27,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:27,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:27,489 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-08 10:03:27,490 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-08 10:03:27,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:27,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:27,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 10:03:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:27,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:27,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {9651#true} call ULTIMATE.init(); {9651#true} is VALID [2022-04-08 10:03:27,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {9651#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9651#true} is VALID [2022-04-08 10:03:27,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {9651#true} assume true; {9651#true} is VALID [2022-04-08 10:03:27,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9651#true} {9651#true} #61#return; {9651#true} is VALID [2022-04-08 10:03:27,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {9651#true} call #t~ret11 := main(); {9651#true} is VALID [2022-04-08 10:03:27,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {9651#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9656#(= main_~y~0 0)} is VALID [2022-04-08 10:03:27,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {9656#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9657#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:27,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {9657#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9658#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:27,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {9658#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9659#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:27,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {9659#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9660#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:27,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {9660#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9661#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:27,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {9661#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {9661#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:27,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {9661#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {9705#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:27,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {9705#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9709#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:27,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {9709#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9713#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:27,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {9713#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {9652#false} is VALID [2022-04-08 10:03:27,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-08 10:03:27,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-08 10:03:27,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-08 10:03:27,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-08 10:03:27,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-08 10:03:27,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {9652#false} assume !(~y~0 % 4294967296 > 0); {9652#false} is VALID [2022-04-08 10:03:27,731 INFO L272 TraceCheckUtils]: 22: Hoare triple {9652#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9652#false} is VALID [2022-04-08 10:03:27,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {9652#false} ~cond := #in~cond; {9652#false} is VALID [2022-04-08 10:03:27,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {9652#false} assume 0 == ~cond; {9652#false} is VALID [2022-04-08 10:03:27,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {9652#false} assume !false; {9652#false} is VALID [2022-04-08 10:03:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:03:27,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:27,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {9652#false} assume !false; {9652#false} is VALID [2022-04-08 10:03:27,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {9652#false} assume 0 == ~cond; {9652#false} is VALID [2022-04-08 10:03:27,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {9652#false} ~cond := #in~cond; {9652#false} is VALID [2022-04-08 10:03:27,894 INFO L272 TraceCheckUtils]: 22: Hoare triple {9652#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9652#false} is VALID [2022-04-08 10:03:27,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {9652#false} assume !(~y~0 % 4294967296 > 0); {9652#false} is VALID [2022-04-08 10:03:27,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-08 10:03:27,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-08 10:03:27,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {9768#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-08 10:03:27,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {9772#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9768#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:27,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {9776#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9772#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:27,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {9780#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {9776#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:03:27,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {9784#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9780#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:03:27,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {9788#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9784#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:27,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {9651#true} ~z~0 := ~y~0; {9788#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:03:27,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {9651#true} assume !(~x~0 % 4294967296 > 0); {9651#true} is VALID [2022-04-08 10:03:27,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {9651#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9651#true} is VALID [2022-04-08 10:03:27,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {9651#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9651#true} is VALID [2022-04-08 10:03:27,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {9651#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9651#true} is VALID [2022-04-08 10:03:27,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {9651#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9651#true} is VALID [2022-04-08 10:03:27,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {9651#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9651#true} is VALID [2022-04-08 10:03:27,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {9651#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9651#true} is VALID [2022-04-08 10:03:27,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {9651#true} call #t~ret11 := main(); {9651#true} is VALID [2022-04-08 10:03:27,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9651#true} {9651#true} #61#return; {9651#true} is VALID [2022-04-08 10:03:27,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {9651#true} assume true; {9651#true} is VALID [2022-04-08 10:03:27,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {9651#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9651#true} is VALID [2022-04-08 10:03:27,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {9651#true} call ULTIMATE.init(); {9651#true} is VALID [2022-04-08 10:03:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-08 10:03:27,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879520524] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:27,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:27,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 21 [2022-04-08 10:03:27,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:27,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1755027056] [2022-04-08 10:03:27,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1755027056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:27,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:27,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:03:27,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796036597] [2022-04-08 10:03:27,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:27,900 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 10:03:27,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:27,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:27,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:27,915 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:03:27,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:27,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:03:27,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-04-08 10:03:27,916 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:28,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:28,670 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-08 10:03:28,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 10:03:28,671 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 10:03:28,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:28,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:28,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2022-04-08 10:03:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:28,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2022-04-08 10:03:28,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 50 transitions. [2022-04-08 10:03:28,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:28,734 INFO L225 Difference]: With dead ends: 88 [2022-04-08 10:03:28,734 INFO L226 Difference]: Without dead ends: 77 [2022-04-08 10:03:28,734 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:03:28,735 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:28,735 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 63 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:03:28,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-08 10:03:28,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2022-04-08 10:03:28,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:28,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 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-08 10:03:28,885 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 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-08 10:03:28,885 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 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-08 10:03:28,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:28,886 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-04-08 10:03:28,886 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2022-04-08 10:03:28,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:28,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:28,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 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 77 states. [2022-04-08 10:03:28,887 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 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 77 states. [2022-04-08 10:03:28,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:28,888 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-04-08 10:03:28,888 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2022-04-08 10:03:28,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:28,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:28,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:28,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:28,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 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-08 10:03:28,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2022-04-08 10:03:28,890 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 26 [2022-04-08 10:03:28,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:28,890 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2022-04-08 10:03:28,890 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:28,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 89 transitions. [2022-04-08 10:03:29,036 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-08 10:03:29,037 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2022-04-08 10:03:29,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:03:29,037 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:29,037 INFO L499 BasicCegarLoop]: trace histogram [9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:29,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-08 10:03:29,237 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,SelfDestructingSolverStorable23 [2022-04-08 10:03:29,238 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:29,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:29,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1801953422, now seen corresponding path program 39 times [2022-04-08 10:03:29,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:29,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [259210026] [2022-04-08 10:03:29,240 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:29,240 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:29,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1801953422, now seen corresponding path program 40 times [2022-04-08 10:03:29,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:29,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876735336] [2022-04-08 10:03:29,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:29,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:29,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:29,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {10339#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10322#true} is VALID [2022-04-08 10:03:29,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {10322#true} assume true; {10322#true} is VALID [2022-04-08 10:03:29,429 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10322#true} {10322#true} #61#return; {10322#true} is VALID [2022-04-08 10:03:29,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {10322#true} call ULTIMATE.init(); {10339#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:29,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {10339#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10322#true} is VALID [2022-04-08 10:03:29,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {10322#true} assume true; {10322#true} is VALID [2022-04-08 10:03:29,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10322#true} {10322#true} #61#return; {10322#true} is VALID [2022-04-08 10:03:29,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {10322#true} call #t~ret11 := main(); {10322#true} is VALID [2022-04-08 10:03:29,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {10322#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10327#(= main_~y~0 0)} is VALID [2022-04-08 10:03:29,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {10327#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:29,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {10328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:29,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {10329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:29,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {10330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:29,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {10331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:29,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {10332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:29,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {10333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:29,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {10334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:29,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {10335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:29,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {10336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {10336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:29,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {10336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {10337#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:03:29,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {10337#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10338#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:29,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {10338#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {10323#false} is VALID [2022-04-08 10:03:29,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {10323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10323#false} is VALID [2022-04-08 10:03:29,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {10323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10323#false} is VALID [2022-04-08 10:03:29,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {10323#false} assume !(~y~0 % 4294967296 > 0); {10323#false} is VALID [2022-04-08 10:03:29,436 INFO L272 TraceCheckUtils]: 22: Hoare triple {10323#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10323#false} is VALID [2022-04-08 10:03:29,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {10323#false} ~cond := #in~cond; {10323#false} is VALID [2022-04-08 10:03:29,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {10323#false} assume 0 == ~cond; {10323#false} is VALID [2022-04-08 10:03:29,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {10323#false} assume !false; {10323#false} is VALID [2022-04-08 10:03:29,436 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:29,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:29,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876735336] [2022-04-08 10:03:29,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876735336] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:29,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495866964] [2022-04-08 10:03:29,436 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:29,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:29,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:29,438 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-08 10:03:29,438 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-08 10:03:29,473 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:29,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:29,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:03:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:29,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:29,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {10322#true} call ULTIMATE.init(); {10322#true} is VALID [2022-04-08 10:03:29,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {10322#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10322#true} is VALID [2022-04-08 10:03:29,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {10322#true} assume true; {10322#true} is VALID [2022-04-08 10:03:29,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10322#true} {10322#true} #61#return; {10322#true} is VALID [2022-04-08 10:03:29,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {10322#true} call #t~ret11 := main(); {10322#true} is VALID [2022-04-08 10:03:29,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {10322#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10327#(= main_~y~0 0)} is VALID [2022-04-08 10:03:29,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {10327#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:29,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {10328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:29,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {10329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:29,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {10330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:29,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {10331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:29,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {10332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:29,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {10333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:29,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {10334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:29,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {10335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:29,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {10336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {10336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:29,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {10336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {10337#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:03:29,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {10337#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10394#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:03:29,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {10394#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {10323#false} is VALID [2022-04-08 10:03:29,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {10323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10323#false} is VALID [2022-04-08 10:03:29,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {10323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10323#false} is VALID [2022-04-08 10:03:29,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {10323#false} assume !(~y~0 % 4294967296 > 0); {10323#false} is VALID [2022-04-08 10:03:29,726 INFO L272 TraceCheckUtils]: 22: Hoare triple {10323#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10323#false} is VALID [2022-04-08 10:03:29,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {10323#false} ~cond := #in~cond; {10323#false} is VALID [2022-04-08 10:03:29,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {10323#false} assume 0 == ~cond; {10323#false} is VALID [2022-04-08 10:03:29,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {10323#false} assume !false; {10323#false} is VALID [2022-04-08 10:03:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:29,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:30,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {10323#false} assume !false; {10323#false} is VALID [2022-04-08 10:03:30,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {10323#false} assume 0 == ~cond; {10323#false} is VALID [2022-04-08 10:03:30,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {10323#false} ~cond := #in~cond; {10323#false} is VALID [2022-04-08 10:03:30,012 INFO L272 TraceCheckUtils]: 22: Hoare triple {10323#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10323#false} is VALID [2022-04-08 10:03:30,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {10323#false} assume !(~y~0 % 4294967296 > 0); {10323#false} is VALID [2022-04-08 10:03:30,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {10323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10323#false} is VALID [2022-04-08 10:03:30,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {10323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10323#false} is VALID [2022-04-08 10:03:30,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {10440#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10323#false} is VALID [2022-04-08 10:03:30,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {10444#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10440#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:30,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {10448#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {10444#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:30,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {10448#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {10448#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:30,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {10455#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10448#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:30,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {10459#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10455#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:30,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {10463#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10459#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:30,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {10467#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10463#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:30,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {10471#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10467#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:30,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {10475#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10471#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:30,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {10479#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10475#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:30,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {10483#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10479#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:30,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {10487#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10483#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:30,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {10322#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10487#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:03:30,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {10322#true} call #t~ret11 := main(); {10322#true} is VALID [2022-04-08 10:03:30,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10322#true} {10322#true} #61#return; {10322#true} is VALID [2022-04-08 10:03:30,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {10322#true} assume true; {10322#true} is VALID [2022-04-08 10:03:30,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {10322#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10322#true} is VALID [2022-04-08 10:03:30,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {10322#true} call ULTIMATE.init(); {10322#true} is VALID [2022-04-08 10:03:30,021 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:30,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495866964] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:30,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:30,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-08 10:03:30,021 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:30,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [259210026] [2022-04-08 10:03:30,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [259210026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:30,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:30,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:03:30,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073448081] [2022-04-08 10:03:30,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:30,022 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 10:03:30,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:30,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:30,037 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-08 10:03:30,038 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:03:30,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:30,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:03:30,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:03:30,038 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:31,342 INFO L93 Difference]: Finished difference Result 109 states and 149 transitions. [2022-04-08 10:03:31,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:03:31,342 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 10:03:31,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2022-04-08 10:03:31,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:31,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2022-04-08 10:03:31,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 81 transitions. [2022-04-08 10:03:31,424 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-08 10:03:31,425 INFO L225 Difference]: With dead ends: 109 [2022-04-08 10:03:31,427 INFO L226 Difference]: Without dead ends: 101 [2022-04-08 10:03:31,427 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=353, Invalid=1287, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 10:03:31,428 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 59 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:31,428 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 88 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:03:31,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-08 10:03:31,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 76. [2022-04-08 10:03:31,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:31,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:31,619 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:31,619 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:31,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:31,621 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2022-04-08 10:03:31,621 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2022-04-08 10:03:31,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:31,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:31,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-08 10:03:31,621 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-08 10:03:31,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:31,623 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2022-04-08 10:03:31,623 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2022-04-08 10:03:31,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:31,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:31,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:31,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:31,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:31,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2022-04-08 10:03:31,625 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 26 [2022-04-08 10:03:31,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:31,625 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2022-04-08 10:03:31,625 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:31,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 97 transitions. [2022-04-08 10:03:31,785 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-08 10:03:31,786 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2022-04-08 10:03:31,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:03:31,786 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:31,786 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:31,812 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-08 10:03:31,986 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:31,987 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:31,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:31,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1542928431, now seen corresponding path program 41 times [2022-04-08 10:03:31,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:31,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [812693346] [2022-04-08 10:03:31,989 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:31,989 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:31,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1542928431, now seen corresponding path program 42 times [2022-04-08 10:03:31,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:31,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166121515] [2022-04-08 10:03:31,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:31,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:32,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:32,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {11121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11106#true} is VALID [2022-04-08 10:03:32,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {11106#true} assume true; {11106#true} is VALID [2022-04-08 10:03:32,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11106#true} {11106#true} #61#return; {11106#true} is VALID [2022-04-08 10:03:32,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {11106#true} call ULTIMATE.init(); {11121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:32,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {11121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11106#true} is VALID [2022-04-08 10:03:32,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {11106#true} assume true; {11106#true} is VALID [2022-04-08 10:03:32,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11106#true} {11106#true} #61#return; {11106#true} is VALID [2022-04-08 10:03:32,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {11106#true} call #t~ret11 := main(); {11106#true} is VALID [2022-04-08 10:03:32,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {11106#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11111#(= main_~y~0 0)} is VALID [2022-04-08 10:03:32,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {11111#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11112#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:32,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {11112#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11113#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:32,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {11113#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11114#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:32,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {11114#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11115#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:32,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {11115#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11115#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:32,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {11115#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {11116#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:32,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {11116#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11117#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:32,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {11117#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11118#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:32,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {11118#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11119#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:32,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {11119#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11120#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:03:32,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {11120#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11107#false} is VALID [2022-04-08 10:03:32,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {11107#false} assume !(~z~0 % 4294967296 > 0); {11107#false} is VALID [2022-04-08 10:03:32,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {11107#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11107#false} is VALID [2022-04-08 10:03:32,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {11107#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11107#false} is VALID [2022-04-08 10:03:32,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {11107#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11107#false} is VALID [2022-04-08 10:03:32,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {11107#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11107#false} is VALID [2022-04-08 10:03:32,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {11107#false} assume !(~y~0 % 4294967296 > 0); {11107#false} is VALID [2022-04-08 10:03:32,163 INFO L272 TraceCheckUtils]: 23: Hoare triple {11107#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11107#false} is VALID [2022-04-08 10:03:32,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {11107#false} ~cond := #in~cond; {11107#false} is VALID [2022-04-08 10:03:32,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {11107#false} assume 0 == ~cond; {11107#false} is VALID [2022-04-08 10:03:32,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {11107#false} assume !false; {11107#false} is VALID [2022-04-08 10:03:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:03:32,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:32,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166121515] [2022-04-08 10:03:32,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166121515] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:32,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736051023] [2022-04-08 10:03:32,166 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:32,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:32,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:32,167 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-08 10:03:32,192 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-08 10:03:32,222 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:03:32,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:32,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 10:03:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:32,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:32,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {11106#true} call ULTIMATE.init(); {11106#true} is VALID [2022-04-08 10:03:32,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {11106#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11106#true} is VALID [2022-04-08 10:03:32,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {11106#true} assume true; {11106#true} is VALID [2022-04-08 10:03:32,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11106#true} {11106#true} #61#return; {11106#true} is VALID [2022-04-08 10:03:32,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {11106#true} call #t~ret11 := main(); {11106#true} is VALID [2022-04-08 10:03:32,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {11106#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11111#(= main_~y~0 0)} is VALID [2022-04-08 10:03:32,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {11111#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11112#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:32,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {11112#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11113#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:32,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {11113#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11114#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:32,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {11114#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11115#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:32,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {11115#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11115#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:32,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {11115#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {11158#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:32,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {11158#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11162#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:32,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {11162#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11166#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:32,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {11166#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11170#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:32,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {11170#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11174#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:32,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {11174#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11107#false} is VALID [2022-04-08 10:03:32,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {11107#false} assume !(~z~0 % 4294967296 > 0); {11107#false} is VALID [2022-04-08 10:03:32,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {11107#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11107#false} is VALID [2022-04-08 10:03:32,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {11107#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11107#false} is VALID [2022-04-08 10:03:32,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {11107#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11107#false} is VALID [2022-04-08 10:03:32,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {11107#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11107#false} is VALID [2022-04-08 10:03:32,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {11107#false} assume !(~y~0 % 4294967296 > 0); {11107#false} is VALID [2022-04-08 10:03:32,460 INFO L272 TraceCheckUtils]: 23: Hoare triple {11107#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11107#false} is VALID [2022-04-08 10:03:32,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {11107#false} ~cond := #in~cond; {11107#false} is VALID [2022-04-08 10:03:32,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {11107#false} assume 0 == ~cond; {11107#false} is VALID [2022-04-08 10:03:32,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {11107#false} assume !false; {11107#false} is VALID [2022-04-08 10:03:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:03:32,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:32,758 INFO L290 TraceCheckUtils]: 26: Hoare triple {11107#false} assume !false; {11107#false} is VALID [2022-04-08 10:03:32,758 INFO L290 TraceCheckUtils]: 25: Hoare triple {11107#false} assume 0 == ~cond; {11107#false} is VALID [2022-04-08 10:03:32,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {11107#false} ~cond := #in~cond; {11107#false} is VALID [2022-04-08 10:03:32,758 INFO L272 TraceCheckUtils]: 23: Hoare triple {11107#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11107#false} is VALID [2022-04-08 10:03:32,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {11220#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {11107#false} is VALID [2022-04-08 10:03:32,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {11224#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11220#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:32,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {11228#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11224#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:32,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {11232#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11228#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:32,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {11236#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11232#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:32,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {11236#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {11236#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:32,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {11243#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11236#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:32,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {11247#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11243#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:03:32,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {11251#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11247#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:03:32,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {11255#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11251#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:03:32,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {11259#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11255#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:03:32,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {11106#true} ~z~0 := ~y~0; {11259#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:03:32,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {11106#true} assume !(~x~0 % 4294967296 > 0); {11106#true} is VALID [2022-04-08 10:03:32,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {11106#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11106#true} is VALID [2022-04-08 10:03:32,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {11106#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11106#true} is VALID [2022-04-08 10:03:32,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {11106#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11106#true} is VALID [2022-04-08 10:03:32,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {11106#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11106#true} is VALID [2022-04-08 10:03:32,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {11106#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11106#true} is VALID [2022-04-08 10:03:32,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {11106#true} call #t~ret11 := main(); {11106#true} is VALID [2022-04-08 10:03:32,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11106#true} {11106#true} #61#return; {11106#true} is VALID [2022-04-08 10:03:32,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {11106#true} assume true; {11106#true} is VALID [2022-04-08 10:03:32,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {11106#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11106#true} is VALID [2022-04-08 10:03:32,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {11106#true} call ULTIMATE.init(); {11106#true} is VALID [2022-04-08 10:03:32,767 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:03:32,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736051023] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:32,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:32,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 28 [2022-04-08 10:03:32,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:32,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [812693346] [2022-04-08 10:03:32,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [812693346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:32,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:32,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:03:32,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396084995] [2022-04-08 10:03:32,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:32,768 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 10:03:32,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:32,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:32,792 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-08 10:03:32,793 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:03:32,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:32,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:03:32,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:03:32,793 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:33,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:33,381 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2022-04-08 10:03:33,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:03:33,381 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 10:03:33,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:33,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions. [2022-04-08 10:03:33,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:33,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions. [2022-04-08 10:03:33,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 37 transitions. [2022-04-08 10:03:33,415 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-08 10:03:33,416 INFO L225 Difference]: With dead ends: 86 [2022-04-08 10:03:33,417 INFO L226 Difference]: Without dead ends: 69 [2022-04-08 10:03:33,417 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=258, Invalid=1148, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:03:33,418 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:33,418 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 66 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:33,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-08 10:03:33,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-08 10:03:33,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:33,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:33,559 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:33,559 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:33,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:33,560 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2022-04-08 10:03:33,560 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2022-04-08 10:03:33,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:33,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:33,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-08 10:03:33,561 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-08 10:03:33,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:33,562 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2022-04-08 10:03:33,562 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2022-04-08 10:03:33,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:33,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:33,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:33,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:33,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2022-04-08 10:03:33,564 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 27 [2022-04-08 10:03:33,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:33,564 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2022-04-08 10:03:33,564 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:33,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 88 transitions. [2022-04-08 10:03:33,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:33,710 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2022-04-08 10:03:33,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:03:33,710 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:33,710 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:33,737 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-08 10:03:33,910 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:33,911 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:33,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:33,911 INFO L85 PathProgramCache]: Analyzing trace with hash -921018945, now seen corresponding path program 43 times [2022-04-08 10:03:33,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:33,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [190253933] [2022-04-08 10:03:33,914 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:33,914 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:33,914 INFO L85 PathProgramCache]: Analyzing trace with hash -921018945, now seen corresponding path program 44 times [2022-04-08 10:03:33,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:33,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574543106] [2022-04-08 10:03:33,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:33,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:34,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:34,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {11781#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11766#true} is VALID [2022-04-08 10:03:34,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {11766#true} assume true; {11766#true} is VALID [2022-04-08 10:03:34,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11766#true} {11766#true} #61#return; {11766#true} is VALID [2022-04-08 10:03:34,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {11766#true} call ULTIMATE.init(); {11781#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:34,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {11781#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11766#true} is VALID [2022-04-08 10:03:34,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {11766#true} assume true; {11766#true} is VALID [2022-04-08 10:03:34,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11766#true} {11766#true} #61#return; {11766#true} is VALID [2022-04-08 10:03:34,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {11766#true} call #t~ret11 := main(); {11766#true} is VALID [2022-04-08 10:03:34,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {11766#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11771#(= main_~y~0 0)} is VALID [2022-04-08 10:03:34,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {11771#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11772#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:34,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {11772#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11773#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:34,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {11773#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11774#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:34,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {11774#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11775#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:34,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {11775#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11776#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:34,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {11776#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {11776#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:34,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {11776#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {11777#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:34,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {11777#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11778#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:34,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {11778#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11779#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:34,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {11779#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11780#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:34,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {11780#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {11767#false} is VALID [2022-04-08 10:03:34,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-08 10:03:34,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-08 10:03:34,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-08 10:03:34,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-08 10:03:34,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-08 10:03:34,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {11767#false} assume !(~y~0 % 4294967296 > 0); {11767#false} is VALID [2022-04-08 10:03:34,094 INFO L272 TraceCheckUtils]: 23: Hoare triple {11767#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11767#false} is VALID [2022-04-08 10:03:34,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {11767#false} ~cond := #in~cond; {11767#false} is VALID [2022-04-08 10:03:34,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {11767#false} assume 0 == ~cond; {11767#false} is VALID [2022-04-08 10:03:34,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {11767#false} assume !false; {11767#false} is VALID [2022-04-08 10:03:34,094 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:03:34,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:34,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574543106] [2022-04-08 10:03:34,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574543106] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:34,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726837288] [2022-04-08 10:03:34,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:34,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:34,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:34,100 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-08 10:03:34,101 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-08 10:03:34,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:34,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:34,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 10:03:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:34,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:34,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {11766#true} call ULTIMATE.init(); {11766#true} is VALID [2022-04-08 10:03:34,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {11766#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11766#true} is VALID [2022-04-08 10:03:34,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {11766#true} assume true; {11766#true} is VALID [2022-04-08 10:03:34,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11766#true} {11766#true} #61#return; {11766#true} is VALID [2022-04-08 10:03:34,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {11766#true} call #t~ret11 := main(); {11766#true} is VALID [2022-04-08 10:03:34,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {11766#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11771#(= main_~y~0 0)} is VALID [2022-04-08 10:03:34,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {11771#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11772#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:34,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {11772#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11773#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:34,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {11773#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11774#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:34,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {11774#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11775#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:34,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {11775#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11776#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:34,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {11776#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {11776#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:34,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {11776#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {11821#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:34,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {11821#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11825#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:34,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {11825#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11829#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:34,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {11829#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11833#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:34,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {11833#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {11767#false} is VALID [2022-04-08 10:03:34,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-08 10:03:34,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-08 10:03:34,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-08 10:03:34,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-08 10:03:34,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-08 10:03:34,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {11767#false} assume !(~y~0 % 4294967296 > 0); {11767#false} is VALID [2022-04-08 10:03:34,343 INFO L272 TraceCheckUtils]: 23: Hoare triple {11767#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11767#false} is VALID [2022-04-08 10:03:34,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {11767#false} ~cond := #in~cond; {11767#false} is VALID [2022-04-08 10:03:34,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {11767#false} assume 0 == ~cond; {11767#false} is VALID [2022-04-08 10:03:34,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {11767#false} assume !false; {11767#false} is VALID [2022-04-08 10:03:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:03:34,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:34,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {11767#false} assume !false; {11767#false} is VALID [2022-04-08 10:03:34,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {11767#false} assume 0 == ~cond; {11767#false} is VALID [2022-04-08 10:03:34,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {11767#false} ~cond := #in~cond; {11767#false} is VALID [2022-04-08 10:03:34,558 INFO L272 TraceCheckUtils]: 23: Hoare triple {11767#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11767#false} is VALID [2022-04-08 10:03:34,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {11767#false} assume !(~y~0 % 4294967296 > 0); {11767#false} is VALID [2022-04-08 10:03:34,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-08 10:03:34,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {11885#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-08 10:03:34,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {11889#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11885#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:34,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {11893#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11889#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:34,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {11897#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11893#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:03:34,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {11901#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {11897#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:03:34,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {11905#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11901#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-08 10:03:34,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {11909#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11905#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:34,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {11913#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11909#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-08 10:03:34,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {11766#true} ~z~0 := ~y~0; {11913#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:03:34,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {11766#true} assume !(~x~0 % 4294967296 > 0); {11766#true} is VALID [2022-04-08 10:03:34,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {11766#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11766#true} is VALID [2022-04-08 10:03:34,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {11766#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11766#true} is VALID [2022-04-08 10:03:34,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {11766#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11766#true} is VALID [2022-04-08 10:03:34,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {11766#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11766#true} is VALID [2022-04-08 10:03:34,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {11766#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11766#true} is VALID [2022-04-08 10:03:34,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {11766#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11766#true} is VALID [2022-04-08 10:03:34,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {11766#true} call #t~ret11 := main(); {11766#true} is VALID [2022-04-08 10:03:34,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11766#true} {11766#true} #61#return; {11766#true} is VALID [2022-04-08 10:03:34,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {11766#true} assume true; {11766#true} is VALID [2022-04-08 10:03:34,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {11766#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11766#true} is VALID [2022-04-08 10:03:34,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {11766#true} call ULTIMATE.init(); {11766#true} is VALID [2022-04-08 10:03:34,580 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 10:03:34,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726837288] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:34,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:34,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 25 [2022-04-08 10:03:34,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:34,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [190253933] [2022-04-08 10:03:34,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [190253933] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:34,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:34,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:03:34,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501918426] [2022-04-08 10:03:34,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:34,581 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 10:03:34,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:34,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:34,607 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-08 10:03:34,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:03:34,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:34,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:03:34,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:03:34,608 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:35,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:35,202 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-08 10:03:35,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:03:35,202 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 10:03:35,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2022-04-08 10:03:35,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:35,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2022-04-08 10:03:35,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 45 transitions. [2022-04-08 10:03:35,242 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-08 10:03:35,243 INFO L225 Difference]: With dead ends: 88 [2022-04-08 10:03:35,243 INFO L226 Difference]: Without dead ends: 77 [2022-04-08 10:03:35,243 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 10:03:35,244 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:35,244 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 53 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:03:35,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-08 10:03:35,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2022-04-08 10:03:35,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:35,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 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-08 10:03:35,380 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 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-08 10:03:35,380 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 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-08 10:03:35,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:35,381 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-04-08 10:03:35,382 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2022-04-08 10:03:35,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:35,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:35,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 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 77 states. [2022-04-08 10:03:35,382 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 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 77 states. [2022-04-08 10:03:35,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:35,383 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-04-08 10:03:35,383 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2022-04-08 10:03:35,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:35,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:35,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:35,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 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-08 10:03:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2022-04-08 10:03:35,385 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 27 [2022-04-08 10:03:35,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:35,385 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2022-04-08 10:03:35,385 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:35,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 89 transitions. [2022-04-08 10:03:35,503 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-08 10:03:35,504 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2022-04-08 10:03:35,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:03:35,504 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:35,504 INFO L499 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:35,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-08 10:03:35,704 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-08 10:03:35,705 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:35,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:35,705 INFO L85 PathProgramCache]: Analyzing trace with hash -517569937, now seen corresponding path program 45 times [2022-04-08 10:03:35,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:35,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [430010958] [2022-04-08 10:03:35,711 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:35,711 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:35,711 INFO L85 PathProgramCache]: Analyzing trace with hash -517569937, now seen corresponding path program 46 times [2022-04-08 10:03:35,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:35,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285376985] [2022-04-08 10:03:35,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:35,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:35,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:35,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {12463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12445#true} is VALID [2022-04-08 10:03:35,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {12445#true} assume true; {12445#true} is VALID [2022-04-08 10:03:35,938 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12445#true} {12445#true} #61#return; {12445#true} is VALID [2022-04-08 10:03:35,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {12445#true} call ULTIMATE.init(); {12463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:35,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {12463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12445#true} is VALID [2022-04-08 10:03:35,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {12445#true} assume true; {12445#true} is VALID [2022-04-08 10:03:35,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12445#true} {12445#true} #61#return; {12445#true} is VALID [2022-04-08 10:03:35,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {12445#true} call #t~ret11 := main(); {12445#true} is VALID [2022-04-08 10:03:35,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {12445#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12450#(= main_~y~0 0)} is VALID [2022-04-08 10:03:35,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {12450#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12451#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:35,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {12451#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12452#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:35,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {12452#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12453#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:35,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {12453#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12454#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:35,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {12454#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12455#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:35,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {12455#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12456#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:35,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {12456#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12457#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:35,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {12457#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12458#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:35,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {12458#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12459#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:35,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {12459#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12460#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:35,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {12460#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {12460#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:35,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {12460#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {12461#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:03:35,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {12461#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12462#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:35,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {12462#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {12446#false} is VALID [2022-04-08 10:03:35,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {12446#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12446#false} is VALID [2022-04-08 10:03:35,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {12446#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12446#false} is VALID [2022-04-08 10:03:35,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {12446#false} assume !(~y~0 % 4294967296 > 0); {12446#false} is VALID [2022-04-08 10:03:35,947 INFO L272 TraceCheckUtils]: 23: Hoare triple {12446#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12446#false} is VALID [2022-04-08 10:03:35,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {12446#false} ~cond := #in~cond; {12446#false} is VALID [2022-04-08 10:03:35,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {12446#false} assume 0 == ~cond; {12446#false} is VALID [2022-04-08 10:03:35,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {12446#false} assume !false; {12446#false} is VALID [2022-04-08 10:03:35,948 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:35,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:35,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285376985] [2022-04-08 10:03:35,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285376985] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:35,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559040351] [2022-04-08 10:03:35,948 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:35,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:35,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:35,950 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-08 10:03:35,951 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-08 10:03:35,991 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:35,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:35,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:03:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:36,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:36,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {12445#true} call ULTIMATE.init(); {12445#true} is VALID [2022-04-08 10:03:36,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {12445#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12445#true} is VALID [2022-04-08 10:03:36,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {12445#true} assume true; {12445#true} is VALID [2022-04-08 10:03:36,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12445#true} {12445#true} #61#return; {12445#true} is VALID [2022-04-08 10:03:36,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {12445#true} call #t~ret11 := main(); {12445#true} is VALID [2022-04-08 10:03:36,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {12445#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12450#(= main_~y~0 0)} is VALID [2022-04-08 10:03:36,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {12450#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12451#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:36,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {12451#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12452#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:36,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {12452#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12453#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:36,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {12453#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12454#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:36,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {12454#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12455#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:36,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {12455#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12456#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:36,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {12456#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12457#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:36,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {12457#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12458#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:36,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {12458#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12459#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:36,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {12459#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12460#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:36,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {12460#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {12460#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:36,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {12460#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {12461#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:03:36,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {12461#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12521#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:03:36,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {12521#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {12446#false} is VALID [2022-04-08 10:03:36,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {12446#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12446#false} is VALID [2022-04-08 10:03:36,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {12446#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12446#false} is VALID [2022-04-08 10:03:36,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {12446#false} assume !(~y~0 % 4294967296 > 0); {12446#false} is VALID [2022-04-08 10:03:36,286 INFO L272 TraceCheckUtils]: 23: Hoare triple {12446#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12446#false} is VALID [2022-04-08 10:03:36,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {12446#false} ~cond := #in~cond; {12446#false} is VALID [2022-04-08 10:03:36,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {12446#false} assume 0 == ~cond; {12446#false} is VALID [2022-04-08 10:03:36,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {12446#false} assume !false; {12446#false} is VALID [2022-04-08 10:03:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:36,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:36,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {12446#false} assume !false; {12446#false} is VALID [2022-04-08 10:03:36,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {12446#false} assume 0 == ~cond; {12446#false} is VALID [2022-04-08 10:03:36,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {12446#false} ~cond := #in~cond; {12446#false} is VALID [2022-04-08 10:03:36,614 INFO L272 TraceCheckUtils]: 23: Hoare triple {12446#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12446#false} is VALID [2022-04-08 10:03:36,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {12446#false} assume !(~y~0 % 4294967296 > 0); {12446#false} is VALID [2022-04-08 10:03:36,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {12446#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12446#false} is VALID [2022-04-08 10:03:36,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {12446#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12446#false} is VALID [2022-04-08 10:03:36,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {12567#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12446#false} is VALID [2022-04-08 10:03:36,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {12571#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12567#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:36,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {12575#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {12571#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:36,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {12575#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {12575#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:36,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {12582#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12575#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:36,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {12586#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12582#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:36,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {12590#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12586#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:36,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {12594#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12590#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:36,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {12598#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12594#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:36,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {12602#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12598#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:36,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {12606#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12602#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:36,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {12610#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12606#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:36,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {12614#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12610#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:36,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {12618#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12614#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:03:36,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {12445#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12618#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:03:36,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {12445#true} call #t~ret11 := main(); {12445#true} is VALID [2022-04-08 10:03:36,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12445#true} {12445#true} #61#return; {12445#true} is VALID [2022-04-08 10:03:36,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {12445#true} assume true; {12445#true} is VALID [2022-04-08 10:03:36,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {12445#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12445#true} is VALID [2022-04-08 10:03:36,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {12445#true} call ULTIMATE.init(); {12445#true} is VALID [2022-04-08 10:03:36,623 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:36,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559040351] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:36,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:36,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-08 10:03:36,624 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:36,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [430010958] [2022-04-08 10:03:36,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [430010958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:36,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:36,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:03:36,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237783640] [2022-04-08 10:03:36,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:36,624 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 10:03:36,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:36,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:36,641 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-08 10:03:36,642 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:03:36,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:36,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:03:36,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:03:36,642 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:37,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:37,947 INFO L93 Difference]: Finished difference Result 110 states and 151 transitions. [2022-04-08 10:03:37,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:03:37,947 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 10:03:37,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:37,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:37,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 84 transitions. [2022-04-08 10:03:37,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:37,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 84 transitions. [2022-04-08 10:03:37,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 84 transitions. [2022-04-08 10:03:38,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:38,038 INFO L225 Difference]: With dead ends: 110 [2022-04-08 10:03:38,038 INFO L226 Difference]: Without dead ends: 102 [2022-04-08 10:03:38,039 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=1486, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:03:38,039 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 59 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:38,040 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 93 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:03:38,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-08 10:03:38,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 76. [2022-04-08 10:03:38,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:38,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:38,229 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:38,229 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:38,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:38,231 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2022-04-08 10:03:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2022-04-08 10:03:38,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:38,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:38,234 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states. [2022-04-08 10:03:38,234 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states. [2022-04-08 10:03:38,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:38,235 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2022-04-08 10:03:38,235 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2022-04-08 10:03:38,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:38,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:38,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:38,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:38,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:38,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2022-04-08 10:03:38,239 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 27 [2022-04-08 10:03:38,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:38,239 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2022-04-08 10:03:38,239 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:38,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 97 transitions. [2022-04-08 10:03:38,405 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-08 10:03:38,405 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2022-04-08 10:03:38,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:03:38,406 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:38,406 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:38,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-08 10:03:38,606 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,SelfDestructingSolverStorable27 [2022-04-08 10:03:38,606 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:38,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:38,607 INFO L85 PathProgramCache]: Analyzing trace with hash -603591809, now seen corresponding path program 47 times [2022-04-08 10:03:38,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:38,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [740259822] [2022-04-08 10:03:38,609 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:38,609 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:38,609 INFO L85 PathProgramCache]: Analyzing trace with hash -603591809, now seen corresponding path program 48 times [2022-04-08 10:03:38,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:38,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369041278] [2022-04-08 10:03:38,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:38,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:38,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:38,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {13259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13243#true} is VALID [2022-04-08 10:03:38,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {13243#true} assume true; {13243#true} is VALID [2022-04-08 10:03:38,800 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13243#true} {13243#true} #61#return; {13243#true} is VALID [2022-04-08 10:03:38,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {13243#true} call ULTIMATE.init(); {13259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:38,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {13259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13243#true} is VALID [2022-04-08 10:03:38,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {13243#true} assume true; {13243#true} is VALID [2022-04-08 10:03:38,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13243#true} {13243#true} #61#return; {13243#true} is VALID [2022-04-08 10:03:38,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {13243#true} call #t~ret11 := main(); {13243#true} is VALID [2022-04-08 10:03:38,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {13243#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13248#(= main_~y~0 0)} is VALID [2022-04-08 10:03:38,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {13248#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13249#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:38,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {13249#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13250#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:38,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {13250#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13251#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:38,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {13251#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13252#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:38,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {13252#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13253#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:38,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {13253#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {13253#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:38,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {13253#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {13254#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:38,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {13254#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13255#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:38,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {13255#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13256#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:38,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {13256#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13257#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:38,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {13257#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13258#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:38,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {13258#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {13244#false} is VALID [2022-04-08 10:03:38,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {13244#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-08 10:03:38,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {13244#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-08 10:03:38,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {13244#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-08 10:03:38,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {13244#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-08 10:03:38,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {13244#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-08 10:03:38,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {13244#false} assume !(~y~0 % 4294967296 > 0); {13244#false} is VALID [2022-04-08 10:03:38,809 INFO L272 TraceCheckUtils]: 24: Hoare triple {13244#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13244#false} is VALID [2022-04-08 10:03:38,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {13244#false} ~cond := #in~cond; {13244#false} is VALID [2022-04-08 10:03:38,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {13244#false} assume 0 == ~cond; {13244#false} is VALID [2022-04-08 10:03:38,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {13244#false} assume !false; {13244#false} is VALID [2022-04-08 10:03:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:03:38,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:38,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369041278] [2022-04-08 10:03:38,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369041278] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:38,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297139962] [2022-04-08 10:03:38,810 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:38,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:38,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:38,811 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-08 10:03:38,812 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-08 10:03:38,851 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:03:38,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:38,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 10:03:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:38,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:39,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {13243#true} call ULTIMATE.init(); {13243#true} is VALID [2022-04-08 10:03:39,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {13243#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13243#true} is VALID [2022-04-08 10:03:39,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {13243#true} assume true; {13243#true} is VALID [2022-04-08 10:03:39,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13243#true} {13243#true} #61#return; {13243#true} is VALID [2022-04-08 10:03:39,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {13243#true} call #t~ret11 := main(); {13243#true} is VALID [2022-04-08 10:03:39,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {13243#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13248#(= main_~y~0 0)} is VALID [2022-04-08 10:03:39,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {13248#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13249#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:39,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {13249#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13250#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:39,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {13250#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13251#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:39,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {13251#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13252#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:39,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {13252#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13253#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:39,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {13253#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {13253#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:39,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {13253#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {13299#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:39,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {13299#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13303#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:39,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {13303#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13307#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:39,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {13307#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13311#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:39,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {13311#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13315#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:39,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {13315#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {13244#false} is VALID [2022-04-08 10:03:39,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {13244#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-08 10:03:39,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {13244#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-08 10:03:39,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {13244#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-08 10:03:39,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {13244#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-08 10:03:39,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {13244#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-08 10:03:39,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {13244#false} assume !(~y~0 % 4294967296 > 0); {13244#false} is VALID [2022-04-08 10:03:39,088 INFO L272 TraceCheckUtils]: 24: Hoare triple {13244#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13244#false} is VALID [2022-04-08 10:03:39,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {13244#false} ~cond := #in~cond; {13244#false} is VALID [2022-04-08 10:03:39,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {13244#false} assume 0 == ~cond; {13244#false} is VALID [2022-04-08 10:03:39,088 INFO L290 TraceCheckUtils]: 27: Hoare triple {13244#false} assume !false; {13244#false} is VALID [2022-04-08 10:03:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:03:39,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:39,364 INFO L290 TraceCheckUtils]: 27: Hoare triple {13244#false} assume !false; {13244#false} is VALID [2022-04-08 10:03:39,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {13244#false} assume 0 == ~cond; {13244#false} is VALID [2022-04-08 10:03:39,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {13244#false} ~cond := #in~cond; {13244#false} is VALID [2022-04-08 10:03:39,364 INFO L272 TraceCheckUtils]: 24: Hoare triple {13244#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13244#false} is VALID [2022-04-08 10:03:39,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {13244#false} assume !(~y~0 % 4294967296 > 0); {13244#false} is VALID [2022-04-08 10:03:39,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {13364#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-08 10:03:39,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {13368#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13364#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:39,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {13372#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13368#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:39,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {13376#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13372#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:03:39,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {13380#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13376#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:03:39,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {13384#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {13380#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:03:39,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {13388#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13384#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:03:39,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {13392#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13388#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:03:39,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {13396#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13392#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:03:39,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {13400#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13396#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:03:39,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {13243#true} ~z~0 := ~y~0; {13400#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:03:39,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {13243#true} assume !(~x~0 % 4294967296 > 0); {13243#true} is VALID [2022-04-08 10:03:39,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {13243#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13243#true} is VALID [2022-04-08 10:03:39,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {13243#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13243#true} is VALID [2022-04-08 10:03:39,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {13243#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13243#true} is VALID [2022-04-08 10:03:39,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {13243#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13243#true} is VALID [2022-04-08 10:03:39,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {13243#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13243#true} is VALID [2022-04-08 10:03:39,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {13243#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13243#true} is VALID [2022-04-08 10:03:39,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {13243#true} call #t~ret11 := main(); {13243#true} is VALID [2022-04-08 10:03:39,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13243#true} {13243#true} #61#return; {13243#true} is VALID [2022-04-08 10:03:39,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {13243#true} assume true; {13243#true} is VALID [2022-04-08 10:03:39,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {13243#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13243#true} is VALID [2022-04-08 10:03:39,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {13243#true} call ULTIMATE.init(); {13243#true} is VALID [2022-04-08 10:03:39,372 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:03:39,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297139962] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:39,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:39,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 29 [2022-04-08 10:03:39,372 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:39,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [740259822] [2022-04-08 10:03:39,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [740259822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:39,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:39,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:03:39,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971277619] [2022-04-08 10:03:39,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:39,373 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 10:03:39,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:39,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:39,388 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-08 10:03:39,388 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:03:39,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:39,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:03:39,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2022-04-08 10:03:39,389 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:40,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:40,118 INFO L93 Difference]: Finished difference Result 95 states and 116 transitions. [2022-04-08 10:03:40,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 10:03:40,118 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 10:03:40,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:40,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:40,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions. [2022-04-08 10:03:40,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:40,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions. [2022-04-08 10:03:40,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 46 transitions. [2022-04-08 10:03:40,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:40,156 INFO L225 Difference]: With dead ends: 95 [2022-04-08 10:03:40,156 INFO L226 Difference]: Without dead ends: 84 [2022-04-08 10:03:40,157 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=1339, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:03:40,157 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:40,158 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:03:40,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-08 10:03:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2022-04-08 10:03:40,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:40,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:40,319 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:40,319 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:40,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:40,321 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-04-08 10:03:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-08 10:03:40,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:40,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:40,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 84 states. [2022-04-08 10:03:40,321 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 84 states. [2022-04-08 10:03:40,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:40,323 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-04-08 10:03:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-08 10:03:40,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:40,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:40,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:40,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2022-04-08 10:03:40,325 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 28 [2022-04-08 10:03:40,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:40,325 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2022-04-08 10:03:40,325 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:40,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 98 transitions. [2022-04-08 10:03:40,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:40,494 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2022-04-08 10:03:40,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:03:40,494 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:40,494 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:40,518 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-08 10:03:40,695 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,SelfDestructingSolverStorable28 [2022-04-08 10:03:40,695 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:40,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:40,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1955495667, now seen corresponding path program 49 times [2022-04-08 10:03:40,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:40,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2081338135] [2022-04-08 10:03:40,698 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:40,698 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:40,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1955495667, now seen corresponding path program 50 times [2022-04-08 10:03:40,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:40,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560721790] [2022-04-08 10:03:40,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:40,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:40,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:40,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {13991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13976#true} is VALID [2022-04-08 10:03:40,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {13976#true} assume true; {13976#true} is VALID [2022-04-08 10:03:40,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13976#true} {13976#true} #61#return; {13976#true} is VALID [2022-04-08 10:03:40,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {13976#true} call ULTIMATE.init(); {13991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:40,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {13991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13976#true} is VALID [2022-04-08 10:03:40,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {13976#true} assume true; {13976#true} is VALID [2022-04-08 10:03:40,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13976#true} {13976#true} #61#return; {13976#true} is VALID [2022-04-08 10:03:40,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {13976#true} call #t~ret11 := main(); {13976#true} is VALID [2022-04-08 10:03:40,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {13976#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13981#(= main_~y~0 0)} is VALID [2022-04-08 10:03:40,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {13981#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13982#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:40,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {13982#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13983#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:40,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {13983#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13984#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:40,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {13984#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13985#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:40,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {13985#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13986#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:40,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {13986#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13987#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:40,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {13987#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13987#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:40,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {13987#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {13988#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:40,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {13988#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13989#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:40,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {13989#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13990#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:40,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {13990#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {13977#false} is VALID [2022-04-08 10:03:40,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-08 10:03:40,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-08 10:03:40,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-08 10:03:40,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-08 10:03:40,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-08 10:03:40,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-08 10:03:40,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {13977#false} assume !(~y~0 % 4294967296 > 0); {13977#false} is VALID [2022-04-08 10:03:40,881 INFO L272 TraceCheckUtils]: 24: Hoare triple {13977#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13977#false} is VALID [2022-04-08 10:03:40,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {13977#false} ~cond := #in~cond; {13977#false} is VALID [2022-04-08 10:03:40,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {13977#false} assume 0 == ~cond; {13977#false} is VALID [2022-04-08 10:03:40,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {13977#false} assume !false; {13977#false} is VALID [2022-04-08 10:03:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:03:40,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:40,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560721790] [2022-04-08 10:03:40,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560721790] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:40,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289377762] [2022-04-08 10:03:40,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:40,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:40,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:40,884 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-08 10:03:40,907 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-08 10:03:40,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:40,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:40,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 10:03:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:40,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:41,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {13976#true} call ULTIMATE.init(); {13976#true} is VALID [2022-04-08 10:03:41,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {13976#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13976#true} is VALID [2022-04-08 10:03:41,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {13976#true} assume true; {13976#true} is VALID [2022-04-08 10:03:41,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13976#true} {13976#true} #61#return; {13976#true} is VALID [2022-04-08 10:03:41,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {13976#true} call #t~ret11 := main(); {13976#true} is VALID [2022-04-08 10:03:41,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {13976#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13981#(= main_~y~0 0)} is VALID [2022-04-08 10:03:41,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {13981#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13982#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:41,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {13982#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13983#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:41,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {13983#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13984#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:41,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {13984#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13985#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:41,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {13985#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13986#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:41,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {13986#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13987#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:41,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {13987#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13987#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:41,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {13987#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {13988#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:41,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {13988#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13989#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:41,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {13989#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14040#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:41,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {14040#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {13977#false} is VALID [2022-04-08 10:03:41,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-08 10:03:41,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-08 10:03:41,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-08 10:03:41,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-08 10:03:41,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-08 10:03:41,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-08 10:03:41,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {13977#false} assume !(~y~0 % 4294967296 > 0); {13977#false} is VALID [2022-04-08 10:03:41,194 INFO L272 TraceCheckUtils]: 24: Hoare triple {13977#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13977#false} is VALID [2022-04-08 10:03:41,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {13977#false} ~cond := #in~cond; {13977#false} is VALID [2022-04-08 10:03:41,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {13977#false} assume 0 == ~cond; {13977#false} is VALID [2022-04-08 10:03:41,194 INFO L290 TraceCheckUtils]: 27: Hoare triple {13977#false} assume !false; {13977#false} is VALID [2022-04-08 10:03:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:03:41,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:41,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {13977#false} assume !false; {13977#false} is VALID [2022-04-08 10:03:41,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {13977#false} assume 0 == ~cond; {13977#false} is VALID [2022-04-08 10:03:41,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {13977#false} ~cond := #in~cond; {13977#false} is VALID [2022-04-08 10:03:41,421 INFO L272 TraceCheckUtils]: 24: Hoare triple {13977#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13977#false} is VALID [2022-04-08 10:03:41,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {13977#false} assume !(~y~0 % 4294967296 > 0); {13977#false} is VALID [2022-04-08 10:03:41,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-08 10:03:41,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-08 10:03:41,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-08 10:03:41,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-08 10:03:41,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-08 10:03:41,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-08 10:03:41,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {14110#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {13977#false} is VALID [2022-04-08 10:03:41,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {14114#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14110#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:41,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {14118#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14114#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:41,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {14122#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {14118#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:41,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {14122#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {14122#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:41,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {14129#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14122#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:41,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {14133#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14129#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:41,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {14137#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14133#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:41,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {14141#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14137#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:41,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {14145#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14141#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:41,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {14149#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14145#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:41,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {13976#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14149#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:41,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {13976#true} call #t~ret11 := main(); {13976#true} is VALID [2022-04-08 10:03:41,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13976#true} {13976#true} #61#return; {13976#true} is VALID [2022-04-08 10:03:41,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {13976#true} assume true; {13976#true} is VALID [2022-04-08 10:03:41,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {13976#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13976#true} is VALID [2022-04-08 10:03:41,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {13976#true} call ULTIMATE.init(); {13976#true} is VALID [2022-04-08 10:03:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:03:41,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289377762] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:41,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:41,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-08 10:03:41,430 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:41,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2081338135] [2022-04-08 10:03:41,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2081338135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:41,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:41,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:03:41,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893029896] [2022-04-08 10:03:41,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:41,431 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 10:03:41,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:41,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:41,448 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-08 10:03:41,448 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:03:41,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:41,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:03:41,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:03:41,449 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:42,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:42,242 INFO L93 Difference]: Finished difference Result 98 states and 119 transitions. [2022-04-08 10:03:42,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:03:42,242 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 10:03:42,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:42,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:42,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2022-04-08 10:03:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2022-04-08 10:03:42,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 52 transitions. [2022-04-08 10:03:42,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:42,302 INFO L225 Difference]: With dead ends: 98 [2022-04-08 10:03:42,302 INFO L226 Difference]: Without dead ends: 86 [2022-04-08 10:03:42,303 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=266, Invalid=994, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:03:42,303 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:42,303 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 63 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:03:42,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-08 10:03:42,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2022-04-08 10:03:42,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:42,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 78 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 73 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:42,466 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 78 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 73 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:42,466 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 78 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 73 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:42,467 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2022-04-08 10:03:42,467 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2022-04-08 10:03:42,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:42,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:42,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 73 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-08 10:03:42,468 INFO L87 Difference]: Start difference. First operand has 78 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 73 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-08 10:03:42,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:42,469 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2022-04-08 10:03:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2022-04-08 10:03:42,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:42,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:42,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:42,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:42,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 73 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:42,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2022-04-08 10:03:42,471 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 28 [2022-04-08 10:03:42,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:42,471 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2022-04-08 10:03:42,471 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:42,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 99 transitions. [2022-04-08 10:03:42,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2022-04-08 10:03:42,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:03:42,638 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:42,638 INFO L499 BasicCegarLoop]: trace histogram [11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:42,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:42,838 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:42,838 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:42,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:42,839 INFO L85 PathProgramCache]: Analyzing trace with hash 591649966, now seen corresponding path program 51 times [2022-04-08 10:03:42,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:42,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [852574049] [2022-04-08 10:03:42,842 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:42,842 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:42,842 INFO L85 PathProgramCache]: Analyzing trace with hash 591649966, now seen corresponding path program 52 times [2022-04-08 10:03:42,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:42,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763026125] [2022-04-08 10:03:42,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:42,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:43,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:43,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {14737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14718#true} is VALID [2022-04-08 10:03:43,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {14718#true} assume true; {14718#true} is VALID [2022-04-08 10:03:43,098 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14718#true} {14718#true} #61#return; {14718#true} is VALID [2022-04-08 10:03:43,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {14718#true} call ULTIMATE.init(); {14737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:43,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {14737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14718#true} is VALID [2022-04-08 10:03:43,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {14718#true} assume true; {14718#true} is VALID [2022-04-08 10:03:43,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14718#true} {14718#true} #61#return; {14718#true} is VALID [2022-04-08 10:03:43,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {14718#true} call #t~ret11 := main(); {14718#true} is VALID [2022-04-08 10:03:43,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {14718#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14723#(= main_~y~0 0)} is VALID [2022-04-08 10:03:43,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {14723#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14724#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:43,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {14724#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14725#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:43,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {14725#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14726#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:43,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {14726#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14727#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:43,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {14727#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14728#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:43,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {14728#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14729#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:43,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {14729#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14730#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:43,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {14730#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14731#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:43,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {14731#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14732#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:43,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {14732#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14733#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:43,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {14733#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14734#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:43,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {14734#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {14734#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:43,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {14734#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {14735#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:03:43,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {14735#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14736#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:43,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {14736#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {14719#false} is VALID [2022-04-08 10:03:43,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {14719#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14719#false} is VALID [2022-04-08 10:03:43,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {14719#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14719#false} is VALID [2022-04-08 10:03:43,109 INFO L290 TraceCheckUtils]: 23: Hoare triple {14719#false} assume !(~y~0 % 4294967296 > 0); {14719#false} is VALID [2022-04-08 10:03:43,109 INFO L272 TraceCheckUtils]: 24: Hoare triple {14719#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14719#false} is VALID [2022-04-08 10:03:43,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {14719#false} ~cond := #in~cond; {14719#false} is VALID [2022-04-08 10:03:43,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {14719#false} assume 0 == ~cond; {14719#false} is VALID [2022-04-08 10:03:43,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {14719#false} assume !false; {14719#false} is VALID [2022-04-08 10:03:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:43,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:43,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763026125] [2022-04-08 10:03:43,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763026125] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:43,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779557099] [2022-04-08 10:03:43,110 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:43,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:43,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:43,111 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-08 10:03:43,113 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-08 10:03:43,165 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:43,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:43,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:03:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:43,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:43,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {14718#true} call ULTIMATE.init(); {14718#true} is VALID [2022-04-08 10:03:43,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {14718#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14718#true} is VALID [2022-04-08 10:03:43,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {14718#true} assume true; {14718#true} is VALID [2022-04-08 10:03:43,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14718#true} {14718#true} #61#return; {14718#true} is VALID [2022-04-08 10:03:43,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {14718#true} call #t~ret11 := main(); {14718#true} is VALID [2022-04-08 10:03:43,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {14718#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14723#(= main_~y~0 0)} is VALID [2022-04-08 10:03:43,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {14723#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14724#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:43,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {14724#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14725#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:43,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {14725#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14726#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:43,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {14726#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14727#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:43,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {14727#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14728#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:43,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {14728#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14729#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:43,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {14729#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14730#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:43,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {14730#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14731#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:43,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {14731#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14732#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:43,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {14732#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14733#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:43,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {14733#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14734#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:43,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {14734#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {14734#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:43,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {14734#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {14735#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:03:43,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {14735#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14798#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:03:43,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {14798#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {14719#false} is VALID [2022-04-08 10:03:43,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {14719#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14719#false} is VALID [2022-04-08 10:03:43,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {14719#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14719#false} is VALID [2022-04-08 10:03:43,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {14719#false} assume !(~y~0 % 4294967296 > 0); {14719#false} is VALID [2022-04-08 10:03:43,460 INFO L272 TraceCheckUtils]: 24: Hoare triple {14719#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14719#false} is VALID [2022-04-08 10:03:43,461 INFO L290 TraceCheckUtils]: 25: Hoare triple {14719#false} ~cond := #in~cond; {14719#false} is VALID [2022-04-08 10:03:43,461 INFO L290 TraceCheckUtils]: 26: Hoare triple {14719#false} assume 0 == ~cond; {14719#false} is VALID [2022-04-08 10:03:43,461 INFO L290 TraceCheckUtils]: 27: Hoare triple {14719#false} assume !false; {14719#false} is VALID [2022-04-08 10:03:43,461 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:43,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:43,824 INFO L290 TraceCheckUtils]: 27: Hoare triple {14719#false} assume !false; {14719#false} is VALID [2022-04-08 10:03:43,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {14719#false} assume 0 == ~cond; {14719#false} is VALID [2022-04-08 10:03:43,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {14719#false} ~cond := #in~cond; {14719#false} is VALID [2022-04-08 10:03:43,824 INFO L272 TraceCheckUtils]: 24: Hoare triple {14719#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14719#false} is VALID [2022-04-08 10:03:43,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {14719#false} assume !(~y~0 % 4294967296 > 0); {14719#false} is VALID [2022-04-08 10:03:43,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {14719#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14719#false} is VALID [2022-04-08 10:03:43,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {14719#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14719#false} is VALID [2022-04-08 10:03:43,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {14844#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {14719#false} is VALID [2022-04-08 10:03:43,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {14848#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14844#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:43,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {14852#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {14848#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:43,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {14852#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {14852#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:43,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {14859#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14852#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:43,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {14863#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14859#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:43,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {14867#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14863#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:43,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {14871#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14867#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:43,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {14875#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14871#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:43,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {14879#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14875#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:43,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {14883#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14879#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:43,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {14887#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14883#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:43,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {14891#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14887#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:43,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {14895#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14891#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:03:43,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {14899#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14895#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:03:43,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {14718#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14899#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:03:43,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {14718#true} call #t~ret11 := main(); {14718#true} is VALID [2022-04-08 10:03:43,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14718#true} {14718#true} #61#return; {14718#true} is VALID [2022-04-08 10:03:43,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {14718#true} assume true; {14718#true} is VALID [2022-04-08 10:03:43,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {14718#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14718#true} is VALID [2022-04-08 10:03:43,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {14718#true} call ULTIMATE.init(); {14718#true} is VALID [2022-04-08 10:03:43,852 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:43,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779557099] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:43,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:43,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-08 10:03:43,852 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:43,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [852574049] [2022-04-08 10:03:43,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [852574049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:43,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:43,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:03:43,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013843618] [2022-04-08 10:03:43,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:43,853 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 10:03:43,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:43,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:43,878 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-08 10:03:43,878 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:03:43,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:43,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:03:43,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:03:43,879 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:45,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:45,455 INFO L93 Difference]: Finished difference Result 119 states and 163 transitions. [2022-04-08 10:03:45,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:03:45,455 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 10:03:45,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 91 transitions. [2022-04-08 10:03:45,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:45,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 91 transitions. [2022-04-08 10:03:45,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 91 transitions. [2022-04-08 10:03:45,536 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-08 10:03:45,538 INFO L225 Difference]: With dead ends: 119 [2022-04-08 10:03:45,538 INFO L226 Difference]: Without dead ends: 111 [2022-04-08 10:03:45,539 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=463, Invalid=1699, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 10:03:45,539 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 67 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:45,539 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 101 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:03:45,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-08 10:03:45,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 84. [2022-04-08 10:03:45,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:45,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 84 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:45,738 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 84 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:45,738 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 84 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:45,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:45,740 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-08 10:03:45,740 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-08 10:03:45,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:45,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:45,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 111 states. [2022-04-08 10:03:45,741 INFO L87 Difference]: Start difference. First operand has 84 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 111 states. [2022-04-08 10:03:45,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:45,742 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-08 10:03:45,742 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-08 10:03:45,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:45,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:45,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:45,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:45,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:45,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2022-04-08 10:03:45,744 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 28 [2022-04-08 10:03:45,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:45,744 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2022-04-08 10:03:45,745 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:45,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 107 transitions. [2022-04-08 10:03:45,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2022-04-08 10:03:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:03:45,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:45,897 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:45,915 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-08 10:03:46,099 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:46,099 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:46,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:46,100 INFO L85 PathProgramCache]: Analyzing trace with hash 646714815, now seen corresponding path program 53 times [2022-04-08 10:03:46,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:46,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1508566213] [2022-04-08 10:03:46,102 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:46,102 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:46,102 INFO L85 PathProgramCache]: Analyzing trace with hash 646714815, now seen corresponding path program 54 times [2022-04-08 10:03:46,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:46,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771281848] [2022-04-08 10:03:46,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:46,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:46,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:46,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {15591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15578#true} is VALID [2022-04-08 10:03:46,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {15578#true} assume true; {15578#true} is VALID [2022-04-08 10:03:46,249 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15578#true} {15578#true} #61#return; {15578#true} is VALID [2022-04-08 10:03:46,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {15578#true} call ULTIMATE.init(); {15591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:46,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {15591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15578#true} is VALID [2022-04-08 10:03:46,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {15578#true} assume true; {15578#true} is VALID [2022-04-08 10:03:46,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15578#true} {15578#true} #61#return; {15578#true} is VALID [2022-04-08 10:03:46,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {15578#true} call #t~ret11 := main(); {15578#true} is VALID [2022-04-08 10:03:46,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {15578#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15578#true} is VALID [2022-04-08 10:03:46,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {15578#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15578#true} is VALID [2022-04-08 10:03:46,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {15578#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15578#true} is VALID [2022-04-08 10:03:46,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {15578#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15578#true} is VALID [2022-04-08 10:03:46,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {15578#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15578#true} is VALID [2022-04-08 10:03:46,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {15578#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15578#true} is VALID [2022-04-08 10:03:46,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {15578#true} assume !(~x~0 % 4294967296 > 0); {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:46,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:46,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15584#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:46,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {15584#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15585#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:46,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {15585#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15586#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:46,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {15586#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15587#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:46,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {15587#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:03:46,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:03:46,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15587#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:46,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {15587#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15586#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:46,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {15586#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15585#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:46,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {15585#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15584#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:46,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {15584#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:46,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:46,263 INFO L272 TraceCheckUtils]: 25: Hoare triple {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15589#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:03:46,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {15589#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {15590#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:03:46,263 INFO L290 TraceCheckUtils]: 27: Hoare triple {15590#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15579#false} is VALID [2022-04-08 10:03:46,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {15579#false} assume !false; {15579#false} is VALID [2022-04-08 10:03:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:03:46,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:46,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771281848] [2022-04-08 10:03:46,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771281848] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:46,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664242028] [2022-04-08 10:03:46,264 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:46,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:46,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:46,268 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-08 10:03:46,269 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-08 10:03:46,312 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:03:46,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:46,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 10:03:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:46,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:46,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {15578#true} call ULTIMATE.init(); {15578#true} is VALID [2022-04-08 10:03:46,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {15578#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15578#true} is VALID [2022-04-08 10:03:46,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {15578#true} assume true; {15578#true} is VALID [2022-04-08 10:03:46,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15578#true} {15578#true} #61#return; {15578#true} is VALID [2022-04-08 10:03:46,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {15578#true} call #t~ret11 := main(); {15578#true} is VALID [2022-04-08 10:03:46,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {15578#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15578#true} is VALID [2022-04-08 10:03:46,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {15578#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15578#true} is VALID [2022-04-08 10:03:46,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {15578#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15578#true} is VALID [2022-04-08 10:03:46,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {15578#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15578#true} is VALID [2022-04-08 10:03:46,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {15578#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15578#true} is VALID [2022-04-08 10:03:46,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {15578#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15578#true} is VALID [2022-04-08 10:03:46,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {15578#true} assume !(~x~0 % 4294967296 > 0); {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:46,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:46,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15584#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:46,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {15584#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15585#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:46,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {15585#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15586#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:46,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {15586#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15587#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:46,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {15587#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:03:46,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:03:46,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15587#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:46,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {15587#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15586#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:46,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {15586#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15585#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:46,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {15585#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15584#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:46,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {15584#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:46,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:46,554 INFO L272 TraceCheckUtils]: 25: Hoare triple {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15670#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:03:46,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {15670#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15674#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:03:46,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {15674#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15579#false} is VALID [2022-04-08 10:03:46,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {15579#false} assume !false; {15579#false} is VALID [2022-04-08 10:03:46,555 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:03:46,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:46,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {15579#false} assume !false; {15579#false} is VALID [2022-04-08 10:03:46,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {15674#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15579#false} is VALID [2022-04-08 10:03:46,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {15670#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15674#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:03:46,812 INFO L272 TraceCheckUtils]: 25: Hoare triple {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15670#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:03:46,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:46,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {15584#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:46,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {15585#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15584#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:46,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {15586#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15585#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:46,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {15587#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15586#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:46,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15587#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:46,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:03:46,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {15587#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:03:46,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {15586#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15587#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:46,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {15585#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15586#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:46,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {15584#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15585#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:46,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15584#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:46,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:46,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {15578#true} assume !(~x~0 % 4294967296 > 0); {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:46,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {15578#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15578#true} is VALID [2022-04-08 10:03:46,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {15578#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15578#true} is VALID [2022-04-08 10:03:46,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {15578#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15578#true} is VALID [2022-04-08 10:03:46,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {15578#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15578#true} is VALID [2022-04-08 10:03:46,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {15578#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15578#true} is VALID [2022-04-08 10:03:46,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {15578#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15578#true} is VALID [2022-04-08 10:03:46,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {15578#true} call #t~ret11 := main(); {15578#true} is VALID [2022-04-08 10:03:46,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15578#true} {15578#true} #61#return; {15578#true} is VALID [2022-04-08 10:03:46,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {15578#true} assume true; {15578#true} is VALID [2022-04-08 10:03:46,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {15578#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15578#true} is VALID [2022-04-08 10:03:46,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {15578#true} call ULTIMATE.init(); {15578#true} is VALID [2022-04-08 10:03:46,821 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:03:46,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664242028] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:46,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:46,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2022-04-08 10:03:46,822 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:46,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1508566213] [2022-04-08 10:03:46,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1508566213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:46,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:46,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:03:46,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360227090] [2022-04-08 10:03:46,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:46,822 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) 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 29 [2022-04-08 10:03:46,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:46,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.9090909090909092) 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-08 10:03:46,843 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-08 10:03:46,843 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:03:46,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:46,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:03:46,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:03:46,843 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) 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-08 10:03:47,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:47,907 INFO L93 Difference]: Finished difference Result 179 states and 231 transitions. [2022-04-08 10:03:47,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:03:47,908 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) 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 29 [2022-04-08 10:03:47,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:47,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) 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-08 10:03:47,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 47 transitions. [2022-04-08 10:03:47,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) 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-08 10:03:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 47 transitions. [2022-04-08 10:03:47,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 47 transitions. [2022-04-08 10:03:47,949 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-08 10:03:47,951 INFO L225 Difference]: With dead ends: 179 [2022-04-08 10:03:47,952 INFO L226 Difference]: Without dead ends: 168 [2022-04-08 10:03:47,952 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2022-04-08 10:03:47,952 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:47,953 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 68 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:03:47,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-04-08 10:03:48,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 88. [2022-04-08 10:03:48,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:48,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:48,144 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:48,144 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:48,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:48,146 INFO L93 Difference]: Finished difference Result 168 states and 219 transitions. [2022-04-08 10:03:48,146 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 219 transitions. [2022-04-08 10:03:48,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:48,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:48,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 168 states. [2022-04-08 10:03:48,147 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 168 states. [2022-04-08 10:03:48,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:48,150 INFO L93 Difference]: Finished difference Result 168 states and 219 transitions. [2022-04-08 10:03:48,150 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 219 transitions. [2022-04-08 10:03:48,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:48,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:48,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:48,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:48,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 113 transitions. [2022-04-08 10:03:48,152 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 113 transitions. Word has length 29 [2022-04-08 10:03:48,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:48,152 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 113 transitions. [2022-04-08 10:03:48,153 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) 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-08 10:03:48,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 113 transitions. [2022-04-08 10:03:48,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2022-04-08 10:03:48,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:03:48,351 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:48,351 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:48,378 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-08 10:03:48,571 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:48,571 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:48,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:48,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1573757487, now seen corresponding path program 55 times [2022-04-08 10:03:48,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:48,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [878589453] [2022-04-08 10:03:48,575 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:48,575 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:48,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1573757487, now seen corresponding path program 56 times [2022-04-08 10:03:48,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:48,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970126876] [2022-04-08 10:03:48,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:48,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:48,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:48,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {16669#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16653#true} is VALID [2022-04-08 10:03:48,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {16653#true} assume true; {16653#true} is VALID [2022-04-08 10:03:48,748 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16653#true} {16653#true} #61#return; {16653#true} is VALID [2022-04-08 10:03:48,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {16653#true} call ULTIMATE.init(); {16669#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:48,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {16669#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16653#true} is VALID [2022-04-08 10:03:48,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {16653#true} assume true; {16653#true} is VALID [2022-04-08 10:03:48,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16653#true} {16653#true} #61#return; {16653#true} is VALID [2022-04-08 10:03:48,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {16653#true} call #t~ret11 := main(); {16653#true} is VALID [2022-04-08 10:03:48,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {16653#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16658#(= main_~y~0 0)} is VALID [2022-04-08 10:03:48,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {16658#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16659#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:48,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {16659#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16660#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:48,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {16660#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16661#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:48,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {16661#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16662#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:48,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {16662#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16663#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:48,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {16663#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16664#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:48,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {16664#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {16664#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:48,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {16664#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {16665#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:48,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {16665#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16666#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:48,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {16666#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16667#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:48,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {16667#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16668#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:48,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {16668#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {16654#false} is VALID [2022-04-08 10:03:48,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-08 10:03:48,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-08 10:03:48,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-08 10:03:48,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-08 10:03:48,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-08 10:03:48,756 INFO L290 TraceCheckUtils]: 23: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-08 10:03:48,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {16654#false} assume !(~y~0 % 4294967296 > 0); {16654#false} is VALID [2022-04-08 10:03:48,756 INFO L272 TraceCheckUtils]: 25: Hoare triple {16654#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {16654#false} is VALID [2022-04-08 10:03:48,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {16654#false} ~cond := #in~cond; {16654#false} is VALID [2022-04-08 10:03:48,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {16654#false} assume 0 == ~cond; {16654#false} is VALID [2022-04-08 10:03:48,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {16654#false} assume !false; {16654#false} is VALID [2022-04-08 10:03:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:03:48,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:48,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970126876] [2022-04-08 10:03:48,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970126876] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:48,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382633049] [2022-04-08 10:03:48,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:48,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:48,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:48,760 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-08 10:03:48,782 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-08 10:03:48,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:48,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:48,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 10:03:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:48,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:49,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {16653#true} call ULTIMATE.init(); {16653#true} is VALID [2022-04-08 10:03:49,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {16653#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16653#true} is VALID [2022-04-08 10:03:49,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {16653#true} assume true; {16653#true} is VALID [2022-04-08 10:03:49,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16653#true} {16653#true} #61#return; {16653#true} is VALID [2022-04-08 10:03:49,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {16653#true} call #t~ret11 := main(); {16653#true} is VALID [2022-04-08 10:03:49,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {16653#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16658#(= main_~y~0 0)} is VALID [2022-04-08 10:03:49,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {16658#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16659#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:49,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {16659#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16660#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:49,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {16660#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16661#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:49,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {16661#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16662#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:49,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {16662#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16663#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:49,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {16663#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16664#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:49,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {16664#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {16664#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:49,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {16664#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {16712#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:49,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {16712#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16716#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:49,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {16716#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16720#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:49,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {16720#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16724#(and (<= main_~y~0 6) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:49,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {16724#(and (<= main_~y~0 6) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {16654#false} is VALID [2022-04-08 10:03:49,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-08 10:03:49,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-08 10:03:49,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-08 10:03:49,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-08 10:03:49,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-08 10:03:49,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-08 10:03:49,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {16654#false} assume !(~y~0 % 4294967296 > 0); {16654#false} is VALID [2022-04-08 10:03:49,016 INFO L272 TraceCheckUtils]: 25: Hoare triple {16654#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {16654#false} is VALID [2022-04-08 10:03:49,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {16654#false} ~cond := #in~cond; {16654#false} is VALID [2022-04-08 10:03:49,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {16654#false} assume 0 == ~cond; {16654#false} is VALID [2022-04-08 10:03:49,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {16654#false} assume !false; {16654#false} is VALID [2022-04-08 10:03:49,016 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:03:49,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:49,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {16654#false} assume !false; {16654#false} is VALID [2022-04-08 10:03:49,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {16654#false} assume 0 == ~cond; {16654#false} is VALID [2022-04-08 10:03:49,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {16654#false} ~cond := #in~cond; {16654#false} is VALID [2022-04-08 10:03:49,253 INFO L272 TraceCheckUtils]: 25: Hoare triple {16654#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {16654#false} is VALID [2022-04-08 10:03:49,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {16654#false} assume !(~y~0 % 4294967296 > 0); {16654#false} is VALID [2022-04-08 10:03:49,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-08 10:03:49,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-08 10:03:49,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {16782#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-08 10:03:49,255 INFO L290 TraceCheckUtils]: 20: Hoare triple {16786#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16782#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:49,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {16790#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16786#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:49,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {16794#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16790#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:03:49,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {16798#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {16794#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:03:49,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {16802#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16798#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-08 10:03:49,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {16806#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16802#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:49,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {16810#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16806#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-08 10:03:49,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {16653#true} ~z~0 := ~y~0; {16810#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:03:49,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {16653#true} assume !(~x~0 % 4294967296 > 0); {16653#true} is VALID [2022-04-08 10:03:49,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {16653#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16653#true} is VALID [2022-04-08 10:03:49,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {16653#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16653#true} is VALID [2022-04-08 10:03:49,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {16653#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16653#true} is VALID [2022-04-08 10:03:49,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {16653#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16653#true} is VALID [2022-04-08 10:03:49,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {16653#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16653#true} is VALID [2022-04-08 10:03:49,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {16653#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16653#true} is VALID [2022-04-08 10:03:49,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {16653#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16653#true} is VALID [2022-04-08 10:03:49,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {16653#true} call #t~ret11 := main(); {16653#true} is VALID [2022-04-08 10:03:49,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16653#true} {16653#true} #61#return; {16653#true} is VALID [2022-04-08 10:03:49,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {16653#true} assume true; {16653#true} is VALID [2022-04-08 10:03:49,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {16653#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16653#true} is VALID [2022-04-08 10:03:49,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {16653#true} call ULTIMATE.init(); {16653#true} is VALID [2022-04-08 10:03:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 10:03:49,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382633049] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:49,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:49,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 26 [2022-04-08 10:03:49,262 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:49,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [878589453] [2022-04-08 10:03:49,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [878589453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:49,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:49,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:03:49,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862800918] [2022-04-08 10:03:49,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:49,262 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 10:03:49,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:49,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:49,278 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-08 10:03:49,278 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:03:49,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:49,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:03:49,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:03:49,279 INFO L87 Difference]: Start difference. First operand 88 states and 113 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:50,173 INFO L93 Difference]: Finished difference Result 109 states and 134 transitions. [2022-04-08 10:03:50,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:03:50,173 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 10:03:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:50,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:50,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2022-04-08 10:03:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:50,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2022-04-08 10:03:50,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 54 transitions. [2022-04-08 10:03:50,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:50,216 INFO L225 Difference]: With dead ends: 109 [2022-04-08 10:03:50,216 INFO L226 Difference]: Without dead ends: 97 [2022-04-08 10:03:50,217 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:03:50,217 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:50,217 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 65 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:03:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-08 10:03:50,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2022-04-08 10:03:50,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:50,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:50,429 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:50,429 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:50,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:50,430 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2022-04-08 10:03:50,430 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 122 transitions. [2022-04-08 10:03:50,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:50,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:50,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-08 10:03:50,431 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-08 10:03:50,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:50,432 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2022-04-08 10:03:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 122 transitions. [2022-04-08 10:03:50,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:50,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:50,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:50,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2022-04-08 10:03:50,434 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 29 [2022-04-08 10:03:50,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:50,434 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2022-04-08 10:03:50,435 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:50,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 114 transitions. [2022-04-08 10:03:50,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:50,600 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2022-04-08 10:03:50,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:03:50,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:50,601 INFO L499 BasicCegarLoop]: trace histogram [12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:50,617 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-08 10:03:50,801 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,SelfDestructingSolverStorable32 [2022-04-08 10:03:50,801 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:50,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:50,801 INFO L85 PathProgramCache]: Analyzing trace with hash 617728591, now seen corresponding path program 57 times [2022-04-08 10:03:50,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:50,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1500969930] [2022-04-08 10:03:50,805 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:50,805 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:50,805 INFO L85 PathProgramCache]: Analyzing trace with hash 617728591, now seen corresponding path program 58 times [2022-04-08 10:03:50,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:50,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827709587] [2022-04-08 10:03:50,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:50,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:51,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:51,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {17493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17473#true} is VALID [2022-04-08 10:03:51,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {17473#true} assume true; {17473#true} is VALID [2022-04-08 10:03:51,040 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17473#true} {17473#true} #61#return; {17473#true} is VALID [2022-04-08 10:03:51,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {17473#true} call ULTIMATE.init(); {17493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:51,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {17493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17473#true} is VALID [2022-04-08 10:03:51,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {17473#true} assume true; {17473#true} is VALID [2022-04-08 10:03:51,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17473#true} {17473#true} #61#return; {17473#true} is VALID [2022-04-08 10:03:51,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {17473#true} call #t~ret11 := main(); {17473#true} is VALID [2022-04-08 10:03:51,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {17473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17478#(= main_~y~0 0)} is VALID [2022-04-08 10:03:51,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {17478#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17479#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:51,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {17479#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17480#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:51,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {17480#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:51,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {17481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17482#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:51,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {17482#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17483#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:51,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {17483#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17484#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:51,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {17484#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:51,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {17485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17486#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:51,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {17486#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17487#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:51,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {17487#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17488#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:51,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {17488#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17489#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:51,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {17489#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17490#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:51,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {17490#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {17490#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:51,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {17490#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {17491#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:03:51,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {17491#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17492#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-08 10:03:51,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {17492#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {17474#false} is VALID [2022-04-08 10:03:51,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {17474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17474#false} is VALID [2022-04-08 10:03:51,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {17474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17474#false} is VALID [2022-04-08 10:03:51,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {17474#false} assume !(~y~0 % 4294967296 > 0); {17474#false} is VALID [2022-04-08 10:03:51,049 INFO L272 TraceCheckUtils]: 25: Hoare triple {17474#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {17474#false} is VALID [2022-04-08 10:03:51,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {17474#false} ~cond := #in~cond; {17474#false} is VALID [2022-04-08 10:03:51,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {17474#false} assume 0 == ~cond; {17474#false} is VALID [2022-04-08 10:03:51,049 INFO L290 TraceCheckUtils]: 28: Hoare triple {17474#false} assume !false; {17474#false} is VALID [2022-04-08 10:03:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:51,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:51,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827709587] [2022-04-08 10:03:51,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827709587] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:51,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035931531] [2022-04-08 10:03:51,050 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:51,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:51,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:51,052 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-08 10:03:51,063 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-08 10:03:51,104 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:51,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:51,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:03:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:51,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:51,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {17473#true} call ULTIMATE.init(); {17473#true} is VALID [2022-04-08 10:03:51,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {17473#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17473#true} is VALID [2022-04-08 10:03:51,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {17473#true} assume true; {17473#true} is VALID [2022-04-08 10:03:51,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17473#true} {17473#true} #61#return; {17473#true} is VALID [2022-04-08 10:03:51,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {17473#true} call #t~ret11 := main(); {17473#true} is VALID [2022-04-08 10:03:51,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {17473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17478#(= main_~y~0 0)} is VALID [2022-04-08 10:03:51,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {17478#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17479#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:51,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {17479#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17480#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:51,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {17480#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:51,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {17481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17482#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:51,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {17482#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17483#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:51,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {17483#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17484#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:51,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {17484#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:51,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {17485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17486#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:51,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {17486#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17487#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:51,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {17487#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17488#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:51,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {17488#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17489#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:51,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {17489#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17490#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:51,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {17490#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {17490#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:51,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {17490#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {17491#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:03:51,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {17491#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17557#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:03:51,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {17557#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {17474#false} is VALID [2022-04-08 10:03:51,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {17474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17474#false} is VALID [2022-04-08 10:03:51,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {17474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17474#false} is VALID [2022-04-08 10:03:51,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {17474#false} assume !(~y~0 % 4294967296 > 0); {17474#false} is VALID [2022-04-08 10:03:51,401 INFO L272 TraceCheckUtils]: 25: Hoare triple {17474#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {17474#false} is VALID [2022-04-08 10:03:51,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {17474#false} ~cond := #in~cond; {17474#false} is VALID [2022-04-08 10:03:51,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {17474#false} assume 0 == ~cond; {17474#false} is VALID [2022-04-08 10:03:51,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {17474#false} assume !false; {17474#false} is VALID [2022-04-08 10:03:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:51,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:51,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {17474#false} assume !false; {17474#false} is VALID [2022-04-08 10:03:51,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {17474#false} assume 0 == ~cond; {17474#false} is VALID [2022-04-08 10:03:51,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {17474#false} ~cond := #in~cond; {17474#false} is VALID [2022-04-08 10:03:51,799 INFO L272 TraceCheckUtils]: 25: Hoare triple {17474#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {17474#false} is VALID [2022-04-08 10:03:51,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {17474#false} assume !(~y~0 % 4294967296 > 0); {17474#false} is VALID [2022-04-08 10:03:51,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {17474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17474#false} is VALID [2022-04-08 10:03:51,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {17474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17474#false} is VALID [2022-04-08 10:03:51,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {17603#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17474#false} is VALID [2022-04-08 10:03:51,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {17607#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17603#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:51,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {17611#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {17607#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:51,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {17611#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {17611#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:51,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {17618#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17611#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:51,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {17622#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17618#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:51,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {17626#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17622#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:51,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {17630#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17626#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:51,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {17634#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17630#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:51,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {17638#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17634#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:51,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {17642#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17638#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:51,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {17646#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17642#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:51,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {17650#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17646#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:51,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {17654#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17650#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:03:51,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {17658#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17654#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:03:51,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {17662#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17658#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:03:51,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {17473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17662#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:03:51,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {17473#true} call #t~ret11 := main(); {17473#true} is VALID [2022-04-08 10:03:51,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17473#true} {17473#true} #61#return; {17473#true} is VALID [2022-04-08 10:03:51,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {17473#true} assume true; {17473#true} is VALID [2022-04-08 10:03:51,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {17473#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17473#true} is VALID [2022-04-08 10:03:51,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {17473#true} call ULTIMATE.init(); {17473#true} is VALID [2022-04-08 10:03:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:51,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035931531] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:51,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:51,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-08 10:03:51,810 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:51,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1500969930] [2022-04-08 10:03:51,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1500969930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:51,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:51,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:03:51,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36225956] [2022-04-08 10:03:51,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:51,810 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 10:03:51,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:51,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:51,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:51,828 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:03:51,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:51,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:03:51,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=882, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:03:51,829 INFO L87 Difference]: Start difference. First operand 89 states and 114 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:53,544 INFO L93 Difference]: Finished difference Result 138 states and 192 transitions. [2022-04-08 10:03:53,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:03:53,545 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 10:03:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 98 transitions. [2022-04-08 10:03:53,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 98 transitions. [2022-04-08 10:03:53,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 98 transitions. [2022-04-08 10:03:53,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:53,624 INFO L225 Difference]: With dead ends: 138 [2022-04-08 10:03:53,624 INFO L226 Difference]: Without dead ends: 130 [2022-04-08 10:03:53,624 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=524, Invalid=1926, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:03:53,625 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 75 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:53,625 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 104 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:03:53,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-08 10:03:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 95. [2022-04-08 10:03:53,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:53,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:53,842 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:53,842 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:53,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:53,843 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2022-04-08 10:03:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-08 10:03:53,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:53,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:53,844 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 130 states. [2022-04-08 10:03:53,844 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 130 states. [2022-04-08 10:03:53,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:53,846 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2022-04-08 10:03:53,846 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-08 10:03:53,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:53,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:53,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:53,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:53,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 122 transitions. [2022-04-08 10:03:53,847 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 122 transitions. Word has length 29 [2022-04-08 10:03:53,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:53,847 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 122 transitions. [2022-04-08 10:03:53,847 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:53,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 122 transitions. [2022-04-08 10:03:54,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:54,019 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2022-04-08 10:03:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:03:54,020 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:54,020 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:54,036 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-08 10:03:54,223 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:54,223 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:54,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:54,224 INFO L85 PathProgramCache]: Analyzing trace with hash 751514495, now seen corresponding path program 59 times [2022-04-08 10:03:54,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:54,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1479959116] [2022-04-08 10:03:54,226 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:54,226 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:54,226 INFO L85 PathProgramCache]: Analyzing trace with hash 751514495, now seen corresponding path program 60 times [2022-04-08 10:03:54,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:54,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96422066] [2022-04-08 10:03:54,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:54,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:54,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:54,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {18458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18441#true} is VALID [2022-04-08 10:03:54,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {18441#true} assume true; {18441#true} is VALID [2022-04-08 10:03:54,432 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18441#true} {18441#true} #61#return; {18441#true} is VALID [2022-04-08 10:03:54,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {18441#true} call ULTIMATE.init(); {18458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:54,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {18458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18441#true} is VALID [2022-04-08 10:03:54,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {18441#true} assume true; {18441#true} is VALID [2022-04-08 10:03:54,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18441#true} {18441#true} #61#return; {18441#true} is VALID [2022-04-08 10:03:54,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {18441#true} call #t~ret11 := main(); {18441#true} is VALID [2022-04-08 10:03:54,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {18441#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18446#(= main_~y~0 0)} is VALID [2022-04-08 10:03:54,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {18446#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18447#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:54,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {18447#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18448#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:54,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {18448#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18449#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:54,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {18449#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18450#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:54,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {18450#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18451#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:54,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {18451#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {18451#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:54,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {18451#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {18452#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:54,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {18452#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18453#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:54,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {18453#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18454#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:54,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {18454#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18455#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:54,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {18455#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18456#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:54,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {18456#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18457#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:03:54,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {18457#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18442#false} is VALID [2022-04-08 10:03:54,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {18442#false} assume !(~z~0 % 4294967296 > 0); {18442#false} is VALID [2022-04-08 10:03:54,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {18442#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18442#false} is VALID [2022-04-08 10:03:54,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {18442#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18442#false} is VALID [2022-04-08 10:03:54,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {18442#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18442#false} is VALID [2022-04-08 10:03:54,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {18442#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18442#false} is VALID [2022-04-08 10:03:54,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {18442#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18442#false} is VALID [2022-04-08 10:03:54,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {18442#false} assume !(~y~0 % 4294967296 > 0); {18442#false} is VALID [2022-04-08 10:03:54,442 INFO L272 TraceCheckUtils]: 26: Hoare triple {18442#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {18442#false} is VALID [2022-04-08 10:03:54,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {18442#false} ~cond := #in~cond; {18442#false} is VALID [2022-04-08 10:03:54,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {18442#false} assume 0 == ~cond; {18442#false} is VALID [2022-04-08 10:03:54,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {18442#false} assume !false; {18442#false} is VALID [2022-04-08 10:03:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:03:54,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:54,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96422066] [2022-04-08 10:03:54,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96422066] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:54,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068318689] [2022-04-08 10:03:54,443 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:54,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:54,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:54,448 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-08 10:03:54,449 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-08 10:03:54,500 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:03:54,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:54,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 10:03:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:54,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:54,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {18441#true} call ULTIMATE.init(); {18441#true} is VALID [2022-04-08 10:03:54,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {18441#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18441#true} is VALID [2022-04-08 10:03:54,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {18441#true} assume true; {18441#true} is VALID [2022-04-08 10:03:54,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18441#true} {18441#true} #61#return; {18441#true} is VALID [2022-04-08 10:03:54,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {18441#true} call #t~ret11 := main(); {18441#true} is VALID [2022-04-08 10:03:54,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {18441#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18446#(= main_~y~0 0)} is VALID [2022-04-08 10:03:54,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {18446#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18447#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:54,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {18447#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18448#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:54,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {18448#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18449#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:54,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {18449#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18450#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:54,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {18450#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18451#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:54,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {18451#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {18451#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:54,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {18451#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {18498#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:54,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {18498#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18502#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:54,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {18502#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18506#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:54,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {18506#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18510#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:54,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {18510#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18514#(and (<= 5 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:54,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {18514#(and (<= 5 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18518#(and (<= 5 main_~y~0) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:54,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {18518#(and (<= 5 main_~y~0) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18442#false} is VALID [2022-04-08 10:03:54,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {18442#false} assume !(~z~0 % 4294967296 > 0); {18442#false} is VALID [2022-04-08 10:03:54,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {18442#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18442#false} is VALID [2022-04-08 10:03:54,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {18442#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18442#false} is VALID [2022-04-08 10:03:54,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {18442#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18442#false} is VALID [2022-04-08 10:03:54,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {18442#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18442#false} is VALID [2022-04-08 10:03:54,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {18442#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18442#false} is VALID [2022-04-08 10:03:54,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {18442#false} assume !(~y~0 % 4294967296 > 0); {18442#false} is VALID [2022-04-08 10:03:54,766 INFO L272 TraceCheckUtils]: 26: Hoare triple {18442#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {18442#false} is VALID [2022-04-08 10:03:54,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {18442#false} ~cond := #in~cond; {18442#false} is VALID [2022-04-08 10:03:54,766 INFO L290 TraceCheckUtils]: 28: Hoare triple {18442#false} assume 0 == ~cond; {18442#false} is VALID [2022-04-08 10:03:54,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {18442#false} assume !false; {18442#false} is VALID [2022-04-08 10:03:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:03:54,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:55,118 INFO L290 TraceCheckUtils]: 29: Hoare triple {18442#false} assume !false; {18442#false} is VALID [2022-04-08 10:03:55,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {18442#false} assume 0 == ~cond; {18442#false} is VALID [2022-04-08 10:03:55,118 INFO L290 TraceCheckUtils]: 27: Hoare triple {18442#false} ~cond := #in~cond; {18442#false} is VALID [2022-04-08 10:03:55,118 INFO L272 TraceCheckUtils]: 26: Hoare triple {18442#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {18442#false} is VALID [2022-04-08 10:03:55,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {18567#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {18442#false} is VALID [2022-04-08 10:03:55,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {18571#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18567#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:55,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {18575#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18571#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:55,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {18579#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18575#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:55,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {18583#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18579#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:55,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {18587#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18583#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:55,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {18587#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {18587#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:55,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {18594#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18587#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:55,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {18598#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18594#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-08 10:03:55,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {18602#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18598#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:03:55,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {18606#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18602#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:03:55,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {18610#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18606#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:03:55,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {18614#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18610#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:03:55,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {18441#true} ~z~0 := ~y~0; {18614#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:03:55,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {18441#true} assume !(~x~0 % 4294967296 > 0); {18441#true} is VALID [2022-04-08 10:03:55,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {18441#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18441#true} is VALID [2022-04-08 10:03:55,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {18441#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18441#true} is VALID [2022-04-08 10:03:55,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {18441#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18441#true} is VALID [2022-04-08 10:03:55,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {18441#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18441#true} is VALID [2022-04-08 10:03:55,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {18441#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18441#true} is VALID [2022-04-08 10:03:55,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {18441#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18441#true} is VALID [2022-04-08 10:03:55,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {18441#true} call #t~ret11 := main(); {18441#true} is VALID [2022-04-08 10:03:55,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18441#true} {18441#true} #61#return; {18441#true} is VALID [2022-04-08 10:03:55,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {18441#true} assume true; {18441#true} is VALID [2022-04-08 10:03:55,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {18441#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18441#true} is VALID [2022-04-08 10:03:55,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {18441#true} call ULTIMATE.init(); {18441#true} is VALID [2022-04-08 10:03:55,128 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:03:55,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068318689] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:55,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:55,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 33 [2022-04-08 10:03:55,128 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:55,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1479959116] [2022-04-08 10:03:55,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1479959116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:55,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:55,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:03:55,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093208829] [2022-04-08 10:03:55,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:55,129 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 10:03:55,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:55,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:55,146 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-08 10:03:55,146 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:03:55,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:55,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:03:55,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 10:03:55,147 INFO L87 Difference]: Start difference. First operand 95 states and 122 transitions. Second operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:55,898 INFO L93 Difference]: Finished difference Result 106 states and 132 transitions. [2022-04-08 10:03:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:03:55,898 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 10:03:55,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:55,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 39 transitions. [2022-04-08 10:03:55,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 39 transitions. [2022-04-08 10:03:55,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 39 transitions. [2022-04-08 10:03:55,932 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-08 10:03:55,933 INFO L225 Difference]: With dead ends: 106 [2022-04-08 10:03:55,933 INFO L226 Difference]: Without dead ends: 87 [2022-04-08 10:03:55,933 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=345, Invalid=1635, Unknown=0, NotChecked=0, Total=1980 [2022-04-08 10:03:55,934 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:55,934 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 76 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:03:55,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-08 10:03:56,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-04-08 10:03:56,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:56,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:56,121 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:56,121 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:56,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:56,122 INFO L93 Difference]: Finished difference Result 87 states and 112 transitions. [2022-04-08 10:03:56,122 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2022-04-08 10:03:56,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:56,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:56,122 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-08 10:03:56,123 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-08 10:03:56,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:56,124 INFO L93 Difference]: Finished difference Result 87 states and 112 transitions. [2022-04-08 10:03:56,124 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2022-04-08 10:03:56,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:56,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:56,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:56,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:56,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:56,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2022-04-08 10:03:56,125 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 30 [2022-04-08 10:03:56,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:56,126 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2022-04-08 10:03:56,126 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:56,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 112 transitions. [2022-04-08 10:03:56,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:56,296 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2022-04-08 10:03:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:03:56,296 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:56,296 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:56,320 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-08 10:03:56,515 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:56,515 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:56,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:56,516 INFO L85 PathProgramCache]: Analyzing trace with hash -688544435, now seen corresponding path program 61 times [2022-04-08 10:03:56,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:56,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [57715492] [2022-04-08 10:03:56,518 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:56,518 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:56,518 INFO L85 PathProgramCache]: Analyzing trace with hash -688544435, now seen corresponding path program 62 times [2022-04-08 10:03:56,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:56,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942395018] [2022-04-08 10:03:56,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:56,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:56,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:56,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {19257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19240#true} is VALID [2022-04-08 10:03:56,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {19240#true} assume true; {19240#true} is VALID [2022-04-08 10:03:56,709 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19240#true} {19240#true} #61#return; {19240#true} is VALID [2022-04-08 10:03:56,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {19240#true} call ULTIMATE.init(); {19257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:56,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {19257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19240#true} is VALID [2022-04-08 10:03:56,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {19240#true} assume true; {19240#true} is VALID [2022-04-08 10:03:56,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19240#true} {19240#true} #61#return; {19240#true} is VALID [2022-04-08 10:03:56,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {19240#true} call #t~ret11 := main(); {19240#true} is VALID [2022-04-08 10:03:56,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {19240#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19245#(= main_~y~0 0)} is VALID [2022-04-08 10:03:56,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {19245#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19246#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:56,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {19246#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19247#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:56,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {19247#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19248#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:56,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {19248#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19249#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:56,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {19249#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19250#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:56,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {19250#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19251#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:56,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {19251#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {19251#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:56,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {19251#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {19252#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:56,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {19252#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19253#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:56,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {19253#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19254#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:56,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {19254#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19255#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:56,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {19255#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19256#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:56,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {19256#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {19241#false} is VALID [2022-04-08 10:03:56,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-08 10:03:56,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-08 10:03:56,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-08 10:03:56,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-08 10:03:56,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-08 10:03:56,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-08 10:03:56,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {19241#false} assume !(~y~0 % 4294967296 > 0); {19241#false} is VALID [2022-04-08 10:03:56,719 INFO L272 TraceCheckUtils]: 26: Hoare triple {19241#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {19241#false} is VALID [2022-04-08 10:03:56,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {19241#false} ~cond := #in~cond; {19241#false} is VALID [2022-04-08 10:03:56,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {19241#false} assume 0 == ~cond; {19241#false} is VALID [2022-04-08 10:03:56,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {19241#false} assume !false; {19241#false} is VALID [2022-04-08 10:03:56,720 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:03:56,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:56,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942395018] [2022-04-08 10:03:56,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942395018] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:56,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57967931] [2022-04-08 10:03:56,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:56,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:56,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:56,724 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-08 10:03:56,747 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-08 10:03:56,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:56,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:56,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-08 10:03:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:56,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:57,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {19240#true} call ULTIMATE.init(); {19240#true} is VALID [2022-04-08 10:03:57,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {19240#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19240#true} is VALID [2022-04-08 10:03:57,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {19240#true} assume true; {19240#true} is VALID [2022-04-08 10:03:57,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19240#true} {19240#true} #61#return; {19240#true} is VALID [2022-04-08 10:03:57,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {19240#true} call #t~ret11 := main(); {19240#true} is VALID [2022-04-08 10:03:57,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {19240#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19245#(= main_~y~0 0)} is VALID [2022-04-08 10:03:57,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {19245#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19246#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:57,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {19246#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19247#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:57,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {19247#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19248#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:57,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {19248#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19249#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:57,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {19249#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19250#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:57,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {19250#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19251#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:57,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {19251#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {19251#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:57,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {19251#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {19300#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:57,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {19300#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19304#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:57,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {19304#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19308#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:57,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {19308#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19312#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:57,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {19312#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19316#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-08 10:03:57,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {19316#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !(~z~0 % 4294967296 > 0); {19241#false} is VALID [2022-04-08 10:03:57,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-08 10:03:57,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-08 10:03:57,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-08 10:03:57,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-08 10:03:57,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-08 10:03:57,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-08 10:03:57,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {19241#false} assume !(~y~0 % 4294967296 > 0); {19241#false} is VALID [2022-04-08 10:03:57,033 INFO L272 TraceCheckUtils]: 26: Hoare triple {19241#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {19241#false} is VALID [2022-04-08 10:03:57,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {19241#false} ~cond := #in~cond; {19241#false} is VALID [2022-04-08 10:03:57,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {19241#false} assume 0 == ~cond; {19241#false} is VALID [2022-04-08 10:03:57,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {19241#false} assume !false; {19241#false} is VALID [2022-04-08 10:03:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:03:57,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:57,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {19241#false} assume !false; {19241#false} is VALID [2022-04-08 10:03:57,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {19241#false} assume 0 == ~cond; {19241#false} is VALID [2022-04-08 10:03:57,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {19241#false} ~cond := #in~cond; {19241#false} is VALID [2022-04-08 10:03:57,316 INFO L272 TraceCheckUtils]: 26: Hoare triple {19241#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {19241#false} is VALID [2022-04-08 10:03:57,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {19241#false} assume !(~y~0 % 4294967296 > 0); {19241#false} is VALID [2022-04-08 10:03:57,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-08 10:03:57,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {19371#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-08 10:03:57,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {19375#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19371#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:57,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {19379#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19375#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:57,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {19383#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19379#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:03:57,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {19387#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19383#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:03:57,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {19391#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {19387#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:03:57,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {19395#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19391#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:03:57,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {19399#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19395#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:03:57,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {19403#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19399#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:03:57,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {19407#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19403#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:03:57,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {19240#true} ~z~0 := ~y~0; {19407#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:03:57,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {19240#true} assume !(~x~0 % 4294967296 > 0); {19240#true} is VALID [2022-04-08 10:03:57,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {19240#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19240#true} is VALID [2022-04-08 10:03:57,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {19240#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19240#true} is VALID [2022-04-08 10:03:57,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {19240#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19240#true} is VALID [2022-04-08 10:03:57,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {19240#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19240#true} is VALID [2022-04-08 10:03:57,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {19240#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19240#true} is VALID [2022-04-08 10:03:57,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {19240#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19240#true} is VALID [2022-04-08 10:03:57,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {19240#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19240#true} is VALID [2022-04-08 10:03:57,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {19240#true} call #t~ret11 := main(); {19240#true} is VALID [2022-04-08 10:03:57,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19240#true} {19240#true} #61#return; {19240#true} is VALID [2022-04-08 10:03:57,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {19240#true} assume true; {19240#true} is VALID [2022-04-08 10:03:57,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {19240#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19240#true} is VALID [2022-04-08 10:03:57,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {19240#true} call ULTIMATE.init(); {19240#true} is VALID [2022-04-08 10:03:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-08 10:03:57,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57967931] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:57,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:57,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 12] total 30 [2022-04-08 10:03:57,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:57,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [57715492] [2022-04-08 10:03:57,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [57715492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:57,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:57,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:03:57,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097442040] [2022-04-08 10:03:57,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:57,326 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 10:03:57,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:57,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:57,345 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-08 10:03:57,345 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:03:57,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:57,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:03:57,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:03:57,345 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:58,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:58,289 INFO L93 Difference]: Finished difference Result 108 states and 133 transitions. [2022-04-08 10:03:58,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:03:58,289 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 10:03:58,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:58,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:58,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 48 transitions. [2022-04-08 10:03:58,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:58,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 48 transitions. [2022-04-08 10:03:58,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 48 transitions. [2022-04-08 10:03:58,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:58,331 INFO L225 Difference]: With dead ends: 108 [2022-04-08 10:03:58,331 INFO L226 Difference]: Without dead ends: 96 [2022-04-08 10:03:58,331 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=1490, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:03:58,332 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:58,332 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:03:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-08 10:03:58,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2022-04-08 10:03:58,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:58,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:58,525 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:58,526 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:58,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:58,527 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-04-08 10:03:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2022-04-08 10:03:58,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:58,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:58,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states. [2022-04-08 10:03:58,527 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states. [2022-04-08 10:03:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:58,529 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-04-08 10:03:58,529 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2022-04-08 10:03:58,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:58,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:58,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:58,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:58,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 113 transitions. [2022-04-08 10:03:58,530 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 113 transitions. Word has length 30 [2022-04-08 10:03:58,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:58,531 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 113 transitions. [2022-04-08 10:03:58,531 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:58,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 113 transitions. [2022-04-08 10:03:58,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2022-04-08 10:03:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:03:58,695 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:58,695 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:58,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-08 10:03:58,895 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,SelfDestructingSolverStorable35 [2022-04-08 10:03:58,896 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:58,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:58,896 INFO L85 PathProgramCache]: Analyzing trace with hash 352108927, now seen corresponding path program 63 times [2022-04-08 10:03:58,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:58,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1159101983] [2022-04-08 10:03:58,898 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:58,898 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:58,898 INFO L85 PathProgramCache]: Analyzing trace with hash 352108927, now seen corresponding path program 64 times [2022-04-08 10:03:58,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:58,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99645169] [2022-04-08 10:03:58,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:58,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:59,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:59,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {20076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20060#true} is VALID [2022-04-08 10:03:59,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {20060#true} assume true; {20060#true} is VALID [2022-04-08 10:03:59,083 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20060#true} {20060#true} #61#return; {20060#true} is VALID [2022-04-08 10:03:59,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {20060#true} call ULTIMATE.init(); {20076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:59,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {20076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20060#true} is VALID [2022-04-08 10:03:59,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {20060#true} assume true; {20060#true} is VALID [2022-04-08 10:03:59,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20060#true} {20060#true} #61#return; {20060#true} is VALID [2022-04-08 10:03:59,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {20060#true} call #t~ret11 := main(); {20060#true} is VALID [2022-04-08 10:03:59,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {20060#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20065#(= main_~y~0 0)} is VALID [2022-04-08 10:03:59,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {20065#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20066#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:59,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {20066#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20067#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:59,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {20067#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20068#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:59,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {20068#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20069#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:59,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {20069#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20070#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:59,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {20070#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20071#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:59,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {20071#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20072#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:59,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {20072#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {20072#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:59,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {20072#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {20073#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:03:59,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {20073#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20074#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:59,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {20074#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20075#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:59,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {20075#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {20061#false} is VALID [2022-04-08 10:03:59,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-08 10:03:59,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-08 10:03:59,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-08 10:03:59,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-08 10:03:59,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-08 10:03:59,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-08 10:03:59,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-08 10:03:59,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {20061#false} assume !(~y~0 % 4294967296 > 0); {20061#false} is VALID [2022-04-08 10:03:59,092 INFO L272 TraceCheckUtils]: 26: Hoare triple {20061#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20061#false} is VALID [2022-04-08 10:03:59,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {20061#false} ~cond := #in~cond; {20061#false} is VALID [2022-04-08 10:03:59,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {20061#false} assume 0 == ~cond; {20061#false} is VALID [2022-04-08 10:03:59,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {20061#false} assume !false; {20061#false} is VALID [2022-04-08 10:03:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:03:59,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:59,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99645169] [2022-04-08 10:03:59,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99645169] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:59,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163550783] [2022-04-08 10:03:59,093 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:59,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:59,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:59,094 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-08 10:03:59,113 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-08 10:03:59,141 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:59,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:59,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:03:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:59,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:59,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {20060#true} call ULTIMATE.init(); {20060#true} is VALID [2022-04-08 10:03:59,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {20060#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20060#true} is VALID [2022-04-08 10:03:59,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {20060#true} assume true; {20060#true} is VALID [2022-04-08 10:03:59,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20060#true} {20060#true} #61#return; {20060#true} is VALID [2022-04-08 10:03:59,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {20060#true} call #t~ret11 := main(); {20060#true} is VALID [2022-04-08 10:03:59,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {20060#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20065#(= main_~y~0 0)} is VALID [2022-04-08 10:03:59,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {20065#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20066#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:59,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {20066#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20067#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:59,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {20067#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20068#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:59,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {20068#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20069#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:59,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {20069#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20070#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:59,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {20070#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20071#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:59,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {20071#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20072#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:59,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {20072#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {20072#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:59,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {20072#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {20073#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:03:59,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {20073#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20074#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:59,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {20074#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20128#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:59,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {20128#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {20061#false} is VALID [2022-04-08 10:03:59,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-08 10:03:59,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-08 10:03:59,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-08 10:03:59,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-08 10:03:59,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-08 10:03:59,366 INFO L290 TraceCheckUtils]: 23: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-08 10:03:59,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-08 10:03:59,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {20061#false} assume !(~y~0 % 4294967296 > 0); {20061#false} is VALID [2022-04-08 10:03:59,366 INFO L272 TraceCheckUtils]: 26: Hoare triple {20061#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20061#false} is VALID [2022-04-08 10:03:59,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {20061#false} ~cond := #in~cond; {20061#false} is VALID [2022-04-08 10:03:59,366 INFO L290 TraceCheckUtils]: 28: Hoare triple {20061#false} assume 0 == ~cond; {20061#false} is VALID [2022-04-08 10:03:59,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {20061#false} assume !false; {20061#false} is VALID [2022-04-08 10:03:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:03:59,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:59,624 INFO L290 TraceCheckUtils]: 29: Hoare triple {20061#false} assume !false; {20061#false} is VALID [2022-04-08 10:03:59,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {20061#false} assume 0 == ~cond; {20061#false} is VALID [2022-04-08 10:03:59,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {20061#false} ~cond := #in~cond; {20061#false} is VALID [2022-04-08 10:03:59,625 INFO L272 TraceCheckUtils]: 26: Hoare triple {20061#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20061#false} is VALID [2022-04-08 10:03:59,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {20061#false} assume !(~y~0 % 4294967296 > 0); {20061#false} is VALID [2022-04-08 10:03:59,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-08 10:03:59,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-08 10:03:59,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-08 10:03:59,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-08 10:03:59,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-08 10:03:59,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-08 10:03:59,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-08 10:03:59,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {20204#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {20061#false} is VALID [2022-04-08 10:03:59,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {20208#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20204#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:59,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {20212#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20208#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:59,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {20216#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {20212#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:59,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {20216#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {20216#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:59,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {20223#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20216#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:59,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {20227#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20223#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:59,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {20231#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20227#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:59,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {20235#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20231#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:59,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {20239#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20235#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:59,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {20243#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20239#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:59,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {20247#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20243#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:59,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {20060#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20247#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:59,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {20060#true} call #t~ret11 := main(); {20060#true} is VALID [2022-04-08 10:03:59,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20060#true} {20060#true} #61#return; {20060#true} is VALID [2022-04-08 10:03:59,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {20060#true} assume true; {20060#true} is VALID [2022-04-08 10:03:59,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {20060#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20060#true} is VALID [2022-04-08 10:03:59,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {20060#true} call ULTIMATE.init(); {20060#true} is VALID [2022-04-08 10:03:59,645 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:03:59,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163550783] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:59,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:59,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-08 10:03:59,646 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:59,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1159101983] [2022-04-08 10:03:59,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1159101983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:59,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:59,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:03:59,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725821516] [2022-04-08 10:03:59,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:59,646 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 10:03:59,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:59,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:59,662 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-08 10:03:59,662 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:03:59,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:59,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:03:59,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:03:59,663 INFO L87 Difference]: Start difference. First operand 88 states and 113 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:00,563 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2022-04-08 10:04:00,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:04:00,563 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 10:04:00,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:00,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:00,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 54 transitions. [2022-04-08 10:04:00,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:00,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 54 transitions. [2022-04-08 10:04:00,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 54 transitions. [2022-04-08 10:04:00,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:00,607 INFO L225 Difference]: With dead ends: 111 [2022-04-08 10:04:00,607 INFO L226 Difference]: Without dead ends: 98 [2022-04-08 10:04:00,609 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1173, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 10:04:00,609 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:00,609 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 73 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:04:00,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-08 10:04:00,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2022-04-08 10:04:00,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:00,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:00,804 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:00,804 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:00,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:00,805 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2022-04-08 10:04:00,806 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 123 transitions. [2022-04-08 10:04:00,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:00,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:00,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-08 10:04:00,806 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-08 10:04:00,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:00,808 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2022-04-08 10:04:00,808 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 123 transitions. [2022-04-08 10:04:00,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:00,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:00,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:00,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:00,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2022-04-08 10:04:00,809 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 30 [2022-04-08 10:04:00,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:00,810 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2022-04-08 10:04:00,810 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:00,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 114 transitions. [2022-04-08 10:04:00,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2022-04-08 10:04:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:04:00,971 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:00,971 INFO L499 BasicCegarLoop]: trace histogram [13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:00,993 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-08 10:04:01,183 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-08 10:04:01,183 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:01,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:01,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1426165966, now seen corresponding path program 65 times [2022-04-08 10:04:01,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:01,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1400214582] [2022-04-08 10:04:01,187 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:01,187 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:01,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1426165966, now seen corresponding path program 66 times [2022-04-08 10:04:01,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:01,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552457183] [2022-04-08 10:04:01,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:01,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:01,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:01,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {20911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20890#true} is VALID [2022-04-08 10:04:01,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {20890#true} assume true; {20890#true} is VALID [2022-04-08 10:04:01,432 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20890#true} {20890#true} #61#return; {20890#true} is VALID [2022-04-08 10:04:01,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {20890#true} call ULTIMATE.init(); {20911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:01,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {20911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20890#true} is VALID [2022-04-08 10:04:01,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {20890#true} assume true; {20890#true} is VALID [2022-04-08 10:04:01,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20890#true} {20890#true} #61#return; {20890#true} is VALID [2022-04-08 10:04:01,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {20890#true} call #t~ret11 := main(); {20890#true} is VALID [2022-04-08 10:04:01,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {20890#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20895#(= main_~y~0 0)} is VALID [2022-04-08 10:04:01,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {20895#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20896#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:01,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {20896#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20897#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:01,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {20897#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20898#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:01,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {20898#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20899#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:01,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {20899#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20900#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:01,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {20900#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20901#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:01,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {20901#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20902#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:01,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {20902#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20903#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:01,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {20903#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20904#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:01,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {20904#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20905#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:01,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {20905#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20906#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:01,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {20906#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20907#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:01,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {20907#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20908#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:01,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {20908#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {20908#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:01,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {20908#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {20909#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:04:01,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {20909#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20910#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-08 10:04:01,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {20910#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {20891#false} is VALID [2022-04-08 10:04:01,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {20891#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20891#false} is VALID [2022-04-08 10:04:01,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {20891#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20891#false} is VALID [2022-04-08 10:04:01,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {20891#false} assume !(~y~0 % 4294967296 > 0); {20891#false} is VALID [2022-04-08 10:04:01,442 INFO L272 TraceCheckUtils]: 26: Hoare triple {20891#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20891#false} is VALID [2022-04-08 10:04:01,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {20891#false} ~cond := #in~cond; {20891#false} is VALID [2022-04-08 10:04:01,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {20891#false} assume 0 == ~cond; {20891#false} is VALID [2022-04-08 10:04:01,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {20891#false} assume !false; {20891#false} is VALID [2022-04-08 10:04:01,442 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:04:01,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:01,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552457183] [2022-04-08 10:04:01,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552457183] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:01,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253203691] [2022-04-08 10:04:01,442 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:04:01,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:01,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:01,443 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-08 10:04:01,444 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-08 10:04:01,485 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:04:01,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:01,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 10:04:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:01,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:01,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {20890#true} call ULTIMATE.init(); {20890#true} is VALID [2022-04-08 10:04:01,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {20890#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20890#true} is VALID [2022-04-08 10:04:01,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {20890#true} assume true; {20890#true} is VALID [2022-04-08 10:04:01,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20890#true} {20890#true} #61#return; {20890#true} is VALID [2022-04-08 10:04:01,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {20890#true} call #t~ret11 := main(); {20890#true} is VALID [2022-04-08 10:04:01,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {20890#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20890#true} is VALID [2022-04-08 10:04:01,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {20890#true} assume !(~x~0 % 4294967296 > 0); {20890#true} is VALID [2022-04-08 10:04:01,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {20890#true} ~z~0 := ~y~0; {20975#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:04:01,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {20975#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20979#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:04:01,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {20979#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {20983#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:04:01,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {20983#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20987#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:04:01,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {20987#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20891#false} is VALID [2022-04-08 10:04:01,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {20891#false} assume !(~y~0 % 4294967296 > 0); {20891#false} is VALID [2022-04-08 10:04:01,614 INFO L272 TraceCheckUtils]: 26: Hoare triple {20891#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20891#false} is VALID [2022-04-08 10:04:01,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {20891#false} ~cond := #in~cond; {20891#false} is VALID [2022-04-08 10:04:01,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {20891#false} assume 0 == ~cond; {20891#false} is VALID [2022-04-08 10:04:01,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {20891#false} assume !false; {20891#false} is VALID [2022-04-08 10:04:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:04:01,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:01,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {20891#false} assume !false; {20891#false} is VALID [2022-04-08 10:04:01,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {20891#false} assume 0 == ~cond; {20891#false} is VALID [2022-04-08 10:04:01,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {20891#false} ~cond := #in~cond; {20891#false} is VALID [2022-04-08 10:04:01,729 INFO L272 TraceCheckUtils]: 26: Hoare triple {20891#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20891#false} is VALID [2022-04-08 10:04:01,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {20891#false} assume !(~y~0 % 4294967296 > 0); {20891#false} is VALID [2022-04-08 10:04:01,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {20987#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20891#false} is VALID [2022-04-08 10:04:01,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {20983#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20987#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:04:01,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {21027#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {20983#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:04:01,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {21031#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21027#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:04:01,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {20890#true} ~z~0 := ~y~0; {21031#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:04:01,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {20890#true} assume !(~x~0 % 4294967296 > 0); {20890#true} is VALID [2022-04-08 10:04:01,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {20890#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20890#true} is VALID [2022-04-08 10:04:01,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {20890#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20890#true} is VALID [2022-04-08 10:04:01,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {20890#true} call #t~ret11 := main(); {20890#true} is VALID [2022-04-08 10:04:01,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20890#true} {20890#true} #61#return; {20890#true} is VALID [2022-04-08 10:04:01,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {20890#true} assume true; {20890#true} is VALID [2022-04-08 10:04:01,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {20890#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20890#true} is VALID [2022-04-08 10:04:01,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {20890#true} call ULTIMATE.init(); {20890#true} is VALID [2022-04-08 10:04:01,739 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:04:01,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253203691] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:01,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:01,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 6, 6] total 25 [2022-04-08 10:04:01,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:01,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1400214582] [2022-04-08 10:04:01,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1400214582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:01,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:01,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:04:01,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906085166] [2022-04-08 10:04:01,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:01,740 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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 30 [2022-04-08 10:04:01,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:01,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:04:01,764 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-08 10:04:01,764 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:04:01,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:01,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:04:01,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:04:01,764 INFO L87 Difference]: Start difference. First operand 89 states and 114 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:04:03,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:03,616 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2022-04-08 10:04:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:04:03,616 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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 30 [2022-04-08 10:04:03,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:03,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:04:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 101 transitions. [2022-04-08 10:04:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:04:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 101 transitions. [2022-04-08 10:04:03,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 101 transitions. [2022-04-08 10:04:03,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:03,697 INFO L225 Difference]: With dead ends: 139 [2022-04-08 10:04:03,697 INFO L226 Difference]: Without dead ends: 131 [2022-04-08 10:04:03,697 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=1575, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:04:03,698 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 75 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:03,698 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 109 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:04:03,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-08 10:04:03,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 95. [2022-04-08 10:04:03,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:03,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:03,922 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:03,922 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:03,924 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-04-08 10:04:03,924 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-08 10:04:03,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:03,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:03,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-08 10:04:03,924 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-08 10:04:03,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:03,926 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-04-08 10:04:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-08 10:04:03,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:03,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:03,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:03,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 122 transitions. [2022-04-08 10:04:03,928 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 122 transitions. Word has length 30 [2022-04-08 10:04:03,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:03,928 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 122 transitions. [2022-04-08 10:04:03,928 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:04:03,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 122 transitions. [2022-04-08 10:04:04,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:04,106 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2022-04-08 10:04:04,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:04:04,106 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:04,106 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:04,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-04-08 10:04:04,307 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-08 10:04:04,307 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:04,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:04,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2100427281, now seen corresponding path program 67 times [2022-04-08 10:04:04,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:04,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1016538464] [2022-04-08 10:04:04,310 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:04,310 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:04,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2100427281, now seen corresponding path program 68 times [2022-04-08 10:04:04,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:04,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113567285] [2022-04-08 10:04:04,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:04,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:04,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:04,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {21879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21861#true} is VALID [2022-04-08 10:04:04,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {21861#true} assume true; {21861#true} is VALID [2022-04-08 10:04:04,538 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21861#true} {21861#true} #61#return; {21861#true} is VALID [2022-04-08 10:04:04,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {21861#true} call ULTIMATE.init(); {21879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:04,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {21879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21861#true} is VALID [2022-04-08 10:04:04,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {21861#true} assume true; {21861#true} is VALID [2022-04-08 10:04:04,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21861#true} {21861#true} #61#return; {21861#true} is VALID [2022-04-08 10:04:04,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {21861#true} call #t~ret11 := main(); {21861#true} is VALID [2022-04-08 10:04:04,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {21861#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21866#(= main_~y~0 0)} is VALID [2022-04-08 10:04:04,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {21866#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21867#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:04,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {21867#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21868#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:04,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {21868#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21869#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:04,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {21869#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21870#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:04,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {21870#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21871#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:04,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {21871#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:04,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {21872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {21872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:04,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {21872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {21873#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:04,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {21873#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21874#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:04,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {21874#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21875#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:04:04,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {21875#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21876#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:04:04,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {21876#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21877#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:04:04,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {21877#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21878#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:04:04,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {21878#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {21862#false} is VALID [2022-04-08 10:04:04,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-08 10:04:04,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-08 10:04:04,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-08 10:04:04,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-08 10:04:04,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-08 10:04:04,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-08 10:04:04,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {21862#false} assume !(~y~0 % 4294967296 > 0); {21862#false} is VALID [2022-04-08 10:04:04,548 INFO L272 TraceCheckUtils]: 27: Hoare triple {21862#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {21862#false} is VALID [2022-04-08 10:04:04,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {21862#false} ~cond := #in~cond; {21862#false} is VALID [2022-04-08 10:04:04,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {21862#false} assume 0 == ~cond; {21862#false} is VALID [2022-04-08 10:04:04,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {21862#false} assume !false; {21862#false} is VALID [2022-04-08 10:04:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:04:04,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:04,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113567285] [2022-04-08 10:04:04,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113567285] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:04,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115994204] [2022-04-08 10:04:04,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:04:04,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:04,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:04,552 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-08 10:04:04,583 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-08 10:04:04,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:04:04,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:04,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-08 10:04:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:04,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:04,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {21861#true} call ULTIMATE.init(); {21861#true} is VALID [2022-04-08 10:04:04,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {21861#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21861#true} is VALID [2022-04-08 10:04:04,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {21861#true} assume true; {21861#true} is VALID [2022-04-08 10:04:04,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21861#true} {21861#true} #61#return; {21861#true} is VALID [2022-04-08 10:04:04,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {21861#true} call #t~ret11 := main(); {21861#true} is VALID [2022-04-08 10:04:04,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {21861#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21866#(= main_~y~0 0)} is VALID [2022-04-08 10:04:04,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {21866#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21867#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:04,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {21867#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21868#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:04,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {21868#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21869#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:04,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {21869#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21870#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:04,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {21870#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21871#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:04,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {21871#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:04,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {21872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {21872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:04,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {21872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {21922#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:04,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {21922#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21926#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:04:04,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {21926#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21930#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:04,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {21930#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21934#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-08 10:04:04,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {21934#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21938#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:04,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {21938#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21942#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:04,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {21942#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 6 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {21862#false} is VALID [2022-04-08 10:04:04,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-08 10:04:04,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-08 10:04:04,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-08 10:04:04,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-08 10:04:04,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-08 10:04:04,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-08 10:04:04,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {21862#false} assume !(~y~0 % 4294967296 > 0); {21862#false} is VALID [2022-04-08 10:04:04,888 INFO L272 TraceCheckUtils]: 27: Hoare triple {21862#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {21862#false} is VALID [2022-04-08 10:04:04,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {21862#false} ~cond := #in~cond; {21862#false} is VALID [2022-04-08 10:04:04,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {21862#false} assume 0 == ~cond; {21862#false} is VALID [2022-04-08 10:04:04,888 INFO L290 TraceCheckUtils]: 30: Hoare triple {21862#false} assume !false; {21862#false} is VALID [2022-04-08 10:04:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:04:04,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:05,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {21862#false} assume !false; {21862#false} is VALID [2022-04-08 10:04:05,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {21862#false} assume 0 == ~cond; {21862#false} is VALID [2022-04-08 10:04:05,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {21862#false} ~cond := #in~cond; {21862#false} is VALID [2022-04-08 10:04:05,242 INFO L272 TraceCheckUtils]: 27: Hoare triple {21862#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {21862#false} is VALID [2022-04-08 10:04:05,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {21862#false} assume !(~y~0 % 4294967296 > 0); {21862#false} is VALID [2022-04-08 10:04:05,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {21994#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-08 10:04:05,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {21998#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21994#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:04:05,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {22002#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21998#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:04:05,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {22006#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22002#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:04:05,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {22010#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22006#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:04:05,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {22014#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22010#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:04:05,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {22018#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {22014#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:04:05,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {22022#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22018#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:04:05,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {22026#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22022#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:04:05,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {22030#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22026#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:04:05,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {22034#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22030#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:04:05,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {22038#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22034#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:04:05,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {21861#true} ~z~0 := ~y~0; {22038#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:04:05,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {21861#true} assume !(~x~0 % 4294967296 > 0); {21861#true} is VALID [2022-04-08 10:04:05,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {21861#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21861#true} is VALID [2022-04-08 10:04:05,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {21861#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21861#true} is VALID [2022-04-08 10:04:05,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {21861#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21861#true} is VALID [2022-04-08 10:04:05,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {21861#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21861#true} is VALID [2022-04-08 10:04:05,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {21861#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21861#true} is VALID [2022-04-08 10:04:05,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {21861#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21861#true} is VALID [2022-04-08 10:04:05,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {21861#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21861#true} is VALID [2022-04-08 10:04:05,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {21861#true} call #t~ret11 := main(); {21861#true} is VALID [2022-04-08 10:04:05,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21861#true} {21861#true} #61#return; {21861#true} is VALID [2022-04-08 10:04:05,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {21861#true} assume true; {21861#true} is VALID [2022-04-08 10:04:05,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {21861#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21861#true} is VALID [2022-04-08 10:04:05,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {21861#true} call ULTIMATE.init(); {21861#true} is VALID [2022-04-08 10:04:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:04:05,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115994204] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:05,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:05,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 14] total 34 [2022-04-08 10:04:05,256 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:05,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1016538464] [2022-04-08 10:04:05,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1016538464] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:05,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:05,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:04:05,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999072175] [2022-04-08 10:04:05,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:05,256 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 10:04:05,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:05,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:05,278 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-08 10:04:05,279 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:04:05,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:05,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:04:05,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:04:05,280 INFO L87 Difference]: Start difference. First operand 95 states and 122 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:06,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:06,331 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-08 10:04:06,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:04:06,331 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 10:04:06,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:06,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:06,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2022-04-08 10:04:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:06,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2022-04-08 10:04:06,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 49 transitions. [2022-04-08 10:04:06,369 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-08 10:04:06,370 INFO L225 Difference]: With dead ends: 116 [2022-04-08 10:04:06,370 INFO L226 Difference]: Without dead ends: 104 [2022-04-08 10:04:06,371 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=1881, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 10:04:06,371 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:06,371 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:04:06,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-08 10:04:06,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2022-04-08 10:04:06,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:06,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 96 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:06,599 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 96 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:06,599 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 96 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:06,601 INFO L93 Difference]: Finished difference Result 104 states and 131 transitions. [2022-04-08 10:04:06,601 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 131 transitions. [2022-04-08 10:04:06,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:06,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:06,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 104 states. [2022-04-08 10:04:06,601 INFO L87 Difference]: Start difference. First operand has 96 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 104 states. [2022-04-08 10:04:06,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:06,603 INFO L93 Difference]: Finished difference Result 104 states and 131 transitions. [2022-04-08 10:04:06,603 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 131 transitions. [2022-04-08 10:04:06,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:06,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:06,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:06,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2022-04-08 10:04:06,605 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 31 [2022-04-08 10:04:06,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:06,605 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2022-04-08 10:04:06,605 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:06,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 123 transitions. [2022-04-08 10:04:06,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2022-04-08 10:04:06,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:04:06,785 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:06,785 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:06,806 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-08 10:04:06,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-08 10:04:06,999 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:07,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:07,000 INFO L85 PathProgramCache]: Analyzing trace with hash 868091775, now seen corresponding path program 69 times [2022-04-08 10:04:07,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:07,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [870815103] [2022-04-08 10:04:07,002 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:07,003 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:07,003 INFO L85 PathProgramCache]: Analyzing trace with hash 868091775, now seen corresponding path program 70 times [2022-04-08 10:04:07,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:07,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058980598] [2022-04-08 10:04:07,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:07,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:07,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:07,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {22758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22741#true} is VALID [2022-04-08 10:04:07,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {22741#true} assume true; {22741#true} is VALID [2022-04-08 10:04:07,190 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22741#true} {22741#true} #61#return; {22741#true} is VALID [2022-04-08 10:04:07,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {22741#true} call ULTIMATE.init(); {22758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:07,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {22758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22741#true} is VALID [2022-04-08 10:04:07,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {22741#true} assume true; {22741#true} is VALID [2022-04-08 10:04:07,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22741#true} {22741#true} #61#return; {22741#true} is VALID [2022-04-08 10:04:07,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {22741#true} call #t~ret11 := main(); {22741#true} is VALID [2022-04-08 10:04:07,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {22741#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22746#(= main_~y~0 0)} is VALID [2022-04-08 10:04:07,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {22746#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22747#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:07,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {22747#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22748#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:07,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {22748#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22749#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:07,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {22749#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22750#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:07,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {22750#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22751#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:07,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {22751#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22752#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:07,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {22752#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:07,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {22753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {22753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:07,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {22753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {22754#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:07,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {22754#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22755#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:07,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {22755#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22756#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:07,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {22756#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22757#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:07,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {22757#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {22742#false} is VALID [2022-04-08 10:04:07,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-08 10:04:07,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-08 10:04:07,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-08 10:04:07,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-08 10:04:07,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-08 10:04:07,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-08 10:04:07,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-08 10:04:07,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {22742#false} assume !(~y~0 % 4294967296 > 0); {22742#false} is VALID [2022-04-08 10:04:07,198 INFO L272 TraceCheckUtils]: 27: Hoare triple {22742#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {22742#false} is VALID [2022-04-08 10:04:07,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {22742#false} ~cond := #in~cond; {22742#false} is VALID [2022-04-08 10:04:07,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {22742#false} assume 0 == ~cond; {22742#false} is VALID [2022-04-08 10:04:07,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {22742#false} assume !false; {22742#false} is VALID [2022-04-08 10:04:07,198 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:04:07,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:07,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058980598] [2022-04-08 10:04:07,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058980598] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:07,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944263978] [2022-04-08 10:04:07,198 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:04:07,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:07,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:07,199 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-08 10:04:07,200 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-08 10:04:07,242 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:04:07,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:07,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:04:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:07,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:07,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {22741#true} call ULTIMATE.init(); {22741#true} is VALID [2022-04-08 10:04:07,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {22741#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22741#true} is VALID [2022-04-08 10:04:07,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {22741#true} assume true; {22741#true} is VALID [2022-04-08 10:04:07,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22741#true} {22741#true} #61#return; {22741#true} is VALID [2022-04-08 10:04:07,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {22741#true} call #t~ret11 := main(); {22741#true} is VALID [2022-04-08 10:04:07,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {22741#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22746#(= main_~y~0 0)} is VALID [2022-04-08 10:04:07,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {22746#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22747#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:07,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {22747#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22748#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:07,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {22748#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22749#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:07,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {22749#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22750#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:07,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {22750#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22751#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:07,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {22751#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22752#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:07,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {22752#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:07,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {22753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {22753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:07,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {22753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {22754#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:07,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {22754#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22755#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:07,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {22755#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22756#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:07,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {22756#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22813#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:04:07,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {22813#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {22742#false} is VALID [2022-04-08 10:04:07,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-08 10:04:07,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-08 10:04:07,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-08 10:04:07,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-08 10:04:07,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-08 10:04:07,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-08 10:04:07,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-08 10:04:07,484 INFO L290 TraceCheckUtils]: 26: Hoare triple {22742#false} assume !(~y~0 % 4294967296 > 0); {22742#false} is VALID [2022-04-08 10:04:07,484 INFO L272 TraceCheckUtils]: 27: Hoare triple {22742#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {22742#false} is VALID [2022-04-08 10:04:07,484 INFO L290 TraceCheckUtils]: 28: Hoare triple {22742#false} ~cond := #in~cond; {22742#false} is VALID [2022-04-08 10:04:07,484 INFO L290 TraceCheckUtils]: 29: Hoare triple {22742#false} assume 0 == ~cond; {22742#false} is VALID [2022-04-08 10:04:07,484 INFO L290 TraceCheckUtils]: 30: Hoare triple {22742#false} assume !false; {22742#false} is VALID [2022-04-08 10:04:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:04:07,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:07,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {22742#false} assume !false; {22742#false} is VALID [2022-04-08 10:04:07,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {22742#false} assume 0 == ~cond; {22742#false} is VALID [2022-04-08 10:04:07,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {22742#false} ~cond := #in~cond; {22742#false} is VALID [2022-04-08 10:04:07,790 INFO L272 TraceCheckUtils]: 27: Hoare triple {22742#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {22742#false} is VALID [2022-04-08 10:04:07,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {22742#false} assume !(~y~0 % 4294967296 > 0); {22742#false} is VALID [2022-04-08 10:04:07,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-08 10:04:07,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-08 10:04:07,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-08 10:04:07,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-08 10:04:07,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-08 10:04:07,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-08 10:04:07,791 INFO L290 TraceCheckUtils]: 19: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-08 10:04:07,791 INFO L290 TraceCheckUtils]: 18: Hoare triple {22889#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {22742#false} is VALID [2022-04-08 10:04:07,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {22893#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22889#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:07,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {22897#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22893#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:07,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {22901#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22897#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:07,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {22905#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {22901#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:07,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {22905#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {22905#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:07,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {22912#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22905#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:07,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {22916#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22912#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:07,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {22920#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22916#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:07,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {22924#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22920#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:07,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {22928#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22924#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:07,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {22932#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22928#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:07,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {22936#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22932#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:07,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {22741#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22936#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:07,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {22741#true} call #t~ret11 := main(); {22741#true} is VALID [2022-04-08 10:04:07,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22741#true} {22741#true} #61#return; {22741#true} is VALID [2022-04-08 10:04:07,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {22741#true} assume true; {22741#true} is VALID [2022-04-08 10:04:07,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {22741#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22741#true} is VALID [2022-04-08 10:04:07,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {22741#true} call ULTIMATE.init(); {22741#true} is VALID [2022-04-08 10:04:07,799 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:04:07,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944263978] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:07,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:07,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-08 10:04:07,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:07,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [870815103] [2022-04-08 10:04:07,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [870815103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:07,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:07,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:04:07,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8301356] [2022-04-08 10:04:07,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:07,800 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 10:04:07,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:07,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:07,817 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-08 10:04:07,817 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:04:07,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:07,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:04:07,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:04:07,818 INFO L87 Difference]: Start difference. First operand 96 states and 123 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:08,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:08,812 INFO L93 Difference]: Finished difference Result 119 states and 146 transitions. [2022-04-08 10:04:08,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:04:08,812 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 10:04:08,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:08,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:08,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 56 transitions. [2022-04-08 10:04:08,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 56 transitions. [2022-04-08 10:04:08,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 56 transitions. [2022-04-08 10:04:08,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:08,859 INFO L225 Difference]: With dead ends: 119 [2022-04-08 10:04:08,859 INFO L226 Difference]: Without dead ends: 106 [2022-04-08 10:04:08,860 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=1441, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 10:04:08,860 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:08,860 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 70 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:04:08,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-08 10:04:09,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2022-04-08 10:04:09,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:09,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 97 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:09,091 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 97 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:09,091 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 97 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:09,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:09,092 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2022-04-08 10:04:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2022-04-08 10:04:09,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:09,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:09,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-08 10:04:09,092 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-08 10:04:09,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:09,094 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2022-04-08 10:04:09,094 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2022-04-08 10:04:09,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:09,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:09,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:09,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 124 transitions. [2022-04-08 10:04:09,095 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 124 transitions. Word has length 31 [2022-04-08 10:04:09,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:09,096 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 124 transitions. [2022-04-08 10:04:09,096 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:09,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 124 transitions. [2022-04-08 10:04:09,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:09,288 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 124 transitions. [2022-04-08 10:04:09,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:04:09,288 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:09,288 INFO L499 BasicCegarLoop]: trace histogram [14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:09,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-04-08 10:04:09,488 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-08 10:04:09,489 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:09,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:09,489 INFO L85 PathProgramCache]: Analyzing trace with hash 717920815, now seen corresponding path program 71 times [2022-04-08 10:04:09,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:09,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1744164080] [2022-04-08 10:04:09,491 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:09,491 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:09,491 INFO L85 PathProgramCache]: Analyzing trace with hash 717920815, now seen corresponding path program 72 times [2022-04-08 10:04:09,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:09,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380966329] [2022-04-08 10:04:09,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:09,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:09,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:09,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {23653#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23631#true} is VALID [2022-04-08 10:04:09,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {23631#true} assume true; {23631#true} is VALID [2022-04-08 10:04:09,784 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23631#true} {23631#true} #61#return; {23631#true} is VALID [2022-04-08 10:04:09,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {23631#true} call ULTIMATE.init(); {23653#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:09,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {23653#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23631#true} is VALID [2022-04-08 10:04:09,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {23631#true} assume true; {23631#true} is VALID [2022-04-08 10:04:09,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23631#true} {23631#true} #61#return; {23631#true} is VALID [2022-04-08 10:04:09,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {23631#true} call #t~ret11 := main(); {23631#true} is VALID [2022-04-08 10:04:09,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {23631#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23636#(= main_~y~0 0)} is VALID [2022-04-08 10:04:09,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {23636#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23637#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:09,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {23637#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23638#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:09,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {23638#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23639#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:09,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {23639#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23640#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:09,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {23640#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23641#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:09,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {23641#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23642#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:09,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {23642#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23643#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:09,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {23643#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23644#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:09,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {23644#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23645#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:09,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {23645#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23646#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:09,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {23646#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23647#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:09,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {23647#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23648#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:09,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {23648#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23649#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:09,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {23649#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23650#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:04:09,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {23650#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {23650#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:04:09,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {23650#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {23651#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:04:09,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {23651#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23652#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:09,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {23652#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {23632#false} is VALID [2022-04-08 10:04:09,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {23632#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {23632#false} is VALID [2022-04-08 10:04:09,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {23632#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {23632#false} is VALID [2022-04-08 10:04:09,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {23632#false} assume !(~y~0 % 4294967296 > 0); {23632#false} is VALID [2022-04-08 10:04:09,794 INFO L272 TraceCheckUtils]: 27: Hoare triple {23632#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {23632#false} is VALID [2022-04-08 10:04:09,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {23632#false} ~cond := #in~cond; {23632#false} is VALID [2022-04-08 10:04:09,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {23632#false} assume 0 == ~cond; {23632#false} is VALID [2022-04-08 10:04:09,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {23632#false} assume !false; {23632#false} is VALID [2022-04-08 10:04:09,794 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:04:09,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:09,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380966329] [2022-04-08 10:04:09,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380966329] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:09,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963399893] [2022-04-08 10:04:09,795 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:04:09,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:09,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:09,796 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:09,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-08 10:04:09,837 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:04:09,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:09,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 10:04:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:09,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:09,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {23631#true} call ULTIMATE.init(); {23631#true} is VALID [2022-04-08 10:04:09,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {23631#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23631#true} is VALID [2022-04-08 10:04:09,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {23631#true} assume true; {23631#true} is VALID [2022-04-08 10:04:09,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23631#true} {23631#true} #61#return; {23631#true} is VALID [2022-04-08 10:04:09,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {23631#true} call #t~ret11 := main(); {23631#true} is VALID [2022-04-08 10:04:09,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {23631#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23631#true} is VALID [2022-04-08 10:04:09,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:09,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:09,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:09,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:09,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:09,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:09,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:09,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:09,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:09,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:09,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:09,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:09,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:09,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:09,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {23631#true} assume !(~x~0 % 4294967296 > 0); {23631#true} is VALID [2022-04-08 10:04:09,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {23631#true} ~z~0 := ~y~0; {23720#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:04:09,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {23720#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23724#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:04:09,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {23724#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {23728#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:04:09,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {23728#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {23732#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:04:09,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {23732#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {23632#false} is VALID [2022-04-08 10:04:09,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {23632#false} assume !(~y~0 % 4294967296 > 0); {23632#false} is VALID [2022-04-08 10:04:09,970 INFO L272 TraceCheckUtils]: 27: Hoare triple {23632#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {23632#false} is VALID [2022-04-08 10:04:09,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {23632#false} ~cond := #in~cond; {23632#false} is VALID [2022-04-08 10:04:09,970 INFO L290 TraceCheckUtils]: 29: Hoare triple {23632#false} assume 0 == ~cond; {23632#false} is VALID [2022-04-08 10:04:09,970 INFO L290 TraceCheckUtils]: 30: Hoare triple {23632#false} assume !false; {23632#false} is VALID [2022-04-08 10:04:09,970 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:04:09,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:10,089 INFO L290 TraceCheckUtils]: 30: Hoare triple {23632#false} assume !false; {23632#false} is VALID [2022-04-08 10:04:10,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {23632#false} assume 0 == ~cond; {23632#false} is VALID [2022-04-08 10:04:10,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {23632#false} ~cond := #in~cond; {23632#false} is VALID [2022-04-08 10:04:10,090 INFO L272 TraceCheckUtils]: 27: Hoare triple {23632#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {23632#false} is VALID [2022-04-08 10:04:10,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {23632#false} assume !(~y~0 % 4294967296 > 0); {23632#false} is VALID [2022-04-08 10:04:10,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {23732#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {23632#false} is VALID [2022-04-08 10:04:10,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {23728#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {23732#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:04:10,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {23772#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {23728#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:04:10,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {23776#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23772#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:04:10,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {23631#true} ~z~0 := ~y~0; {23776#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:04:10,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {23631#true} assume !(~x~0 % 4294967296 > 0); {23631#true} is VALID [2022-04-08 10:04:10,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:10,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:10,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:10,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:10,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:10,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:10,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:10,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:10,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:10,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:10,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:10,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:10,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:10,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {23631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23631#true} is VALID [2022-04-08 10:04:10,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {23631#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23631#true} is VALID [2022-04-08 10:04:10,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {23631#true} call #t~ret11 := main(); {23631#true} is VALID [2022-04-08 10:04:10,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23631#true} {23631#true} #61#return; {23631#true} is VALID [2022-04-08 10:04:10,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {23631#true} assume true; {23631#true} is VALID [2022-04-08 10:04:10,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {23631#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23631#true} is VALID [2022-04-08 10:04:10,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {23631#true} call ULTIMATE.init(); {23631#true} is VALID [2022-04-08 10:04:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:04:10,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963399893] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:10,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:10,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 6, 6] total 26 [2022-04-08 10:04:10,100 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:10,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1744164080] [2022-04-08 10:04:10,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1744164080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:10,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:10,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:04:10,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081791670] [2022-04-08 10:04:10,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:10,101 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 10:04:10,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:10,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:10,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:10,120 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:04:10,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:10,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:04:10,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:04:10,121 INFO L87 Difference]: Start difference. First operand 97 states and 124 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:12,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:12,246 INFO L93 Difference]: Finished difference Result 148 states and 206 transitions. [2022-04-08 10:04:12,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:04:12,246 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 10:04:12,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 108 transitions. [2022-04-08 10:04:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 108 transitions. [2022-04-08 10:04:12,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 108 transitions. [2022-04-08 10:04:12,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:12,333 INFO L225 Difference]: With dead ends: 148 [2022-04-08 10:04:12,333 INFO L226 Difference]: Without dead ends: 140 [2022-04-08 10:04:12,333 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=1739, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:04:12,333 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 83 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:12,334 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 117 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:04:12,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-08 10:04:12,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 103. [2022-04-08 10:04:12,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:12,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 103 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:12,575 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 103 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:12,575 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 103 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:12,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:12,576 INFO L93 Difference]: Finished difference Result 140 states and 173 transitions. [2022-04-08 10:04:12,576 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 173 transitions. [2022-04-08 10:04:12,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:12,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:12,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 140 states. [2022-04-08 10:04:12,577 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 140 states. [2022-04-08 10:04:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:12,579 INFO L93 Difference]: Finished difference Result 140 states and 173 transitions. [2022-04-08 10:04:12,579 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 173 transitions. [2022-04-08 10:04:12,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:12,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:12,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:12,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:12,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 132 transitions. [2022-04-08 10:04:12,581 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 132 transitions. Word has length 31 [2022-04-08 10:04:12,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:12,581 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 132 transitions. [2022-04-08 10:04:12,581 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:12,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 132 transitions. [2022-04-08 10:04:12,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:12,788 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 132 transitions. [2022-04-08 10:04:12,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:04:12,788 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:12,788 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:12,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:12,988 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-04-08 10:04:12,989 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:12,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:12,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1375844749, now seen corresponding path program 73 times [2022-04-08 10:04:12,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:12,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1674461759] [2022-04-08 10:04:12,991 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:12,992 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:12,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1375844749, now seen corresponding path program 74 times [2022-04-08 10:04:12,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:12,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048335073] [2022-04-08 10:04:12,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:12,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:13,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:13,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {24677#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24663#true} is VALID [2022-04-08 10:04:13,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {24663#true} assume true; {24663#true} is VALID [2022-04-08 10:04:13,162 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24663#true} {24663#true} #61#return; {24663#true} is VALID [2022-04-08 10:04:13,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {24663#true} call ULTIMATE.init(); {24677#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:13,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {24677#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24663#true} is VALID [2022-04-08 10:04:13,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {24663#true} assume true; {24663#true} is VALID [2022-04-08 10:04:13,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24663#true} {24663#true} #61#return; {24663#true} is VALID [2022-04-08 10:04:13,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {24663#true} call #t~ret11 := main(); {24663#true} is VALID [2022-04-08 10:04:13,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {24663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24663#true} is VALID [2022-04-08 10:04:13,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {24663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24663#true} is VALID [2022-04-08 10:04:13,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {24663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24663#true} is VALID [2022-04-08 10:04:13,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {24663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24663#true} is VALID [2022-04-08 10:04:13,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {24663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24663#true} is VALID [2022-04-08 10:04:13,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {24663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24663#true} is VALID [2022-04-08 10:04:13,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {24663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24663#true} is VALID [2022-04-08 10:04:13,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {24663#true} assume !(~x~0 % 4294967296 > 0); {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:13,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:13,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:04:13,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {24669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {24670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {24671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {24672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:04:13,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {24673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:04:13,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {24673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {24672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {24671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {24670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:04:13,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {24669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:13,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:13,177 INFO L272 TraceCheckUtils]: 28: Hoare triple {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {24675#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:04:13,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {24675#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {24676#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:04:13,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {24676#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24664#false} is VALID [2022-04-08 10:04:13,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {24664#false} assume !false; {24664#false} is VALID [2022-04-08 10:04:13,179 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:04:13,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:13,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048335073] [2022-04-08 10:04:13,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048335073] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:13,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062978043] [2022-04-08 10:04:13,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:04:13,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:13,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:13,180 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:13,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-08 10:04:13,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:04:13,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:13,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 10:04:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:13,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:13,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {24663#true} call ULTIMATE.init(); {24663#true} is VALID [2022-04-08 10:04:13,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {24663#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24663#true} is VALID [2022-04-08 10:04:13,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {24663#true} assume true; {24663#true} is VALID [2022-04-08 10:04:13,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24663#true} {24663#true} #61#return; {24663#true} is VALID [2022-04-08 10:04:13,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {24663#true} call #t~ret11 := main(); {24663#true} is VALID [2022-04-08 10:04:13,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {24663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24663#true} is VALID [2022-04-08 10:04:13,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {24663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24663#true} is VALID [2022-04-08 10:04:13,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {24663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24663#true} is VALID [2022-04-08 10:04:13,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {24663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24663#true} is VALID [2022-04-08 10:04:13,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {24663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24663#true} is VALID [2022-04-08 10:04:13,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {24663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24663#true} is VALID [2022-04-08 10:04:13,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {24663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24663#true} is VALID [2022-04-08 10:04:13,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {24663#true} assume !(~x~0 % 4294967296 > 0); {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:13,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:13,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:04:13,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {24669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {24670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {24671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {24672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:04:13,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {24673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:04:13,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {24673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {24672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,530 INFO L290 TraceCheckUtils]: 24: Hoare triple {24671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {24670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:04:13,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {24669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:13,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:13,533 INFO L272 TraceCheckUtils]: 28: Hoare triple {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {24765#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:04:13,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {24765#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24769#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:04:13,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {24769#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24664#false} is VALID [2022-04-08 10:04:13,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {24664#false} assume !false; {24664#false} is VALID [2022-04-08 10:04:13,534 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:04:13,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:13,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {24664#false} assume !false; {24664#false} is VALID [2022-04-08 10:04:13,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {24769#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24664#false} is VALID [2022-04-08 10:04:13,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {24765#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24769#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:04:13,812 INFO L272 TraceCheckUtils]: 28: Hoare triple {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {24765#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:04:13,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:13,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {24669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:13,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {24670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:04:13,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {24671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {24672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {24673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:04:13,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {24673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {24672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:04:13,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {24671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {24670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {24669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:13,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:04:13,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:13,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {24663#true} assume !(~x~0 % 4294967296 > 0); {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:13,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {24663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24663#true} is VALID [2022-04-08 10:04:13,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {24663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24663#true} is VALID [2022-04-08 10:04:13,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {24663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24663#true} is VALID [2022-04-08 10:04:13,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {24663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24663#true} is VALID [2022-04-08 10:04:13,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {24663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24663#true} is VALID [2022-04-08 10:04:13,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {24663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24663#true} is VALID [2022-04-08 10:04:13,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {24663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24663#true} is VALID [2022-04-08 10:04:13,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {24663#true} call #t~ret11 := main(); {24663#true} is VALID [2022-04-08 10:04:13,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24663#true} {24663#true} #61#return; {24663#true} is VALID [2022-04-08 10:04:13,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {24663#true} assume true; {24663#true} is VALID [2022-04-08 10:04:13,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {24663#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24663#true} is VALID [2022-04-08 10:04:13,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {24663#true} call ULTIMATE.init(); {24663#true} is VALID [2022-04-08 10:04:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:04:13,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062978043] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:13,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:13,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 14 [2022-04-08 10:04:13,823 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:13,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1674461759] [2022-04-08 10:04:13,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1674461759] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:13,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:13,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:04:13,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615600032] [2022-04-08 10:04:13,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:13,823 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) 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 32 [2022-04-08 10:04:13,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:13,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 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-08 10:04:13,845 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-08 10:04:13,846 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:04:13,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:13,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:04:13,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:04:13,846 INFO L87 Difference]: Start difference. First operand 103 states and 132 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) 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-08 10:04:15,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:15,373 INFO L93 Difference]: Finished difference Result 242 states and 316 transitions. [2022-04-08 10:04:15,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:04:15,373 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) 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 32 [2022-04-08 10:04:15,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:15,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) 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-08 10:04:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2022-04-08 10:04:15,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) 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-08 10:04:15,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2022-04-08 10:04:15,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 52 transitions. [2022-04-08 10:04:15,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:15,420 INFO L225 Difference]: With dead ends: 242 [2022-04-08 10:04:15,421 INFO L226 Difference]: Without dead ends: 230 [2022-04-08 10:04:15,421 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:04:15,421 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 29 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:15,422 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 76 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:04:15,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-04-08 10:04:15,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 107. [2022-04-08 10:04:15,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:15,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:15,684 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:15,684 INFO L87 Difference]: Start difference. First operand 230 states. Second operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:15,687 INFO L93 Difference]: Finished difference Result 230 states and 303 transitions. [2022-04-08 10:04:15,687 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 303 transitions. [2022-04-08 10:04:15,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:15,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:15,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 230 states. [2022-04-08 10:04:15,688 INFO L87 Difference]: Start difference. First operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 230 states. [2022-04-08 10:04:15,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:15,692 INFO L93 Difference]: Finished difference Result 230 states and 303 transitions. [2022-04-08 10:04:15,692 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 303 transitions. [2022-04-08 10:04:15,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:15,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:15,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:15,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:15,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 138 transitions. [2022-04-08 10:04:15,694 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 138 transitions. Word has length 32 [2022-04-08 10:04:15,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:15,694 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 138 transitions. [2022-04-08 10:04:15,694 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) 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-08 10:04:15,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 138 transitions. [2022-04-08 10:04:15,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:15,914 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 138 transitions. [2022-04-08 10:04:15,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:04:15,915 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:15,915 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:15,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:16,115 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-04-08 10:04:16,115 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:16,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:16,115 INFO L85 PathProgramCache]: Analyzing trace with hash -316309121, now seen corresponding path program 75 times [2022-04-08 10:04:16,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:16,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1434879299] [2022-04-08 10:04:16,118 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:16,118 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:16,118 INFO L85 PathProgramCache]: Analyzing trace with hash -316309121, now seen corresponding path program 76 times [2022-04-08 10:04:16,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:16,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032891150] [2022-04-08 10:04:16,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:16,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:16,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:16,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {26065#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26047#true} is VALID [2022-04-08 10:04:16,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {26047#true} assume true; {26047#true} is VALID [2022-04-08 10:04:16,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26047#true} {26047#true} #61#return; {26047#true} is VALID [2022-04-08 10:04:16,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {26047#true} call ULTIMATE.init(); {26065#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:16,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {26065#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26047#true} is VALID [2022-04-08 10:04:16,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {26047#true} assume true; {26047#true} is VALID [2022-04-08 10:04:16,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26047#true} {26047#true} #61#return; {26047#true} is VALID [2022-04-08 10:04:16,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {26047#true} call #t~ret11 := main(); {26047#true} is VALID [2022-04-08 10:04:16,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {26047#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26052#(= main_~y~0 0)} is VALID [2022-04-08 10:04:16,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {26052#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26053#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:16,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {26053#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26054#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:16,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {26054#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26055#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:16,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {26055#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26056#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:16,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {26056#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26057#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:16,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {26057#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26058#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:16,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {26058#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26059#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:16,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {26059#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {26059#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:16,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {26059#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {26060#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:16,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {26060#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26061#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:16,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {26061#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26062#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:16,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {26062#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26063#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:04:16,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {26063#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26064#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:16,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {26064#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {26048#false} is VALID [2022-04-08 10:04:16,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-08 10:04:16,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-08 10:04:16,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-08 10:04:16,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-08 10:04:16,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-08 10:04:16,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-08 10:04:16,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-08 10:04:16,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {26048#false} assume !(~y~0 % 4294967296 > 0); {26048#false} is VALID [2022-04-08 10:04:16,345 INFO L272 TraceCheckUtils]: 28: Hoare triple {26048#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {26048#false} is VALID [2022-04-08 10:04:16,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {26048#false} ~cond := #in~cond; {26048#false} is VALID [2022-04-08 10:04:16,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {26048#false} assume 0 == ~cond; {26048#false} is VALID [2022-04-08 10:04:16,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {26048#false} assume !false; {26048#false} is VALID [2022-04-08 10:04:16,346 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:04:16,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:16,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032891150] [2022-04-08 10:04:16,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032891150] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:16,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179915795] [2022-04-08 10:04:16,346 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:04:16,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:16,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:16,347 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:16,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-08 10:04:16,401 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:04:16,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:16,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 10:04:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:16,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:16,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {26047#true} call ULTIMATE.init(); {26047#true} is VALID [2022-04-08 10:04:16,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {26047#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26047#true} is VALID [2022-04-08 10:04:16,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {26047#true} assume true; {26047#true} is VALID [2022-04-08 10:04:16,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26047#true} {26047#true} #61#return; {26047#true} is VALID [2022-04-08 10:04:16,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {26047#true} call #t~ret11 := main(); {26047#true} is VALID [2022-04-08 10:04:16,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {26047#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26052#(= main_~y~0 0)} is VALID [2022-04-08 10:04:16,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {26052#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26053#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:16,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {26053#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26054#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:16,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {26054#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26055#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:16,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {26055#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26056#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:16,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {26056#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26057#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:16,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {26057#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26058#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:16,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {26058#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26059#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:16,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {26059#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {26059#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:16,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {26059#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {26111#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:16,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {26111#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26115#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:04:16,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {26115#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26119#(and (= main_~y~0 (+ main_~z~0 2)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:16,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {26119#(and (= main_~y~0 (+ main_~z~0 2)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26123#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:16,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {26123#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26127#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-08 10:04:16,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {26127#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !(~z~0 % 4294967296 > 0); {26048#false} is VALID [2022-04-08 10:04:16,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-08 10:04:16,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-08 10:04:16,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-08 10:04:16,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-08 10:04:16,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-08 10:04:16,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-08 10:04:16,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-08 10:04:16,719 INFO L290 TraceCheckUtils]: 27: Hoare triple {26048#false} assume !(~y~0 % 4294967296 > 0); {26048#false} is VALID [2022-04-08 10:04:16,719 INFO L272 TraceCheckUtils]: 28: Hoare triple {26048#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {26048#false} is VALID [2022-04-08 10:04:16,719 INFO L290 TraceCheckUtils]: 29: Hoare triple {26048#false} ~cond := #in~cond; {26048#false} is VALID [2022-04-08 10:04:16,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {26048#false} assume 0 == ~cond; {26048#false} is VALID [2022-04-08 10:04:16,719 INFO L290 TraceCheckUtils]: 31: Hoare triple {26048#false} assume !false; {26048#false} is VALID [2022-04-08 10:04:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:04:16,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:17,038 INFO L290 TraceCheckUtils]: 31: Hoare triple {26048#false} assume !false; {26048#false} is VALID [2022-04-08 10:04:17,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {26048#false} assume 0 == ~cond; {26048#false} is VALID [2022-04-08 10:04:17,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {26048#false} ~cond := #in~cond; {26048#false} is VALID [2022-04-08 10:04:17,038 INFO L272 TraceCheckUtils]: 28: Hoare triple {26048#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {26048#false} is VALID [2022-04-08 10:04:17,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {26048#false} assume !(~y~0 % 4294967296 > 0); {26048#false} is VALID [2022-04-08 10:04:17,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-08 10:04:17,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-08 10:04:17,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {26188#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-08 10:04:17,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {26192#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26188#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:04:17,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {26196#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26192#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:04:17,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {26200#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26196#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:04:17,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {26204#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26200#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:04:17,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {26208#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {26204#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:04:17,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {26212#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26208#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:04:17,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {26216#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26212#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:04:17,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {26220#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26216#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:04:17,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {26224#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26220#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:04:17,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {26047#true} ~z~0 := ~y~0; {26224#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:04:17,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {26047#true} assume !(~x~0 % 4294967296 > 0); {26047#true} is VALID [2022-04-08 10:04:17,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {26047#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26047#true} is VALID [2022-04-08 10:04:17,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {26047#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26047#true} is VALID [2022-04-08 10:04:17,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {26047#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26047#true} is VALID [2022-04-08 10:04:17,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {26047#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26047#true} is VALID [2022-04-08 10:04:17,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {26047#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26047#true} is VALID [2022-04-08 10:04:17,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {26047#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26047#true} is VALID [2022-04-08 10:04:17,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {26047#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26047#true} is VALID [2022-04-08 10:04:17,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {26047#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26047#true} is VALID [2022-04-08 10:04:17,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {26047#true} call #t~ret11 := main(); {26047#true} is VALID [2022-04-08 10:04:17,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26047#true} {26047#true} #61#return; {26047#true} is VALID [2022-04-08 10:04:17,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {26047#true} assume true; {26047#true} is VALID [2022-04-08 10:04:17,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {26047#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26047#true} is VALID [2022-04-08 10:04:17,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {26047#true} call ULTIMATE.init(); {26047#true} is VALID [2022-04-08 10:04:17,046 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-08 10:04:17,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179915795] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:17,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:17,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 12] total 31 [2022-04-08 10:04:17,047 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:17,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1434879299] [2022-04-08 10:04:17,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1434879299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:17,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:17,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:04:17,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054323787] [2022-04-08 10:04:17,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:17,047 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 10:04:17,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:17,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:17,066 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-08 10:04:17,066 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:04:17,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:17,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:04:17,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2022-04-08 10:04:17,067 INFO L87 Difference]: Start difference. First operand 107 states and 138 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:18,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:18,196 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2022-04-08 10:04:18,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:04:18,196 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 10:04:18,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:18,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 58 transitions. [2022-04-08 10:04:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:18,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 58 transitions. [2022-04-08 10:04:18,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 58 transitions. [2022-04-08 10:04:18,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:18,242 INFO L225 Difference]: With dead ends: 130 [2022-04-08 10:04:18,242 INFO L226 Difference]: Without dead ends: 117 [2022-04-08 10:04:18,243 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=290, Invalid=1966, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:04:18,243 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:18,243 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 65 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:04:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-08 10:04:18,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2022-04-08 10:04:18,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:18,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:18,589 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:18,592 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:18,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:18,594 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2022-04-08 10:04:18,594 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2022-04-08 10:04:18,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:18,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:18,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-08 10:04:18,595 INFO L87 Difference]: Start difference. First operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-08 10:04:18,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:18,597 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2022-04-08 10:04:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2022-04-08 10:04:18,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:18,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:18,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:18,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:18,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 139 transitions. [2022-04-08 10:04:18,599 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 139 transitions. Word has length 32 [2022-04-08 10:04:18,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:18,599 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 139 transitions. [2022-04-08 10:04:18,599 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:18,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 139 transitions. [2022-04-08 10:04:18,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:18,885 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 139 transitions. [2022-04-08 10:04:18,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:04:18,885 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:18,885 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:18,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:19,085 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-08 10:04:19,086 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:19,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:19,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1879174029, now seen corresponding path program 77 times [2022-04-08 10:04:19,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:19,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1622832944] [2022-04-08 10:04:19,089 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:19,089 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:19,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1879174029, now seen corresponding path program 78 times [2022-04-08 10:04:19,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:19,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307728898] [2022-04-08 10:04:19,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:19,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:19,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:19,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {27033#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27016#true} is VALID [2022-04-08 10:04:19,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {27016#true} assume true; {27016#true} is VALID [2022-04-08 10:04:19,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27016#true} {27016#true} #61#return; {27016#true} is VALID [2022-04-08 10:04:19,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {27016#true} call ULTIMATE.init(); {27033#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:19,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {27033#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27016#true} is VALID [2022-04-08 10:04:19,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {27016#true} assume true; {27016#true} is VALID [2022-04-08 10:04:19,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27016#true} {27016#true} #61#return; {27016#true} is VALID [2022-04-08 10:04:19,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {27016#true} call #t~ret11 := main(); {27016#true} is VALID [2022-04-08 10:04:19,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {27016#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27021#(= main_~y~0 0)} is VALID [2022-04-08 10:04:19,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {27021#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27022#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:19,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {27022#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27023#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:19,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {27023#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27024#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:19,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {27024#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27025#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:19,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {27025#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27026#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:19,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {27026#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27027#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:19,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {27027#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27028#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:19,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {27028#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27029#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:19,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {27029#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {27029#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:19,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {27029#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {27030#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:19,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {27030#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27031#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:19,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {27031#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27032#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:19,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {27032#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {27017#false} is VALID [2022-04-08 10:04:19,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:19,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:19,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:19,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:19,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:19,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:19,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:19,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:19,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {27017#false} assume !(~y~0 % 4294967296 > 0); {27017#false} is VALID [2022-04-08 10:04:19,301 INFO L272 TraceCheckUtils]: 28: Hoare triple {27017#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {27017#false} is VALID [2022-04-08 10:04:19,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {27017#false} ~cond := #in~cond; {27017#false} is VALID [2022-04-08 10:04:19,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {27017#false} assume 0 == ~cond; {27017#false} is VALID [2022-04-08 10:04:19,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {27017#false} assume !false; {27017#false} is VALID [2022-04-08 10:04:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:04:19,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:19,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307728898] [2022-04-08 10:04:19,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307728898] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:19,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376753372] [2022-04-08 10:04:19,302 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:04:19,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:19,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:19,303 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:19,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-08 10:04:19,402 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:04:19,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:19,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:04:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:19,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:19,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {27016#true} call ULTIMATE.init(); {27016#true} is VALID [2022-04-08 10:04:19,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {27016#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27016#true} is VALID [2022-04-08 10:04:19,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {27016#true} assume true; {27016#true} is VALID [2022-04-08 10:04:19,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27016#true} {27016#true} #61#return; {27016#true} is VALID [2022-04-08 10:04:19,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {27016#true} call #t~ret11 := main(); {27016#true} is VALID [2022-04-08 10:04:19,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {27016#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27021#(= main_~y~0 0)} is VALID [2022-04-08 10:04:19,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {27021#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27022#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:19,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {27022#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27023#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:19,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {27023#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27024#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:19,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {27024#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27025#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:19,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {27025#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27026#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:19,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {27026#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27027#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:19,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {27027#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27028#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:19,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {27028#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27029#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:19,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {27029#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {27029#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:19,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {27029#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {27030#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:19,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {27030#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27031#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:19,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {27031#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27088#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:19,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {27088#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {27017#false} is VALID [2022-04-08 10:04:19,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:19,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:19,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:19,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:19,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:19,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:19,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:19,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:19,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {27017#false} assume !(~y~0 % 4294967296 > 0); {27017#false} is VALID [2022-04-08 10:04:19,726 INFO L272 TraceCheckUtils]: 28: Hoare triple {27017#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {27017#false} is VALID [2022-04-08 10:04:19,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {27017#false} ~cond := #in~cond; {27017#false} is VALID [2022-04-08 10:04:19,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {27017#false} assume 0 == ~cond; {27017#false} is VALID [2022-04-08 10:04:19,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {27017#false} assume !false; {27017#false} is VALID [2022-04-08 10:04:19,727 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:04:19,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:20,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {27017#false} assume !false; {27017#false} is VALID [2022-04-08 10:04:20,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {27017#false} assume 0 == ~cond; {27017#false} is VALID [2022-04-08 10:04:20,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {27017#false} ~cond := #in~cond; {27017#false} is VALID [2022-04-08 10:04:20,033 INFO L272 TraceCheckUtils]: 28: Hoare triple {27017#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {27017#false} is VALID [2022-04-08 10:04:20,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {27017#false} assume !(~y~0 % 4294967296 > 0); {27017#false} is VALID [2022-04-08 10:04:20,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:20,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:20,033 INFO L290 TraceCheckUtils]: 24: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:20,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:20,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:20,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:20,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:20,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-08 10:04:20,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {27170#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {27017#false} is VALID [2022-04-08 10:04:20,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {27174#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27170#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:20,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {27178#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27174#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:20,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {27182#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {27178#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:20,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {27182#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {27182#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:20,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {27189#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27182#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:20,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {27193#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27189#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:20,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {27197#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27193#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:20,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {27201#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27197#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:20,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {27205#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27201#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:20,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {27209#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27205#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:20,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {27213#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27209#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:20,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {27217#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27213#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:20,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {27016#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27217#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:04:20,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {27016#true} call #t~ret11 := main(); {27016#true} is VALID [2022-04-08 10:04:20,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27016#true} {27016#true} #61#return; {27016#true} is VALID [2022-04-08 10:04:20,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {27016#true} assume true; {27016#true} is VALID [2022-04-08 10:04:20,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {27016#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27016#true} is VALID [2022-04-08 10:04:20,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {27016#true} call ULTIMATE.init(); {27016#true} is VALID [2022-04-08 10:04:20,041 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:04:20,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376753372] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:20,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:20,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-08 10:04:20,042 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:20,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1622832944] [2022-04-08 10:04:20,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1622832944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:20,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:20,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:04:20,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173411102] [2022-04-08 10:04:20,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:20,043 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 10:04:20,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:20,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:20,059 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-08 10:04:20,059 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:04:20,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:20,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:04:20,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:04:20,060 INFO L87 Difference]: Start difference. First operand 108 states and 139 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:21,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:21,174 INFO L93 Difference]: Finished difference Result 133 states and 164 transitions. [2022-04-08 10:04:21,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:04:21,174 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 10:04:21,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 61 transitions. [2022-04-08 10:04:21,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 61 transitions. [2022-04-08 10:04:21,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 61 transitions. [2022-04-08 10:04:21,222 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-08 10:04:21,223 INFO L225 Difference]: With dead ends: 133 [2022-04-08 10:04:21,223 INFO L226 Difference]: Without dead ends: 119 [2022-04-08 10:04:21,223 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=374, Invalid=1432, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 10:04:21,224 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:21,224 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 75 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:04:21,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-08 10:04:21,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2022-04-08 10:04:21,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:21,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 109 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:21,495 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 109 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:21,495 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 109 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:21,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:21,497 INFO L93 Difference]: Finished difference Result 119 states and 150 transitions. [2022-04-08 10:04:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 150 transitions. [2022-04-08 10:04:21,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:21,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:21,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 119 states. [2022-04-08 10:04:21,498 INFO L87 Difference]: Start difference. First operand has 109 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 119 states. [2022-04-08 10:04:21,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:21,499 INFO L93 Difference]: Finished difference Result 119 states and 150 transitions. [2022-04-08 10:04:21,499 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 150 transitions. [2022-04-08 10:04:21,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:21,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:21,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:21,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 140 transitions. [2022-04-08 10:04:21,501 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 140 transitions. Word has length 32 [2022-04-08 10:04:21,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:21,501 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 140 transitions. [2022-04-08 10:04:21,501 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:21,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 140 transitions. [2022-04-08 10:04:21,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:21,725 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 140 transitions. [2022-04-08 10:04:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:04:21,725 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:21,725 INFO L499 BasicCegarLoop]: trace histogram [15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:21,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:21,927 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:21,927 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:21,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:21,928 INFO L85 PathProgramCache]: Analyzing trace with hash 237157614, now seen corresponding path program 79 times [2022-04-08 10:04:21,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:21,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [897921950] [2022-04-08 10:04:21,930 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:21,930 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:21,930 INFO L85 PathProgramCache]: Analyzing trace with hash 237157614, now seen corresponding path program 80 times [2022-04-08 10:04:21,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:21,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676183510] [2022-04-08 10:04:21,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:21,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:22,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:22,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {28013#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27990#true} is VALID [2022-04-08 10:04:22,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {27990#true} assume true; {27990#true} is VALID [2022-04-08 10:04:22,249 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27990#true} {27990#true} #61#return; {27990#true} is VALID [2022-04-08 10:04:22,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {27990#true} call ULTIMATE.init(); {28013#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:22,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {28013#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27990#true} is VALID [2022-04-08 10:04:22,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {27990#true} assume true; {27990#true} is VALID [2022-04-08 10:04:22,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27990#true} {27990#true} #61#return; {27990#true} is VALID [2022-04-08 10:04:22,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {27990#true} call #t~ret11 := main(); {27990#true} is VALID [2022-04-08 10:04:22,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {27990#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27995#(= main_~y~0 0)} is VALID [2022-04-08 10:04:22,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {27995#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:22,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {27996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:22,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {27997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:22,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {27998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:22,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {27999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:22,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {28000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:22,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {28001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:22,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {28002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:22,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {28003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:22,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {28004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:22,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {28005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:22,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {28006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:22,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {28007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:22,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {28008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:04:22,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {28009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:04:22,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {28010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {28010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:04:22,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {28010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {28011#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:04:22,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {28011#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28012#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:22,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {28012#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {27991#false} is VALID [2022-04-08 10:04:22,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {27991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27991#false} is VALID [2022-04-08 10:04:22,262 INFO L290 TraceCheckUtils]: 26: Hoare triple {27991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27991#false} is VALID [2022-04-08 10:04:22,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {27991#false} assume !(~y~0 % 4294967296 > 0); {27991#false} is VALID [2022-04-08 10:04:22,262 INFO L272 TraceCheckUtils]: 28: Hoare triple {27991#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {27991#false} is VALID [2022-04-08 10:04:22,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {27991#false} ~cond := #in~cond; {27991#false} is VALID [2022-04-08 10:04:22,262 INFO L290 TraceCheckUtils]: 30: Hoare triple {27991#false} assume 0 == ~cond; {27991#false} is VALID [2022-04-08 10:04:22,262 INFO L290 TraceCheckUtils]: 31: Hoare triple {27991#false} assume !false; {27991#false} is VALID [2022-04-08 10:04:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:04:22,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:22,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676183510] [2022-04-08 10:04:22,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676183510] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:22,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274342598] [2022-04-08 10:04:22,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:04:22,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:22,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:22,264 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:22,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-08 10:04:22,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:04:22,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:22,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 10:04:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:22,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:22,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {27990#true} call ULTIMATE.init(); {27990#true} is VALID [2022-04-08 10:04:22,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {27990#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27990#true} is VALID [2022-04-08 10:04:22,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {27990#true} assume true; {27990#true} is VALID [2022-04-08 10:04:22,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27990#true} {27990#true} #61#return; {27990#true} is VALID [2022-04-08 10:04:22,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {27990#true} call #t~ret11 := main(); {27990#true} is VALID [2022-04-08 10:04:22,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {27990#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27995#(= main_~y~0 0)} is VALID [2022-04-08 10:04:22,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {27995#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:22,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {27996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:22,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {27997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:22,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {27998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:22,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {27999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:22,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {28000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:22,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {28001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:22,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {28002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:22,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {28003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:22,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {28004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:22,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {28005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:22,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {28006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:22,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {28007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:22,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {28008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:04:22,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {28009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:04:22,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {28010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {28010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:04:22,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {28010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {28011#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:04:22,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {28011#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28086#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:04:22,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {28086#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !(~z~0 % 4294967296 > 0); {27991#false} is VALID [2022-04-08 10:04:22,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {27991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27991#false} is VALID [2022-04-08 10:04:22,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {27991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27991#false} is VALID [2022-04-08 10:04:22,609 INFO L290 TraceCheckUtils]: 27: Hoare triple {27991#false} assume !(~y~0 % 4294967296 > 0); {27991#false} is VALID [2022-04-08 10:04:22,609 INFO L272 TraceCheckUtils]: 28: Hoare triple {27991#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {27991#false} is VALID [2022-04-08 10:04:22,609 INFO L290 TraceCheckUtils]: 29: Hoare triple {27991#false} ~cond := #in~cond; {27991#false} is VALID [2022-04-08 10:04:22,609 INFO L290 TraceCheckUtils]: 30: Hoare triple {27991#false} assume 0 == ~cond; {27991#false} is VALID [2022-04-08 10:04:22,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {27991#false} assume !false; {27991#false} is VALID [2022-04-08 10:04:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:04:22,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:23,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {27991#false} assume !false; {27991#false} is VALID [2022-04-08 10:04:23,155 INFO L290 TraceCheckUtils]: 30: Hoare triple {27991#false} assume 0 == ~cond; {27991#false} is VALID [2022-04-08 10:04:23,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {27991#false} ~cond := #in~cond; {27991#false} is VALID [2022-04-08 10:04:23,155 INFO L272 TraceCheckUtils]: 28: Hoare triple {27991#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {27991#false} is VALID [2022-04-08 10:04:23,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {27991#false} assume !(~y~0 % 4294967296 > 0); {27991#false} is VALID [2022-04-08 10:04:23,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {27991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27991#false} is VALID [2022-04-08 10:04:23,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {27991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27991#false} is VALID [2022-04-08 10:04:23,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {28132#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {27991#false} is VALID [2022-04-08 10:04:23,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {28136#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28132#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:23,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {28140#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {28136#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:23,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {28140#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {28140#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:23,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {28147#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28140#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:23,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {28151#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28147#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:23,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {28155#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28151#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:23,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {28159#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28155#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:23,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {28163#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28159#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:23,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {28167#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28163#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:23,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {28171#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28167#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:23,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {28175#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28171#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:04:23,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {28179#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28175#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:23,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {28183#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28179#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:04:23,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {28187#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28183#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:04:23,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {28191#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28187#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:04:23,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {28195#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28191#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:04:23,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {28199#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28195#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:04:23,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {28203#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28199#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:04:23,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {27990#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28203#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:04:23,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {27990#true} call #t~ret11 := main(); {27990#true} is VALID [2022-04-08 10:04:23,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27990#true} {27990#true} #61#return; {27990#true} is VALID [2022-04-08 10:04:23,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {27990#true} assume true; {27990#true} is VALID [2022-04-08 10:04:23,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {27990#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27990#true} is VALID [2022-04-08 10:04:23,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {27990#true} call ULTIMATE.init(); {27990#true} is VALID [2022-04-08 10:04:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:04:23,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274342598] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:23,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:23,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-08 10:04:23,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:23,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [897921950] [2022-04-08 10:04:23,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [897921950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:23,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:23,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:04:23,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205101906] [2022-04-08 10:04:23,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:23,168 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 10:04:23,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:23,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:23,187 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-08 10:04:23,187 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:04:23,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:23,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:04:23,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1221, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:04:23,188 INFO L87 Difference]: Start difference. First operand 109 states and 140 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:25,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:25,666 INFO L93 Difference]: Finished difference Result 169 states and 238 transitions. [2022-04-08 10:04:25,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 10:04:25,666 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 10:04:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:25,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:25,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 115 transitions. [2022-04-08 10:04:25,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 115 transitions. [2022-04-08 10:04:25,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 115 transitions. [2022-04-08 10:04:25,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:25,758 INFO L225 Difference]: With dead ends: 169 [2022-04-08 10:04:25,758 INFO L226 Difference]: Without dead ends: 161 [2022-04-08 10:04:25,759 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=731, Invalid=2691, Unknown=0, NotChecked=0, Total=3422 [2022-04-08 10:04:25,759 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 91 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:25,759 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 130 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:04:25,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-08 10:04:26,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 115. [2022-04-08 10:04:26,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:26,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:26,071 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:26,071 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:26,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:26,073 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2022-04-08 10:04:26,073 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2022-04-08 10:04:26,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:26,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:26,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-08 10:04:26,074 INFO L87 Difference]: Start difference. First operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-08 10:04:26,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:26,075 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2022-04-08 10:04:26,076 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2022-04-08 10:04:26,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:26,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:26,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:26,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:26,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 148 transitions. [2022-04-08 10:04:26,077 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 148 transitions. Word has length 32 [2022-04-08 10:04:26,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:26,077 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 148 transitions. [2022-04-08 10:04:26,077 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:26,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 148 transitions. [2022-04-08 10:04:26,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:26,304 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 148 transitions. [2022-04-08 10:04:26,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:04:26,305 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:26,305 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:26,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-04-08 10:04:26,505 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:26,505 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:26,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:26,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1766095279, now seen corresponding path program 81 times [2022-04-08 10:04:26,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:26,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1971124945] [2022-04-08 10:04:26,508 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:26,508 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:26,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1766095279, now seen corresponding path program 82 times [2022-04-08 10:04:26,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:26,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443350682] [2022-04-08 10:04:26,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:26,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:26,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:26,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {29171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29152#true} is VALID [2022-04-08 10:04:26,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {29152#true} assume true; {29152#true} is VALID [2022-04-08 10:04:26,750 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29152#true} {29152#true} #61#return; {29152#true} is VALID [2022-04-08 10:04:26,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {29152#true} call ULTIMATE.init(); {29171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:26,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {29171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29152#true} is VALID [2022-04-08 10:04:26,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {29152#true} assume true; {29152#true} is VALID [2022-04-08 10:04:26,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29152#true} {29152#true} #61#return; {29152#true} is VALID [2022-04-08 10:04:26,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {29152#true} call #t~ret11 := main(); {29152#true} is VALID [2022-04-08 10:04:26,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {29152#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29157#(= main_~y~0 0)} is VALID [2022-04-08 10:04:26,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {29157#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29158#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:26,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {29158#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29159#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:26,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {29159#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29160#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:26,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {29160#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29161#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:26,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {29161#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29162#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:26,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {29162#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29163#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:26,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {29163#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {29163#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:26,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {29163#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {29164#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:26,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {29164#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29165#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:26,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {29165#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29166#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:04:26,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {29166#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29167#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:04:26,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {29167#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29168#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:04:26,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {29168#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29169#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:04:26,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {29169#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29170#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:04:26,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {29170#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29153#false} is VALID [2022-04-08 10:04:26,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {29153#false} assume !(~z~0 % 4294967296 > 0); {29153#false} is VALID [2022-04-08 10:04:26,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-08 10:04:26,761 INFO L290 TraceCheckUtils]: 23: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-08 10:04:26,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-08 10:04:26,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-08 10:04:26,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-08 10:04:26,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-08 10:04:26,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {29153#false} assume !(~y~0 % 4294967296 > 0); {29153#false} is VALID [2022-04-08 10:04:26,761 INFO L272 TraceCheckUtils]: 29: Hoare triple {29153#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {29153#false} is VALID [2022-04-08 10:04:26,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {29153#false} ~cond := #in~cond; {29153#false} is VALID [2022-04-08 10:04:26,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {29153#false} assume 0 == ~cond; {29153#false} is VALID [2022-04-08 10:04:26,761 INFO L290 TraceCheckUtils]: 32: Hoare triple {29153#false} assume !false; {29153#false} is VALID [2022-04-08 10:04:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:04:26,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:26,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443350682] [2022-04-08 10:04:26,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443350682] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:26,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040738751] [2022-04-08 10:04:26,762 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:04:26,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:26,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:26,763 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:26,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-08 10:04:26,810 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:04:26,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:26,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-08 10:04:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:26,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:27,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {29152#true} call ULTIMATE.init(); {29152#true} is VALID [2022-04-08 10:04:27,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {29152#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29152#true} is VALID [2022-04-08 10:04:27,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {29152#true} assume true; {29152#true} is VALID [2022-04-08 10:04:27,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29152#true} {29152#true} #61#return; {29152#true} is VALID [2022-04-08 10:04:27,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {29152#true} call #t~ret11 := main(); {29152#true} is VALID [2022-04-08 10:04:27,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {29152#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29157#(= main_~y~0 0)} is VALID [2022-04-08 10:04:27,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {29157#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29158#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:27,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {29158#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29159#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:27,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {29159#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29160#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:27,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {29160#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29161#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:27,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {29161#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29162#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:27,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {29162#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29163#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:27,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {29163#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {29163#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:27,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {29163#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {29214#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:27,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {29214#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29218#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:04:27,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {29218#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29222#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:27,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {29222#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29226#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:27,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {29226#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29230#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:27,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {29230#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29234#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:27,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {29234#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29238#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:27,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {29238#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29153#false} is VALID [2022-04-08 10:04:27,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {29153#false} assume !(~z~0 % 4294967296 > 0); {29153#false} is VALID [2022-04-08 10:04:27,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-08 10:04:27,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-08 10:04:27,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-08 10:04:27,195 INFO L290 TraceCheckUtils]: 25: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-08 10:04:27,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-08 10:04:27,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-08 10:04:27,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {29153#false} assume !(~y~0 % 4294967296 > 0); {29153#false} is VALID [2022-04-08 10:04:27,196 INFO L272 TraceCheckUtils]: 29: Hoare triple {29153#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {29153#false} is VALID [2022-04-08 10:04:27,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {29153#false} ~cond := #in~cond; {29153#false} is VALID [2022-04-08 10:04:27,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {29153#false} assume 0 == ~cond; {29153#false} is VALID [2022-04-08 10:04:27,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {29153#false} assume !false; {29153#false} is VALID [2022-04-08 10:04:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:04:27,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:27,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {29153#false} assume !false; {29153#false} is VALID [2022-04-08 10:04:27,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {29153#false} assume 0 == ~cond; {29153#false} is VALID [2022-04-08 10:04:27,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {29153#false} ~cond := #in~cond; {29153#false} is VALID [2022-04-08 10:04:27,650 INFO L272 TraceCheckUtils]: 29: Hoare triple {29153#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {29153#false} is VALID [2022-04-08 10:04:27,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {29290#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {29153#false} is VALID [2022-04-08 10:04:27,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {29294#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29290#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:27,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {29298#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29294#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:27,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {29302#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29298#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:27,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {29306#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29302#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:27,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {29310#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29306#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:27,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {29314#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29310#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:27,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {29314#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {29314#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:27,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {29321#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29314#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:27,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {29325#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29321#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:04:27,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {29329#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29325#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:04:27,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {29333#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29329#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:04:27,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {29337#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29333#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:04:27,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {29341#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29337#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:04:27,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {29345#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29341#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:04:27,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {29152#true} ~z~0 := ~y~0; {29345#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:04:27,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {29152#true} assume !(~x~0 % 4294967296 > 0); {29152#true} is VALID [2022-04-08 10:04:27,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {29152#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29152#true} is VALID [2022-04-08 10:04:27,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {29152#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29152#true} is VALID [2022-04-08 10:04:27,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {29152#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29152#true} is VALID [2022-04-08 10:04:27,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {29152#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29152#true} is VALID [2022-04-08 10:04:27,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {29152#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29152#true} is VALID [2022-04-08 10:04:27,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {29152#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29152#true} is VALID [2022-04-08 10:04:27,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {29152#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29152#true} is VALID [2022-04-08 10:04:27,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {29152#true} call #t~ret11 := main(); {29152#true} is VALID [2022-04-08 10:04:27,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29152#true} {29152#true} #61#return; {29152#true} is VALID [2022-04-08 10:04:27,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {29152#true} assume true; {29152#true} is VALID [2022-04-08 10:04:27,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {29152#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29152#true} is VALID [2022-04-08 10:04:27,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {29152#true} call ULTIMATE.init(); {29152#true} is VALID [2022-04-08 10:04:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:04:27,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040738751] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:27,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:27,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 38 [2022-04-08 10:04:27,668 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:27,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1971124945] [2022-04-08 10:04:27,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1971124945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:27,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:27,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:04:27,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248941934] [2022-04-08 10:04:27,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:27,669 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 10:04:27,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:27,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:27,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:27,687 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:04:27,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:27,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:04:27,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:04:27,688 INFO L87 Difference]: Start difference. First operand 115 states and 148 transitions. Second operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:28,648 INFO L93 Difference]: Finished difference Result 127 states and 159 transitions. [2022-04-08 10:04:28,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:04:28,648 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 10:04:28,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:28,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:28,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2022-04-08 10:04:28,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:28,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2022-04-08 10:04:28,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 41 transitions. [2022-04-08 10:04:28,679 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-08 10:04:28,680 INFO L225 Difference]: With dead ends: 127 [2022-04-08 10:04:28,680 INFO L226 Difference]: Without dead ends: 106 [2022-04-08 10:04:28,680 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=444, Invalid=2208, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:04:28,681 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:28,681 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 86 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:04:28,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-08 10:04:28,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-04-08 10:04:28,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:28,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 101 states have (on average 1.316831683168317) internal successors, (133), 101 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:28,937 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 101 states have (on average 1.316831683168317) internal successors, (133), 101 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:28,937 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 101 states have (on average 1.316831683168317) internal successors, (133), 101 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:28,938 INFO L93 Difference]: Finished difference Result 106 states and 137 transitions. [2022-04-08 10:04:28,938 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 137 transitions. [2022-04-08 10:04:28,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:28,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:28,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 101 states have (on average 1.316831683168317) internal successors, (133), 101 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-08 10:04:28,939 INFO L87 Difference]: Start difference. First operand has 106 states, 101 states have (on average 1.316831683168317) internal successors, (133), 101 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-08 10:04:28,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:28,940 INFO L93 Difference]: Finished difference Result 106 states and 137 transitions. [2022-04-08 10:04:28,940 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 137 transitions. [2022-04-08 10:04:28,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:28,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:28,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:28,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:28,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.316831683168317) internal successors, (133), 101 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:28,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 137 transitions. [2022-04-08 10:04:28,941 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 137 transitions. Word has length 33 [2022-04-08 10:04:28,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:28,941 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 137 transitions. [2022-04-08 10:04:28,942 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:28,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 137 transitions. [2022-04-08 10:04:29,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 137 transitions. [2022-04-08 10:04:29,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:04:29,157 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:29,157 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:29,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-04-08 10:04:29,357 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-08 10:04:29,357 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:29,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:29,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1621968767, now seen corresponding path program 83 times [2022-04-08 10:04:29,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:29,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [118851397] [2022-04-08 10:04:29,360 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:29,360 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:29,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1621968767, now seen corresponding path program 84 times [2022-04-08 10:04:29,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:29,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754137065] [2022-04-08 10:04:29,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:29,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:29,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:29,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {30115#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30096#true} is VALID [2022-04-08 10:04:29,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {30096#true} assume true; {30096#true} is VALID [2022-04-08 10:04:29,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30096#true} {30096#true} #61#return; {30096#true} is VALID [2022-04-08 10:04:29,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {30096#true} call ULTIMATE.init(); {30115#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:29,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {30115#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30096#true} is VALID [2022-04-08 10:04:29,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {30096#true} assume true; {30096#true} is VALID [2022-04-08 10:04:29,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30096#true} {30096#true} #61#return; {30096#true} is VALID [2022-04-08 10:04:29,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {30096#true} call #t~ret11 := main(); {30096#true} is VALID [2022-04-08 10:04:29,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {30096#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30101#(= main_~y~0 0)} is VALID [2022-04-08 10:04:29,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {30101#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30102#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:29,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {30102#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30103#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:29,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {30103#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30104#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:29,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {30104#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30105#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:29,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {30105#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30106#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:29,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {30106#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30107#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:29,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {30107#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30108#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:29,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {30108#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {30108#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:29,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {30108#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {30109#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:29,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {30109#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30110#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:29,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {30110#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30111#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:29,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {30111#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30112#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:04:29,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {30112#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30113#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:04:29,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {30113#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30114#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:04:29,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {30114#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {30097#false} is VALID [2022-04-08 10:04:29,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-08 10:04:29,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-08 10:04:29,607 INFO L290 TraceCheckUtils]: 23: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-08 10:04:29,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-08 10:04:29,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-08 10:04:29,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-08 10:04:29,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-08 10:04:29,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {30097#false} assume !(~y~0 % 4294967296 > 0); {30097#false} is VALID [2022-04-08 10:04:29,607 INFO L272 TraceCheckUtils]: 29: Hoare triple {30097#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {30097#false} is VALID [2022-04-08 10:04:29,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {30097#false} ~cond := #in~cond; {30097#false} is VALID [2022-04-08 10:04:29,608 INFO L290 TraceCheckUtils]: 31: Hoare triple {30097#false} assume 0 == ~cond; {30097#false} is VALID [2022-04-08 10:04:29,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {30097#false} assume !false; {30097#false} is VALID [2022-04-08 10:04:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:04:29,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:29,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754137065] [2022-04-08 10:04:29,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754137065] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:29,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816321725] [2022-04-08 10:04:29,608 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:04:29,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:29,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:29,612 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:29,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-08 10:04:29,823 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:04:29,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:29,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 10:04:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:29,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:30,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {30096#true} call ULTIMATE.init(); {30096#true} is VALID [2022-04-08 10:04:30,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {30096#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30096#true} is VALID [2022-04-08 10:04:30,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {30096#true} assume true; {30096#true} is VALID [2022-04-08 10:04:30,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30096#true} {30096#true} #61#return; {30096#true} is VALID [2022-04-08 10:04:30,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {30096#true} call #t~ret11 := main(); {30096#true} is VALID [2022-04-08 10:04:30,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {30096#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30101#(= main_~y~0 0)} is VALID [2022-04-08 10:04:30,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {30101#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30102#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:30,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {30102#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30103#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:30,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {30103#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30104#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:30,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {30104#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30105#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:30,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {30105#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30106#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:30,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {30106#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30107#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:30,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {30107#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30108#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:30,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {30108#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {30108#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:30,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {30108#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {30161#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:30,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {30161#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30165#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:04:30,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {30165#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30169#(and (= main_~y~0 (+ main_~z~0 2)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:30,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {30169#(and (= main_~y~0 (+ main_~z~0 2)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30173#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:30,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {30173#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30177#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-08 10:04:30,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {30177#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30181#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:30,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {30181#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~z~0 % 4294967296 > 0); {30097#false} is VALID [2022-04-08 10:04:30,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-08 10:04:30,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-08 10:04:30,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-08 10:04:30,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-08 10:04:30,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-08 10:04:30,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-08 10:04:30,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-08 10:04:30,160 INFO L290 TraceCheckUtils]: 28: Hoare triple {30097#false} assume !(~y~0 % 4294967296 > 0); {30097#false} is VALID [2022-04-08 10:04:30,160 INFO L272 TraceCheckUtils]: 29: Hoare triple {30097#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {30097#false} is VALID [2022-04-08 10:04:30,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {30097#false} ~cond := #in~cond; {30097#false} is VALID [2022-04-08 10:04:30,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {30097#false} assume 0 == ~cond; {30097#false} is VALID [2022-04-08 10:04:30,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {30097#false} assume !false; {30097#false} is VALID [2022-04-08 10:04:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:04:30,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:30,581 INFO L290 TraceCheckUtils]: 32: Hoare triple {30097#false} assume !false; {30097#false} is VALID [2022-04-08 10:04:30,581 INFO L290 TraceCheckUtils]: 31: Hoare triple {30097#false} assume 0 == ~cond; {30097#false} is VALID [2022-04-08 10:04:30,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {30097#false} ~cond := #in~cond; {30097#false} is VALID [2022-04-08 10:04:30,581 INFO L272 TraceCheckUtils]: 29: Hoare triple {30097#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {30097#false} is VALID [2022-04-08 10:04:30,582 INFO L290 TraceCheckUtils]: 28: Hoare triple {30097#false} assume !(~y~0 % 4294967296 > 0); {30097#false} is VALID [2022-04-08 10:04:30,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-08 10:04:30,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {30239#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-08 10:04:30,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {30243#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30239#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:04:30,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {30247#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30243#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:04:30,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {30251#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30247#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:04:30,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {30255#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30251#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:04:30,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {30259#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30255#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:04:30,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {30263#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {30259#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:04:30,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {30267#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30263#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:04:30,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {30271#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30267#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:04:30,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {30275#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30271#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:04:30,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {30279#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30275#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:04:30,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {30283#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30279#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:04:30,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {30096#true} ~z~0 := ~y~0; {30283#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:04:30,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {30096#true} assume !(~x~0 % 4294967296 > 0); {30096#true} is VALID [2022-04-08 10:04:30,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {30096#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30096#true} is VALID [2022-04-08 10:04:30,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {30096#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30096#true} is VALID [2022-04-08 10:04:30,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {30096#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30096#true} is VALID [2022-04-08 10:04:30,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {30096#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30096#true} is VALID [2022-04-08 10:04:30,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {30096#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30096#true} is VALID [2022-04-08 10:04:30,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {30096#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30096#true} is VALID [2022-04-08 10:04:30,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {30096#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30096#true} is VALID [2022-04-08 10:04:30,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {30096#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30096#true} is VALID [2022-04-08 10:04:30,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {30096#true} call #t~ret11 := main(); {30096#true} is VALID [2022-04-08 10:04:30,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30096#true} {30096#true} #61#return; {30096#true} is VALID [2022-04-08 10:04:30,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {30096#true} assume true; {30096#true} is VALID [2022-04-08 10:04:30,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {30096#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30096#true} is VALID [2022-04-08 10:04:30,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {30096#true} call ULTIMATE.init(); {30096#true} is VALID [2022-04-08 10:04:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-08 10:04:30,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816321725] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:30,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:30,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 14] total 35 [2022-04-08 10:04:30,592 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:30,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [118851397] [2022-04-08 10:04:30,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [118851397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:30,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:30,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:04:30,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558260713] [2022-04-08 10:04:30,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:30,592 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 10:04:30,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:30,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:30,610 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-08 10:04:30,610 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:04:30,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:30,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:04:30,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1022, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 10:04:30,611 INFO L87 Difference]: Start difference. First operand 106 states and 137 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:31,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:31,742 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2022-04-08 10:04:31,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:04:31,742 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 10:04:31,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:31,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 51 transitions. [2022-04-08 10:04:31,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:31,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 51 transitions. [2022-04-08 10:04:31,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 51 transitions. [2022-04-08 10:04:31,783 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-08 10:04:31,784 INFO L225 Difference]: With dead ends: 129 [2022-04-08 10:04:31,784 INFO L226 Difference]: Without dead ends: 116 [2022-04-08 10:04:31,784 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=292, Invalid=2060, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 10:04:31,785 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:31,785 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:04:31,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-08 10:04:32,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2022-04-08 10:04:32,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:32,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:32,055 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:32,055 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:32,056 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2022-04-08 10:04:32,056 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2022-04-08 10:04:32,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:32,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:32,057 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 116 states. [2022-04-08 10:04:32,057 INFO L87 Difference]: Start difference. First operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 116 states. [2022-04-08 10:04:32,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:32,058 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2022-04-08 10:04:32,058 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2022-04-08 10:04:32,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:32,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:32,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:32,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 138 transitions. [2022-04-08 10:04:32,060 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 138 transitions. Word has length 33 [2022-04-08 10:04:32,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:32,060 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 138 transitions. [2022-04-08 10:04:32,060 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:32,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 138 transitions. [2022-04-08 10:04:32,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:32,276 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 138 transitions. [2022-04-08 10:04:32,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:04:32,276 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:32,276 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:32,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-04-08 10:04:32,477 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-04-08 10:04:32,477 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:32,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:32,477 INFO L85 PathProgramCache]: Analyzing trace with hash -843221009, now seen corresponding path program 85 times [2022-04-08 10:04:32,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:32,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1711112293] [2022-04-08 10:04:32,480 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:32,480 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:32,480 INFO L85 PathProgramCache]: Analyzing trace with hash -843221009, now seen corresponding path program 86 times [2022-04-08 10:04:32,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:32,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798453660] [2022-04-08 10:04:32,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:32,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:32,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:32,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {31081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31063#true} is VALID [2022-04-08 10:04:32,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {31063#true} assume true; {31063#true} is VALID [2022-04-08 10:04:32,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31063#true} {31063#true} #61#return; {31063#true} is VALID [2022-04-08 10:04:32,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {31063#true} call ULTIMATE.init(); {31081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:32,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {31081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31063#true} is VALID [2022-04-08 10:04:32,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {31063#true} assume true; {31063#true} is VALID [2022-04-08 10:04:32,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31063#true} {31063#true} #61#return; {31063#true} is VALID [2022-04-08 10:04:32,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {31063#true} call #t~ret11 := main(); {31063#true} is VALID [2022-04-08 10:04:32,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {31063#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31068#(= main_~y~0 0)} is VALID [2022-04-08 10:04:32,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {31068#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:32,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {31069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31070#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:32,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {31070#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31071#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:32,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {31071#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31072#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:32,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {31072#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31073#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:32,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {31073#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31074#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:32,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {31074#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31075#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:32,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {31075#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31076#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:32,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {31076#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {31076#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:32,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {31076#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {31077#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:32,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {31077#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31078#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:32,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {31078#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31079#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:32,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {31079#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31080#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:32,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {31080#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {31064#false} is VALID [2022-04-08 10:04:32,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:32,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:32,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:32,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:32,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:32,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:32,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:32,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:32,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {31064#false} assume !(~y~0 % 4294967296 > 0); {31064#false} is VALID [2022-04-08 10:04:32,680 INFO L272 TraceCheckUtils]: 29: Hoare triple {31064#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {31064#false} is VALID [2022-04-08 10:04:32,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {31064#false} ~cond := #in~cond; {31064#false} is VALID [2022-04-08 10:04:32,680 INFO L290 TraceCheckUtils]: 31: Hoare triple {31064#false} assume 0 == ~cond; {31064#false} is VALID [2022-04-08 10:04:32,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {31064#false} assume !false; {31064#false} is VALID [2022-04-08 10:04:32,680 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:04:32,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:32,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798453660] [2022-04-08 10:04:32,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798453660] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:32,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398087036] [2022-04-08 10:04:32,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:04:32,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:32,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:32,683 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:32,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-08 10:04:32,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:04:32,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:32,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:04:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:32,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:32,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {31063#true} call ULTIMATE.init(); {31063#true} is VALID [2022-04-08 10:04:32,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {31063#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31063#true} is VALID [2022-04-08 10:04:32,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {31063#true} assume true; {31063#true} is VALID [2022-04-08 10:04:32,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31063#true} {31063#true} #61#return; {31063#true} is VALID [2022-04-08 10:04:32,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {31063#true} call #t~ret11 := main(); {31063#true} is VALID [2022-04-08 10:04:32,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {31063#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31068#(= main_~y~0 0)} is VALID [2022-04-08 10:04:32,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {31068#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:32,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {31069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31070#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:32,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {31070#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31071#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:32,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {31071#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31072#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:32,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {31072#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31073#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:32,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {31073#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31074#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:32,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {31074#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31075#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:32,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {31075#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31076#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:32,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {31076#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {31076#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:32,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {31076#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {31077#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:32,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {31077#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31078#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:32,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {31078#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31079#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:32,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {31079#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31139#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:32,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {31139#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {31064#false} is VALID [2022-04-08 10:04:32,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:32,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:32,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:32,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:32,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:32,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:32,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:32,978 INFO L290 TraceCheckUtils]: 27: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:32,978 INFO L290 TraceCheckUtils]: 28: Hoare triple {31064#false} assume !(~y~0 % 4294967296 > 0); {31064#false} is VALID [2022-04-08 10:04:32,978 INFO L272 TraceCheckUtils]: 29: Hoare triple {31064#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {31064#false} is VALID [2022-04-08 10:04:32,978 INFO L290 TraceCheckUtils]: 30: Hoare triple {31064#false} ~cond := #in~cond; {31064#false} is VALID [2022-04-08 10:04:32,978 INFO L290 TraceCheckUtils]: 31: Hoare triple {31064#false} assume 0 == ~cond; {31064#false} is VALID [2022-04-08 10:04:32,978 INFO L290 TraceCheckUtils]: 32: Hoare triple {31064#false} assume !false; {31064#false} is VALID [2022-04-08 10:04:32,978 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:04:32,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:33,309 INFO L290 TraceCheckUtils]: 32: Hoare triple {31064#false} assume !false; {31064#false} is VALID [2022-04-08 10:04:33,309 INFO L290 TraceCheckUtils]: 31: Hoare triple {31064#false} assume 0 == ~cond; {31064#false} is VALID [2022-04-08 10:04:33,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {31064#false} ~cond := #in~cond; {31064#false} is VALID [2022-04-08 10:04:33,310 INFO L272 TraceCheckUtils]: 29: Hoare triple {31064#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {31064#false} is VALID [2022-04-08 10:04:33,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {31064#false} assume !(~y~0 % 4294967296 > 0); {31064#false} is VALID [2022-04-08 10:04:33,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:33,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:33,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:33,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:33,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:33,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:33,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:33,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-08 10:04:33,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {31221#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {31064#false} is VALID [2022-04-08 10:04:33,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {31225#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31221#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:33,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {31229#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31225#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:33,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {31233#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31229#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:33,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {31237#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {31233#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:33,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {31237#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {31237#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:33,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {31244#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31237#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:33,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {31248#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31244#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:33,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {31252#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31248#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:33,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {31256#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31252#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:33,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {31260#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31256#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:33,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {31264#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31260#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:33,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {31268#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31264#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:33,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {31272#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31268#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:33,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {31063#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31272#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:33,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {31063#true} call #t~ret11 := main(); {31063#true} is VALID [2022-04-08 10:04:33,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31063#true} {31063#true} #61#return; {31063#true} is VALID [2022-04-08 10:04:33,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {31063#true} assume true; {31063#true} is VALID [2022-04-08 10:04:33,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {31063#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31063#true} is VALID [2022-04-08 10:04:33,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {31063#true} call ULTIMATE.init(); {31063#true} is VALID [2022-04-08 10:04:33,319 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:04:33,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398087036] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:33,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:33,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-08 10:04:33,319 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:33,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1711112293] [2022-04-08 10:04:33,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1711112293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:33,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:33,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:04:33,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432323835] [2022-04-08 10:04:33,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:33,320 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 10:04:33,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:33,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:33,336 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-08 10:04:33,337 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:04:33,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:33,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:04:33,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:04:33,337 INFO L87 Difference]: Start difference. First operand 107 states and 138 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:34,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:34,571 INFO L93 Difference]: Finished difference Result 132 states and 163 transitions. [2022-04-08 10:04:34,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:04:34,571 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 10:04:34,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:34,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 58 transitions. [2022-04-08 10:04:34,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 58 transitions. [2022-04-08 10:04:34,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 58 transitions. [2022-04-08 10:04:34,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:34,618 INFO L225 Difference]: With dead ends: 132 [2022-04-08 10:04:34,618 INFO L226 Difference]: Without dead ends: 118 [2022-04-08 10:04:34,619 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=414, Invalid=1656, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:04:34,619 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:34,619 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 85 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:04:34,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-08 10:04:34,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2022-04-08 10:04:34,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:34,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:34,881 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:34,881 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:34,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:34,883 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2022-04-08 10:04:34,883 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2022-04-08 10:04:34,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:34,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:34,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 118 states. [2022-04-08 10:04:34,884 INFO L87 Difference]: Start difference. First operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 118 states. [2022-04-08 10:04:34,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:34,885 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2022-04-08 10:04:34,885 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2022-04-08 10:04:34,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:34,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:34,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:34,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:34,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:34,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 139 transitions. [2022-04-08 10:04:34,887 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 139 transitions. Word has length 33 [2022-04-08 10:04:34,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:34,888 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 139 transitions. [2022-04-08 10:04:34,888 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:34,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 139 transitions. [2022-04-08 10:04:35,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 139 transitions. [2022-04-08 10:04:35,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:04:35,171 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:35,171 INFO L499 BasicCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:35,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:35,371 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-08 10:04:35,372 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:35,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:35,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1781599729, now seen corresponding path program 87 times [2022-04-08 10:04:35,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:35,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1415871550] [2022-04-08 10:04:35,375 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:35,375 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:35,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1781599729, now seen corresponding path program 88 times [2022-04-08 10:04:35,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:35,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816990342] [2022-04-08 10:04:35,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:35,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:35,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:35,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {32065#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32041#true} is VALID [2022-04-08 10:04:35,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {32041#true} assume true; {32041#true} is VALID [2022-04-08 10:04:35,740 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32041#true} {32041#true} #61#return; {32041#true} is VALID [2022-04-08 10:04:35,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {32041#true} call ULTIMATE.init(); {32065#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:35,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {32065#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32041#true} is VALID [2022-04-08 10:04:35,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {32041#true} assume true; {32041#true} is VALID [2022-04-08 10:04:35,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32041#true} {32041#true} #61#return; {32041#true} is VALID [2022-04-08 10:04:35,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {32041#true} call #t~ret11 := main(); {32041#true} is VALID [2022-04-08 10:04:35,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {32041#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32046#(= main_~y~0 0)} is VALID [2022-04-08 10:04:35,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {32046#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32047#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:35,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {32047#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32048#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:35,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {32048#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32049#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:35,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {32049#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32050#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:35,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {32050#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32051#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:35,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {32051#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32052#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:35,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {32052#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32053#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:35,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {32053#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32054#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:35,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {32054#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32055#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:35,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {32055#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32056#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:35,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {32056#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32057#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:35,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {32057#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32058#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:35,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {32058#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32059#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:35,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {32059#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32060#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:04:35,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {32060#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32061#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:04:35,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {32061#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32062#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:04:35,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {32062#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {32062#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:04:35,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {32062#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {32063#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:04:35,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {32063#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32064#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID [2022-04-08 10:04:35,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {32064#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {32042#false} is VALID [2022-04-08 10:04:35,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {32042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {32042#false} is VALID [2022-04-08 10:04:35,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {32042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {32042#false} is VALID [2022-04-08 10:04:35,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {32042#false} assume !(~y~0 % 4294967296 > 0); {32042#false} is VALID [2022-04-08 10:04:35,753 INFO L272 TraceCheckUtils]: 29: Hoare triple {32042#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {32042#false} is VALID [2022-04-08 10:04:35,754 INFO L290 TraceCheckUtils]: 30: Hoare triple {32042#false} ~cond := #in~cond; {32042#false} is VALID [2022-04-08 10:04:35,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {32042#false} assume 0 == ~cond; {32042#false} is VALID [2022-04-08 10:04:35,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {32042#false} assume !false; {32042#false} is VALID [2022-04-08 10:04:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:04:35,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:35,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816990342] [2022-04-08 10:04:35,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816990342] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:35,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782428888] [2022-04-08 10:04:35,754 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:04:35,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:35,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:35,755 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:35,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-08 10:04:35,806 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:04:35,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:35,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 10:04:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:35,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:36,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {32041#true} call ULTIMATE.init(); {32041#true} is VALID [2022-04-08 10:04:36,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {32041#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32041#true} is VALID [2022-04-08 10:04:36,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {32041#true} assume true; {32041#true} is VALID [2022-04-08 10:04:36,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32041#true} {32041#true} #61#return; {32041#true} is VALID [2022-04-08 10:04:36,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {32041#true} call #t~ret11 := main(); {32041#true} is VALID [2022-04-08 10:04:36,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {32041#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32046#(= main_~y~0 0)} is VALID [2022-04-08 10:04:36,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {32046#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32047#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:36,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {32047#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32048#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:36,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {32048#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32049#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:36,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {32049#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32050#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:36,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {32050#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32051#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:36,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {32051#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32052#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:36,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {32052#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32053#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:36,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {32053#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32054#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:36,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {32054#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32055#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:36,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {32055#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32056#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:36,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {32056#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32057#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:36,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {32057#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32058#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:36,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {32058#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32059#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:36,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {32059#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32060#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:04:36,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {32060#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32061#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:04:36,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {32061#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32062#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:04:36,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {32062#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {32062#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:04:36,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {32062#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {32063#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:04:36,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {32063#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32141#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:04:36,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {32141#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {32042#false} is VALID [2022-04-08 10:04:36,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {32042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {32042#false} is VALID [2022-04-08 10:04:36,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {32042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {32042#false} is VALID [2022-04-08 10:04:36,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {32042#false} assume !(~y~0 % 4294967296 > 0); {32042#false} is VALID [2022-04-08 10:04:36,216 INFO L272 TraceCheckUtils]: 29: Hoare triple {32042#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {32042#false} is VALID [2022-04-08 10:04:36,216 INFO L290 TraceCheckUtils]: 30: Hoare triple {32042#false} ~cond := #in~cond; {32042#false} is VALID [2022-04-08 10:04:36,216 INFO L290 TraceCheckUtils]: 31: Hoare triple {32042#false} assume 0 == ~cond; {32042#false} is VALID [2022-04-08 10:04:36,216 INFO L290 TraceCheckUtils]: 32: Hoare triple {32042#false} assume !false; {32042#false} is VALID [2022-04-08 10:04:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:04:36,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:36,822 INFO L290 TraceCheckUtils]: 32: Hoare triple {32042#false} assume !false; {32042#false} is VALID [2022-04-08 10:04:36,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {32042#false} assume 0 == ~cond; {32042#false} is VALID [2022-04-08 10:04:36,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {32042#false} ~cond := #in~cond; {32042#false} is VALID [2022-04-08 10:04:36,822 INFO L272 TraceCheckUtils]: 29: Hoare triple {32042#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {32042#false} is VALID [2022-04-08 10:04:36,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {32042#false} assume !(~y~0 % 4294967296 > 0); {32042#false} is VALID [2022-04-08 10:04:36,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {32042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {32042#false} is VALID [2022-04-08 10:04:36,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {32042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {32042#false} is VALID [2022-04-08 10:04:36,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {32187#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {32042#false} is VALID [2022-04-08 10:04:36,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {32191#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32187#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:36,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {32195#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {32191#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:36,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {32195#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {32195#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:36,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {32202#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32195#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:36,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {32206#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32202#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:36,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {32210#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32206#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:36,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {32214#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32210#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:36,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {32218#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32214#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:36,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {32222#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32218#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:36,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {32226#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32222#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:36,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {32230#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32226#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:04:36,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {32234#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32230#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:36,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {32238#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32234#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:04:36,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {32242#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32238#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:04:36,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {32246#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32242#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:04:36,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {32250#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32246#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:04:36,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {32254#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32250#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:04:36,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {32258#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32254#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:04:36,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {32262#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32258#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:04:36,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {32041#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32262#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:04:36,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {32041#true} call #t~ret11 := main(); {32041#true} is VALID [2022-04-08 10:04:36,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32041#true} {32041#true} #61#return; {32041#true} is VALID [2022-04-08 10:04:36,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {32041#true} assume true; {32041#true} is VALID [2022-04-08 10:04:36,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {32041#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32041#true} is VALID [2022-04-08 10:04:36,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {32041#true} call ULTIMATE.init(); {32041#true} is VALID [2022-04-08 10:04:36,836 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:04:36,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782428888] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:36,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:36,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-08 10:04:36,836 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:36,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1415871550] [2022-04-08 10:04:36,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1415871550] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:36,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:36,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:04:36,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708148677] [2022-04-08 10:04:36,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:36,837 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 10:04:36,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:36,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:36,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:36,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:04:36,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:36,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:04:36,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=1346, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:04:36,859 INFO L87 Difference]: Start difference. First operand 108 states and 139 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:39,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:39,434 INFO L93 Difference]: Finished difference Result 169 states and 239 transitions. [2022-04-08 10:04:39,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:04:39,434 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 10:04:39,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 118 transitions. [2022-04-08 10:04:39,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 118 transitions. [2022-04-08 10:04:39,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 118 transitions. [2022-04-08 10:04:39,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:39,528 INFO L225 Difference]: With dead ends: 169 [2022-04-08 10:04:39,528 INFO L226 Difference]: Without dead ends: 161 [2022-04-08 10:04:39,529 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=808, Invalid=2974, Unknown=0, NotChecked=0, Total=3782 [2022-04-08 10:04:39,529 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 91 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:39,529 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 130 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:04:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-08 10:04:39,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 114. [2022-04-08 10:04:39,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:39,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 114 states, 109 states have (on average 1.311926605504587) internal successors, (143), 109 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:39,818 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 114 states, 109 states have (on average 1.311926605504587) internal successors, (143), 109 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:39,818 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 114 states, 109 states have (on average 1.311926605504587) internal successors, (143), 109 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:39,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:39,819 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2022-04-08 10:04:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2022-04-08 10:04:39,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:39,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:39,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 109 states have (on average 1.311926605504587) internal successors, (143), 109 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-08 10:04:39,820 INFO L87 Difference]: Start difference. First operand has 114 states, 109 states have (on average 1.311926605504587) internal successors, (143), 109 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-08 10:04:39,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:39,822 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2022-04-08 10:04:39,822 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2022-04-08 10:04:39,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:39,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:39,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:39,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:39,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.311926605504587) internal successors, (143), 109 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:39,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 147 transitions. [2022-04-08 10:04:39,823 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 147 transitions. Word has length 33 [2022-04-08 10:04:39,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:39,823 INFO L478 AbstractCegarLoop]: Abstraction has 114 states and 147 transitions. [2022-04-08 10:04:39,823 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:39,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 147 transitions. [2022-04-08 10:04:40,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:40,058 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 147 transitions. [2022-04-08 10:04:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:04:40,058 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:40,058 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:40,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:40,271 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:40,271 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:40,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:40,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1579041151, now seen corresponding path program 89 times [2022-04-08 10:04:40,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:40,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1076754942] [2022-04-08 10:04:40,274 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:40,274 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:40,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1579041151, now seen corresponding path program 90 times [2022-04-08 10:04:40,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:40,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711526454] [2022-04-08 10:04:40,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:40,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:40,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:40,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {33231#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33211#true} is VALID [2022-04-08 10:04:40,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {33211#true} assume true; {33211#true} is VALID [2022-04-08 10:04:40,514 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33211#true} {33211#true} #61#return; {33211#true} is VALID [2022-04-08 10:04:40,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {33211#true} call ULTIMATE.init(); {33231#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:40,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {33231#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33211#true} is VALID [2022-04-08 10:04:40,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {33211#true} assume true; {33211#true} is VALID [2022-04-08 10:04:40,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33211#true} {33211#true} #61#return; {33211#true} is VALID [2022-04-08 10:04:40,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {33211#true} call #t~ret11 := main(); {33211#true} is VALID [2022-04-08 10:04:40,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {33211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33216#(= main_~y~0 0)} is VALID [2022-04-08 10:04:40,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {33216#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:40,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {33217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:40,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {33218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:40,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {33219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:40,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {33220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:40,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {33221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:40,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {33222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:40,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {33223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {33223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:40,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {33223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {33224#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:40,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {33224#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33225#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:40,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {33225#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33226#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:40,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {33226#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33227#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:04:40,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {33227#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33228#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:04:40,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {33228#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33229#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:04:40,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {33229#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33230#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:04:40,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {33230#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {33212#false} is VALID [2022-04-08 10:04:40,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-08 10:04:40,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-08 10:04:40,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-08 10:04:40,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-08 10:04:40,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-08 10:04:40,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-08 10:04:40,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-08 10:04:40,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {33212#false} assume !(~y~0 % 4294967296 > 0); {33212#false} is VALID [2022-04-08 10:04:40,526 INFO L272 TraceCheckUtils]: 30: Hoare triple {33212#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {33212#false} is VALID [2022-04-08 10:04:40,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {33212#false} ~cond := #in~cond; {33212#false} is VALID [2022-04-08 10:04:40,526 INFO L290 TraceCheckUtils]: 32: Hoare triple {33212#false} assume 0 == ~cond; {33212#false} is VALID [2022-04-08 10:04:40,526 INFO L290 TraceCheckUtils]: 33: Hoare triple {33212#false} assume !false; {33212#false} is VALID [2022-04-08 10:04:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:04:40,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:40,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711526454] [2022-04-08 10:04:40,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711526454] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:40,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781695383] [2022-04-08 10:04:40,526 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:04:40,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:40,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:40,532 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:40,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-08 10:04:40,649 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:04:40,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:40,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 10:04:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:40,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:40,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {33211#true} call ULTIMATE.init(); {33211#true} is VALID [2022-04-08 10:04:40,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {33211#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33211#true} is VALID [2022-04-08 10:04:40,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {33211#true} assume true; {33211#true} is VALID [2022-04-08 10:04:40,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33211#true} {33211#true} #61#return; {33211#true} is VALID [2022-04-08 10:04:40,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {33211#true} call #t~ret11 := main(); {33211#true} is VALID [2022-04-08 10:04:40,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {33211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33216#(= main_~y~0 0)} is VALID [2022-04-08 10:04:40,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {33216#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:40,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {33217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:40,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {33218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:40,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {33219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:40,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {33220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:40,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {33221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:40,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {33222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:40,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {33223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {33223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:40,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {33223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {33277#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:40,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {33277#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33281#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:04:40,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {33281#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33285#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:04:40,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {33285#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33289#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:40,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {33289#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33293#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:40,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {33293#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33297#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} is VALID [2022-04-08 10:04:40,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {33297#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33301#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)))} is VALID [2022-04-08 10:04:40,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {33301#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {33212#false} is VALID [2022-04-08 10:04:40,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-08 10:04:40,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-08 10:04:40,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-08 10:04:40,961 INFO L290 TraceCheckUtils]: 25: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-08 10:04:40,961 INFO L290 TraceCheckUtils]: 26: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-08 10:04:40,961 INFO L290 TraceCheckUtils]: 27: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-08 10:04:40,961 INFO L290 TraceCheckUtils]: 28: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-08 10:04:40,961 INFO L290 TraceCheckUtils]: 29: Hoare triple {33212#false} assume !(~y~0 % 4294967296 > 0); {33212#false} is VALID [2022-04-08 10:04:40,961 INFO L272 TraceCheckUtils]: 30: Hoare triple {33212#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {33212#false} is VALID [2022-04-08 10:04:40,961 INFO L290 TraceCheckUtils]: 31: Hoare triple {33212#false} ~cond := #in~cond; {33212#false} is VALID [2022-04-08 10:04:40,961 INFO L290 TraceCheckUtils]: 32: Hoare triple {33212#false} assume 0 == ~cond; {33212#false} is VALID [2022-04-08 10:04:40,961 INFO L290 TraceCheckUtils]: 33: Hoare triple {33212#false} assume !false; {33212#false} is VALID [2022-04-08 10:04:40,961 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:04:40,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:41,410 INFO L290 TraceCheckUtils]: 33: Hoare triple {33212#false} assume !false; {33212#false} is VALID [2022-04-08 10:04:41,411 INFO L290 TraceCheckUtils]: 32: Hoare triple {33212#false} assume 0 == ~cond; {33212#false} is VALID [2022-04-08 10:04:41,411 INFO L290 TraceCheckUtils]: 31: Hoare triple {33212#false} ~cond := #in~cond; {33212#false} is VALID [2022-04-08 10:04:41,411 INFO L272 TraceCheckUtils]: 30: Hoare triple {33212#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {33212#false} is VALID [2022-04-08 10:04:41,411 INFO L290 TraceCheckUtils]: 29: Hoare triple {33212#false} assume !(~y~0 % 4294967296 > 0); {33212#false} is VALID [2022-04-08 10:04:41,411 INFO L290 TraceCheckUtils]: 28: Hoare triple {33356#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-08 10:04:41,412 INFO L290 TraceCheckUtils]: 27: Hoare triple {33360#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33356#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:04:41,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {33364#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33360#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:04:41,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {33368#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33364#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:04:41,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {33372#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33368#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:04:41,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {33376#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33372#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:04:41,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {33380#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33376#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:04:41,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {33384#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {33380#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:04:41,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {33388#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33384#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:04:41,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {33392#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33388#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:04:41,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {33396#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33392#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:04:41,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {33400#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33396#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:04:41,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {33404#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33400#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:04:41,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {33408#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33404#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:04:41,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {33211#true} ~z~0 := ~y~0; {33408#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:04:41,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {33211#true} assume !(~x~0 % 4294967296 > 0); {33211#true} is VALID [2022-04-08 10:04:41,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {33211#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33211#true} is VALID [2022-04-08 10:04:41,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {33211#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33211#true} is VALID [2022-04-08 10:04:41,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {33211#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33211#true} is VALID [2022-04-08 10:04:41,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {33211#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33211#true} is VALID [2022-04-08 10:04:41,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {33211#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33211#true} is VALID [2022-04-08 10:04:41,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {33211#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33211#true} is VALID [2022-04-08 10:04:41,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {33211#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33211#true} is VALID [2022-04-08 10:04:41,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {33211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33211#true} is VALID [2022-04-08 10:04:41,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {33211#true} call #t~ret11 := main(); {33211#true} is VALID [2022-04-08 10:04:41,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33211#true} {33211#true} #61#return; {33211#true} is VALID [2022-04-08 10:04:41,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {33211#true} assume true; {33211#true} is VALID [2022-04-08 10:04:41,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {33211#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33211#true} is VALID [2022-04-08 10:04:41,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {33211#true} call ULTIMATE.init(); {33211#true} is VALID [2022-04-08 10:04:41,425 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:04:41,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781695383] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:41,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:41,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 16] total 39 [2022-04-08 10:04:41,425 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:41,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1076754942] [2022-04-08 10:04:41,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1076754942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:41,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:41,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:04:41,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54211066] [2022-04-08 10:04:41,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:41,426 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 10:04:41,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:41,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:41,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:41,449 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:04:41,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:41,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:04:41,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1279, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 10:04:41,450 INFO L87 Difference]: Start difference. First operand 114 states and 147 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:42,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:42,747 INFO L93 Difference]: Finished difference Result 137 states and 170 transitions. [2022-04-08 10:04:42,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:04:42,747 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 10:04:42,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 52 transitions. [2022-04-08 10:04:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 52 transitions. [2022-04-08 10:04:42,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 52 transitions. [2022-04-08 10:04:42,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:42,789 INFO L225 Difference]: With dead ends: 137 [2022-04-08 10:04:42,789 INFO L226 Difference]: Without dead ends: 124 [2022-04-08 10:04:42,789 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=347, Invalid=2515, Unknown=0, NotChecked=0, Total=2862 [2022-04-08 10:04:42,790 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:42,790 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 88 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:04:42,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-08 10:04:43,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 115. [2022-04-08 10:04:43,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:43,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:43,078 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:43,078 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:43,079 INFO L93 Difference]: Finished difference Result 124 states and 157 transitions. [2022-04-08 10:04:43,079 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2022-04-08 10:04:43,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:43,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:43,080 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-08 10:04:43,080 INFO L87 Difference]: Start difference. First operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-08 10:04:43,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:43,081 INFO L93 Difference]: Finished difference Result 124 states and 157 transitions. [2022-04-08 10:04:43,081 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2022-04-08 10:04:43,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:43,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:43,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:43,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:43,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 148 transitions. [2022-04-08 10:04:43,083 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 148 transitions. Word has length 34 [2022-04-08 10:04:43,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:43,084 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 148 transitions. [2022-04-08 10:04:43,084 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:43,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 148 transitions. [2022-04-08 10:04:43,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 148 transitions. [2022-04-08 10:04:43,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:04:43,321 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:43,321 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:43,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-04-08 10:04:43,521 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-08 10:04:43,522 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:43,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:43,522 INFO L85 PathProgramCache]: Analyzing trace with hash 661878733, now seen corresponding path program 91 times [2022-04-08 10:04:43,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:43,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [431015310] [2022-04-08 10:04:43,524 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:43,524 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:43,524 INFO L85 PathProgramCache]: Analyzing trace with hash 661878733, now seen corresponding path program 92 times [2022-04-08 10:04:43,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:43,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162850459] [2022-04-08 10:04:43,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:43,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:43,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:43,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {34257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34238#true} is VALID [2022-04-08 10:04:43,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {34238#true} assume true; {34238#true} is VALID [2022-04-08 10:04:43,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34238#true} {34238#true} #61#return; {34238#true} is VALID [2022-04-08 10:04:43,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {34238#true} call ULTIMATE.init(); {34257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:43,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {34257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34238#true} is VALID [2022-04-08 10:04:43,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {34238#true} assume true; {34238#true} is VALID [2022-04-08 10:04:43,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34238#true} {34238#true} #61#return; {34238#true} is VALID [2022-04-08 10:04:43,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {34238#true} call #t~ret11 := main(); {34238#true} is VALID [2022-04-08 10:04:43,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {34238#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34243#(= main_~y~0 0)} is VALID [2022-04-08 10:04:43,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {34243#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34244#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:43,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {34244#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:43,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {34245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34246#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:43,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {34246#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34247#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:43,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {34247#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34248#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:43,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {34248#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34249#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:43,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {34249#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34250#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:43,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {34250#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34251#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:43,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {34251#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {34251#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:43,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {34251#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {34252#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:43,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {34252#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34253#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:43,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {34253#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34254#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:43,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {34254#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34255#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:43,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {34255#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34256#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:43,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {34256#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {34239#false} is VALID [2022-04-08 10:04:43,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:43,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:43,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:43,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:43,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:43,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:43,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:43,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:43,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {34239#false} assume !(~y~0 % 4294967296 > 0); {34239#false} is VALID [2022-04-08 10:04:43,770 INFO L272 TraceCheckUtils]: 30: Hoare triple {34239#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {34239#false} is VALID [2022-04-08 10:04:43,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {34239#false} ~cond := #in~cond; {34239#false} is VALID [2022-04-08 10:04:43,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {34239#false} assume 0 == ~cond; {34239#false} is VALID [2022-04-08 10:04:43,771 INFO L290 TraceCheckUtils]: 33: Hoare triple {34239#false} assume !false; {34239#false} is VALID [2022-04-08 10:04:43,771 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:04:43,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:43,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162850459] [2022-04-08 10:04:43,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162850459] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:43,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127311312] [2022-04-08 10:04:43,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:04:43,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:43,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:43,776 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:43,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-08 10:04:43,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:04:43,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:43,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:04:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:43,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:44,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {34238#true} call ULTIMATE.init(); {34238#true} is VALID [2022-04-08 10:04:44,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {34238#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34238#true} is VALID [2022-04-08 10:04:44,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {34238#true} assume true; {34238#true} is VALID [2022-04-08 10:04:44,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34238#true} {34238#true} #61#return; {34238#true} is VALID [2022-04-08 10:04:44,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {34238#true} call #t~ret11 := main(); {34238#true} is VALID [2022-04-08 10:04:44,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {34238#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34243#(= main_~y~0 0)} is VALID [2022-04-08 10:04:44,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {34243#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34244#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:44,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {34244#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:44,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {34245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34246#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:44,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {34246#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34247#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:44,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {34247#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34248#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:44,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {34248#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34249#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:44,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {34249#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34250#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:44,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {34250#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34251#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:44,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {34251#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {34251#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:44,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {34251#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {34252#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:44,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {34252#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34253#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:44,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {34253#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34254#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:44,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {34254#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34255#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:44,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {34255#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34318#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:04:44,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {34318#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {34239#false} is VALID [2022-04-08 10:04:44,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:44,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:44,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:44,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:44,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:44,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:44,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:44,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:44,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {34239#false} assume !(~y~0 % 4294967296 > 0); {34239#false} is VALID [2022-04-08 10:04:44,180 INFO L272 TraceCheckUtils]: 30: Hoare triple {34239#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {34239#false} is VALID [2022-04-08 10:04:44,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {34239#false} ~cond := #in~cond; {34239#false} is VALID [2022-04-08 10:04:44,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {34239#false} assume 0 == ~cond; {34239#false} is VALID [2022-04-08 10:04:44,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {34239#false} assume !false; {34239#false} is VALID [2022-04-08 10:04:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:04:44,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:44,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {34239#false} assume !false; {34239#false} is VALID [2022-04-08 10:04:44,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {34239#false} assume 0 == ~cond; {34239#false} is VALID [2022-04-08 10:04:44,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {34239#false} ~cond := #in~cond; {34239#false} is VALID [2022-04-08 10:04:44,535 INFO L272 TraceCheckUtils]: 30: Hoare triple {34239#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {34239#false} is VALID [2022-04-08 10:04:44,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {34239#false} assume !(~y~0 % 4294967296 > 0); {34239#false} is VALID [2022-04-08 10:04:44,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:44,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:44,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:44,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:44,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:44,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:44,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:44,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-08 10:04:44,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {34400#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {34239#false} is VALID [2022-04-08 10:04:44,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {34404#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34400#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:44,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {34408#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34404#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:44,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {34412#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34408#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:44,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {34416#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34412#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:44,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {34420#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {34416#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:04:44,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {34420#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {34420#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:44,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {34427#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34420#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:44,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {34431#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34427#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:44,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {34435#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34431#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:44,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {34439#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34435#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:44,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {34443#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34439#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:44,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {34447#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34443#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:44,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {34451#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34447#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:44,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {34455#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34451#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:44,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {34238#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34455#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:44,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {34238#true} call #t~ret11 := main(); {34238#true} is VALID [2022-04-08 10:04:44,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34238#true} {34238#true} #61#return; {34238#true} is VALID [2022-04-08 10:04:44,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {34238#true} assume true; {34238#true} is VALID [2022-04-08 10:04:44,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {34238#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34238#true} is VALID [2022-04-08 10:04:44,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {34238#true} call ULTIMATE.init(); {34238#true} is VALID [2022-04-08 10:04:44,545 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:04:44,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127311312] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:44,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:44,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-08 10:04:44,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:44,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [431015310] [2022-04-08 10:04:44,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [431015310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:44,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:44,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:04:44,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547763813] [2022-04-08 10:04:44,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:44,546 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 10:04:44,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:44,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:44,569 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-08 10:04:44,570 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:04:44,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:44,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:04:44,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:04:44,570 INFO L87 Difference]: Start difference. First operand 115 states and 148 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:45,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:45,953 INFO L93 Difference]: Finished difference Result 140 states and 173 transitions. [2022-04-08 10:04:45,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:04:45,953 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 10:04:45,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:45,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 60 transitions. [2022-04-08 10:04:45,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 60 transitions. [2022-04-08 10:04:45,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 60 transitions. [2022-04-08 10:04:46,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:46,002 INFO L225 Difference]: With dead ends: 140 [2022-04-08 10:04:46,003 INFO L226 Difference]: Without dead ends: 126 [2022-04-08 10:04:46,003 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=474, Invalid=1976, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:04:46,003 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:46,003 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 85 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:04:46,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-08 10:04:46,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2022-04-08 10:04:46,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:46,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 116 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 111 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:46,300 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 116 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 111 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:46,300 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 116 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 111 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:46,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:46,301 INFO L93 Difference]: Finished difference Result 126 states and 159 transitions. [2022-04-08 10:04:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 159 transitions. [2022-04-08 10:04:46,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:46,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:46,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 111 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 126 states. [2022-04-08 10:04:46,302 INFO L87 Difference]: Start difference. First operand has 116 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 111 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 126 states. [2022-04-08 10:04:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:46,303 INFO L93 Difference]: Finished difference Result 126 states and 159 transitions. [2022-04-08 10:04:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 159 transitions. [2022-04-08 10:04:46,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:46,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:46,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:46,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 111 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 149 transitions. [2022-04-08 10:04:46,305 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 149 transitions. Word has length 34 [2022-04-08 10:04:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:46,305 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 149 transitions. [2022-04-08 10:04:46,306 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:46,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 149 transitions. [2022-04-08 10:04:46,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:46,549 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 149 transitions. [2022-04-08 10:04:46,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:04:46,549 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:46,549 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:46,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-04-08 10:04:46,750 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:46,750 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:46,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:46,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2379647, now seen corresponding path program 93 times [2022-04-08 10:04:46,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:46,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [262309167] [2022-04-08 10:04:46,753 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:46,753 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:46,753 INFO L85 PathProgramCache]: Analyzing trace with hash 2379647, now seen corresponding path program 94 times [2022-04-08 10:04:46,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:46,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660789134] [2022-04-08 10:04:46,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:46,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:46,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:46,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {35294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35276#true} is VALID [2022-04-08 10:04:46,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {35276#true} assume true; {35276#true} is VALID [2022-04-08 10:04:46,959 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35276#true} {35276#true} #61#return; {35276#true} is VALID [2022-04-08 10:04:46,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {35276#true} call ULTIMATE.init(); {35294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:46,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {35294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35276#true} is VALID [2022-04-08 10:04:46,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {35276#true} assume true; {35276#true} is VALID [2022-04-08 10:04:46,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35276#true} {35276#true} #61#return; {35276#true} is VALID [2022-04-08 10:04:46,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {35276#true} call #t~ret11 := main(); {35276#true} is VALID [2022-04-08 10:04:46,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {35276#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35281#(= main_~y~0 0)} is VALID [2022-04-08 10:04:46,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {35281#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35282#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:46,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {35282#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35283#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:46,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {35283#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35284#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:46,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {35284#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35285#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:46,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {35285#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35286#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:46,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {35286#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35287#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:46,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {35287#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35288#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:46,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {35288#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35289#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:46,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {35289#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35290#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:46,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {35290#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {35290#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:46,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {35290#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {35291#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:04:46,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {35291#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35292#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:46,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {35292#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35293#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:46,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {35293#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {35277#false} is VALID [2022-04-08 10:04:46,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:46,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:46,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:46,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:46,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:46,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:46,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:46,967 INFO L290 TraceCheckUtils]: 27: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:46,967 INFO L290 TraceCheckUtils]: 28: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:46,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {35277#false} assume !(~y~0 % 4294967296 > 0); {35277#false} is VALID [2022-04-08 10:04:46,967 INFO L272 TraceCheckUtils]: 30: Hoare triple {35277#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {35277#false} is VALID [2022-04-08 10:04:46,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {35277#false} ~cond := #in~cond; {35277#false} is VALID [2022-04-08 10:04:46,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {35277#false} assume 0 == ~cond; {35277#false} is VALID [2022-04-08 10:04:46,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {35277#false} assume !false; {35277#false} is VALID [2022-04-08 10:04:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:04:46,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:46,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660789134] [2022-04-08 10:04:46,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660789134] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:46,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83482851] [2022-04-08 10:04:46,968 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:04:46,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:46,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:46,970 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:46,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-08 10:04:47,011 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:04:47,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:47,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:04:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:47,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:47,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {35276#true} call ULTIMATE.init(); {35276#true} is VALID [2022-04-08 10:04:47,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {35276#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35276#true} is VALID [2022-04-08 10:04:47,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {35276#true} assume true; {35276#true} is VALID [2022-04-08 10:04:47,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35276#true} {35276#true} #61#return; {35276#true} is VALID [2022-04-08 10:04:47,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {35276#true} call #t~ret11 := main(); {35276#true} is VALID [2022-04-08 10:04:47,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {35276#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35281#(= main_~y~0 0)} is VALID [2022-04-08 10:04:47,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {35281#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35282#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:47,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {35282#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35283#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:47,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {35283#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35284#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:47,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {35284#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35285#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:47,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {35285#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35286#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:47,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {35286#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35287#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:47,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {35287#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35288#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:47,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {35288#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35289#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:47,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {35289#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35290#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:47,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {35290#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {35290#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:47,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {35290#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {35291#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:04:47,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {35291#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35292#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:47,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {35292#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35352#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:47,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {35352#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {35277#false} is VALID [2022-04-08 10:04:47,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:47,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:47,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:47,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:47,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:47,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:47,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:47,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:47,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:47,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {35277#false} assume !(~y~0 % 4294967296 > 0); {35277#false} is VALID [2022-04-08 10:04:47,278 INFO L272 TraceCheckUtils]: 30: Hoare triple {35277#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {35277#false} is VALID [2022-04-08 10:04:47,278 INFO L290 TraceCheckUtils]: 31: Hoare triple {35277#false} ~cond := #in~cond; {35277#false} is VALID [2022-04-08 10:04:47,278 INFO L290 TraceCheckUtils]: 32: Hoare triple {35277#false} assume 0 == ~cond; {35277#false} is VALID [2022-04-08 10:04:47,278 INFO L290 TraceCheckUtils]: 33: Hoare triple {35277#false} assume !false; {35277#false} is VALID [2022-04-08 10:04:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:04:47,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:47,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {35277#false} assume !false; {35277#false} is VALID [2022-04-08 10:04:47,605 INFO L290 TraceCheckUtils]: 32: Hoare triple {35277#false} assume 0 == ~cond; {35277#false} is VALID [2022-04-08 10:04:47,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {35277#false} ~cond := #in~cond; {35277#false} is VALID [2022-04-08 10:04:47,605 INFO L272 TraceCheckUtils]: 30: Hoare triple {35277#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {35277#false} is VALID [2022-04-08 10:04:47,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {35277#false} assume !(~y~0 % 4294967296 > 0); {35277#false} is VALID [2022-04-08 10:04:47,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:47,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:47,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:47,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:47,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:47,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:47,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:47,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:47,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-08 10:04:47,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {35440#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {35277#false} is VALID [2022-04-08 10:04:47,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {35444#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35440#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:47,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {35448#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35444#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:47,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {35452#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {35448#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:47,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {35452#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {35452#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:47,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {35459#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35452#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:47,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {35463#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35459#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:47,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {35467#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35463#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:47,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {35471#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35467#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:47,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {35475#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35471#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:47,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {35479#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35475#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:47,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {35483#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35479#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:47,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {35487#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35483#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:47,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {35491#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35487#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:04:47,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {35276#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35491#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:47,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {35276#true} call #t~ret11 := main(); {35276#true} is VALID [2022-04-08 10:04:47,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35276#true} {35276#true} #61#return; {35276#true} is VALID [2022-04-08 10:04:47,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {35276#true} assume true; {35276#true} is VALID [2022-04-08 10:04:47,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {35276#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35276#true} is VALID [2022-04-08 10:04:47,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {35276#true} call ULTIMATE.init(); {35276#true} is VALID [2022-04-08 10:04:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:04:47,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83482851] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:47,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:47,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-08 10:04:47,615 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:47,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [262309167] [2022-04-08 10:04:47,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [262309167] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:47,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:47,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:04:47,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026065432] [2022-04-08 10:04:47,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:47,615 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 10:04:47,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:47,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:47,632 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-08 10:04:47,632 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:04:47,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:47,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:04:47,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=701, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:04:47,632 INFO L87 Difference]: Start difference. First operand 116 states and 149 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:48,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:48,924 INFO L93 Difference]: Finished difference Result 143 states and 176 transitions. [2022-04-08 10:04:48,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:04:48,924 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 10:04:48,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 63 transitions. [2022-04-08 10:04:48,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 63 transitions. [2022-04-08 10:04:48,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 63 transitions. [2022-04-08 10:04:48,973 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-08 10:04:48,975 INFO L225 Difference]: With dead ends: 143 [2022-04-08 10:04:48,975 INFO L226 Difference]: Without dead ends: 128 [2022-04-08 10:04:48,976 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=426, Invalid=1644, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:04:48,976 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:48,976 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 85 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:04:48,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-08 10:04:49,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2022-04-08 10:04:49,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:49,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 117 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 112 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:49,293 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 117 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 112 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:49,293 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 117 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 112 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:49,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:49,294 INFO L93 Difference]: Finished difference Result 128 states and 161 transitions. [2022-04-08 10:04:49,294 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 161 transitions. [2022-04-08 10:04:49,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:49,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:49,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 112 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 128 states. [2022-04-08 10:04:49,295 INFO L87 Difference]: Start difference. First operand has 117 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 112 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 128 states. [2022-04-08 10:04:49,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:49,296 INFO L93 Difference]: Finished difference Result 128 states and 161 transitions. [2022-04-08 10:04:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 161 transitions. [2022-04-08 10:04:49,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:49,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:49,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:49,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 112 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 150 transitions. [2022-04-08 10:04:49,297 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 150 transitions. Word has length 34 [2022-04-08 10:04:49,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:49,297 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 150 transitions. [2022-04-08 10:04:49,298 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:49,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 150 transitions. [2022-04-08 10:04:49,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:49,536 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 150 transitions. [2022-04-08 10:04:49,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:04:49,536 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:49,536 INFO L499 BasicCegarLoop]: trace histogram [17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:49,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-04-08 10:04:49,736 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-04-08 10:04:49,737 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:49,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:49,737 INFO L85 PathProgramCache]: Analyzing trace with hash 61432078, now seen corresponding path program 95 times [2022-04-08 10:04:49,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:49,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [517072243] [2022-04-08 10:04:49,739 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:49,739 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:49,739 INFO L85 PathProgramCache]: Analyzing trace with hash 61432078, now seen corresponding path program 96 times [2022-04-08 10:04:49,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:49,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955780545] [2022-04-08 10:04:49,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:49,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:50,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:50,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {36345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36320#true} is VALID [2022-04-08 10:04:50,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {36320#true} assume true; {36320#true} is VALID [2022-04-08 10:04:50,118 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36320#true} {36320#true} #61#return; {36320#true} is VALID [2022-04-08 10:04:50,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {36320#true} call ULTIMATE.init(); {36345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:50,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {36345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36320#true} is VALID [2022-04-08 10:04:50,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {36320#true} assume true; {36320#true} is VALID [2022-04-08 10:04:50,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36320#true} {36320#true} #61#return; {36320#true} is VALID [2022-04-08 10:04:50,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {36320#true} call #t~ret11 := main(); {36320#true} is VALID [2022-04-08 10:04:50,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {36320#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36325#(= main_~y~0 0)} is VALID [2022-04-08 10:04:50,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {36325#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36326#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:50,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {36326#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36327#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:50,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {36327#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36328#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:50,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {36328#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36329#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:50,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {36329#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36330#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:50,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {36330#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36331#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:50,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {36331#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36332#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:50,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {36332#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36333#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:50,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {36333#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36334#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:50,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {36334#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36335#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:50,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {36335#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36336#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:50,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {36336#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36337#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:50,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {36337#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36338#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:50,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {36338#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36339#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:04:50,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {36339#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36340#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:04:50,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {36340#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36341#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:04:50,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {36341#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36342#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:04:50,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {36342#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {36342#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:04:50,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {36342#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {36343#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:04:50,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {36343#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36344#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:50,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {36344#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {36321#false} is VALID [2022-04-08 10:04:50,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {36321#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {36321#false} is VALID [2022-04-08 10:04:50,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {36321#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {36321#false} is VALID [2022-04-08 10:04:50,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {36321#false} assume !(~y~0 % 4294967296 > 0); {36321#false} is VALID [2022-04-08 10:04:50,133 INFO L272 TraceCheckUtils]: 30: Hoare triple {36321#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {36321#false} is VALID [2022-04-08 10:04:50,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {36321#false} ~cond := #in~cond; {36321#false} is VALID [2022-04-08 10:04:50,133 INFO L290 TraceCheckUtils]: 32: Hoare triple {36321#false} assume 0 == ~cond; {36321#false} is VALID [2022-04-08 10:04:50,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {36321#false} assume !false; {36321#false} is VALID [2022-04-08 10:04:50,133 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:04:50,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:50,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955780545] [2022-04-08 10:04:50,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955780545] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:50,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474505566] [2022-04-08 10:04:50,134 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:04:50,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:50,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:50,135 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:50,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-08 10:04:50,176 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:04:50,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:50,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 10:04:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:50,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:50,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {36320#true} call ULTIMATE.init(); {36320#true} is VALID [2022-04-08 10:04:50,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {36320#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36320#true} is VALID [2022-04-08 10:04:50,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {36320#true} assume true; {36320#true} is VALID [2022-04-08 10:04:50,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36320#true} {36320#true} #61#return; {36320#true} is VALID [2022-04-08 10:04:50,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {36320#true} call #t~ret11 := main(); {36320#true} is VALID [2022-04-08 10:04:50,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {36320#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36320#true} is VALID [2022-04-08 10:04:50,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {36320#true} assume !(~x~0 % 4294967296 > 0); {36320#true} is VALID [2022-04-08 10:04:50,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {36320#true} ~z~0 := ~y~0; {36421#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:04:50,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {36421#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36425#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:04:50,323 INFO L290 TraceCheckUtils]: 26: Hoare triple {36425#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {36429#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:04:50,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {36429#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {36433#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:04:50,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {36433#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {36321#false} is VALID [2022-04-08 10:04:50,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {36321#false} assume !(~y~0 % 4294967296 > 0); {36321#false} is VALID [2022-04-08 10:04:50,325 INFO L272 TraceCheckUtils]: 30: Hoare triple {36321#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {36321#false} is VALID [2022-04-08 10:04:50,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {36321#false} ~cond := #in~cond; {36321#false} is VALID [2022-04-08 10:04:50,325 INFO L290 TraceCheckUtils]: 32: Hoare triple {36321#false} assume 0 == ~cond; {36321#false} is VALID [2022-04-08 10:04:50,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {36321#false} assume !false; {36321#false} is VALID [2022-04-08 10:04:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-08 10:04:50,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:50,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {36321#false} assume !false; {36321#false} is VALID [2022-04-08 10:04:50,455 INFO L290 TraceCheckUtils]: 32: Hoare triple {36321#false} assume 0 == ~cond; {36321#false} is VALID [2022-04-08 10:04:50,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {36321#false} ~cond := #in~cond; {36321#false} is VALID [2022-04-08 10:04:50,455 INFO L272 TraceCheckUtils]: 30: Hoare triple {36321#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {36321#false} is VALID [2022-04-08 10:04:50,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {36321#false} assume !(~y~0 % 4294967296 > 0); {36321#false} is VALID [2022-04-08 10:04:50,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {36433#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {36321#false} is VALID [2022-04-08 10:04:50,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {36429#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {36433#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:04:50,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {36473#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {36429#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:04:50,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {36477#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36473#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:04:50,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {36320#true} ~z~0 := ~y~0; {36477#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:04:50,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {36320#true} assume !(~x~0 % 4294967296 > 0); {36320#true} is VALID [2022-04-08 10:04:50,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {36320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36320#true} is VALID [2022-04-08 10:04:50,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {36320#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36320#true} is VALID [2022-04-08 10:04:50,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {36320#true} call #t~ret11 := main(); {36320#true} is VALID [2022-04-08 10:04:50,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36320#true} {36320#true} #61#return; {36320#true} is VALID [2022-04-08 10:04:50,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {36320#true} assume true; {36320#true} is VALID [2022-04-08 10:04:50,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {36320#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36320#true} is VALID [2022-04-08 10:04:50,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {36320#true} call ULTIMATE.init(); {36320#true} is VALID [2022-04-08 10:04:50,459 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-08 10:04:50,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474505566] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:50,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:50,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 6, 6] total 29 [2022-04-08 10:04:50,460 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:50,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [517072243] [2022-04-08 10:04:50,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [517072243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:50,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:50,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:04:50,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823069203] [2022-04-08 10:04:50,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:50,460 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 10:04:50,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:50,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:50,489 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-08 10:04:50,489 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:04:50,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:50,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:04:50,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2022-04-08 10:04:50,490 INFO L87 Difference]: Start difference. First operand 117 states and 150 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:53,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:53,441 INFO L93 Difference]: Finished difference Result 179 states and 252 transitions. [2022-04-08 10:04:53,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:04:53,441 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 10:04:53,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 125 transitions. [2022-04-08 10:04:53,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 125 transitions. [2022-04-08 10:04:53,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 125 transitions. [2022-04-08 10:04:53,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:53,553 INFO L225 Difference]: With dead ends: 179 [2022-04-08 10:04:53,553 INFO L226 Difference]: Without dead ends: 171 [2022-04-08 10:04:53,554 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=2279, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:04:53,554 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 99 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:53,554 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 138 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1586 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-08 10:04:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-04-08 10:04:53,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 123. [2022-04-08 10:04:53,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:53,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 123 states, 118 states have (on average 1.305084745762712) internal successors, (154), 118 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:53,885 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 123 states, 118 states have (on average 1.305084745762712) internal successors, (154), 118 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:53,885 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 123 states, 118 states have (on average 1.305084745762712) internal successors, (154), 118 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:53,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:53,887 INFO L93 Difference]: Finished difference Result 171 states and 211 transitions. [2022-04-08 10:04:53,887 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 211 transitions. [2022-04-08 10:04:53,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:53,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:53,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 118 states have (on average 1.305084745762712) internal successors, (154), 118 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 171 states. [2022-04-08 10:04:53,887 INFO L87 Difference]: Start difference. First operand has 123 states, 118 states have (on average 1.305084745762712) internal successors, (154), 118 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 171 states. [2022-04-08 10:04:53,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:53,889 INFO L93 Difference]: Finished difference Result 171 states and 211 transitions. [2022-04-08 10:04:53,889 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 211 transitions. [2022-04-08 10:04:53,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:53,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:53,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:53,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:53,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.305084745762712) internal successors, (154), 118 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 158 transitions. [2022-04-08 10:04:53,891 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 158 transitions. Word has length 34 [2022-04-08 10:04:53,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:53,891 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 158 transitions. [2022-04-08 10:04:53,891 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:53,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 158 transitions. [2022-04-08 10:04:54,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:54,141 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 158 transitions. [2022-04-08 10:04:54,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 10:04:54,141 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:54,141 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:54,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-04-08 10:04:54,341 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-04-08 10:04:54,342 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:54,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:54,342 INFO L85 PathProgramCache]: Analyzing trace with hash 248285055, now seen corresponding path program 97 times [2022-04-08 10:04:54,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:54,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [34185165] [2022-04-08 10:04:54,344 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:54,344 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:54,344 INFO L85 PathProgramCache]: Analyzing trace with hash 248285055, now seen corresponding path program 98 times [2022-04-08 10:04:54,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:54,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709750283] [2022-04-08 10:04:54,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:54,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:54,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:54,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {37558#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37543#true} is VALID [2022-04-08 10:04:54,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {37543#true} assume true; {37543#true} is VALID [2022-04-08 10:04:54,533 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37543#true} {37543#true} #61#return; {37543#true} is VALID [2022-04-08 10:04:54,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {37543#true} call ULTIMATE.init(); {37558#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:54,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {37558#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37543#true} is VALID [2022-04-08 10:04:54,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {37543#true} assume true; {37543#true} is VALID [2022-04-08 10:04:54,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37543#true} {37543#true} #61#return; {37543#true} is VALID [2022-04-08 10:04:54,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {37543#true} call #t~ret11 := main(); {37543#true} is VALID [2022-04-08 10:04:54,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {37543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37543#true} is VALID [2022-04-08 10:04:54,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {37543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37543#true} is VALID [2022-04-08 10:04:54,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {37543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37543#true} is VALID [2022-04-08 10:04:54,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {37543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37543#true} is VALID [2022-04-08 10:04:54,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {37543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37543#true} is VALID [2022-04-08 10:04:54,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {37543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37543#true} is VALID [2022-04-08 10:04:54,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {37543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37543#true} is VALID [2022-04-08 10:04:54,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {37543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37543#true} is VALID [2022-04-08 10:04:54,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {37543#true} assume !(~x~0 % 4294967296 > 0); {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:54,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:54,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37549#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:04:54,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {37549#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37550#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:54,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {37550#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37551#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:54,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {37551#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37552#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:54,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {37552#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37553#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:04:54,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {37553#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37554#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:54,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {37554#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:54,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:54,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37554#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:54,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {37554#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37553#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:04:54,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {37553#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37552#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:54,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {37552#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37551#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:54,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {37551#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37550#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:54,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {37550#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37549#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:04:54,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {37549#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:54,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:54,550 INFO L272 TraceCheckUtils]: 31: Hoare triple {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {37556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:04:54,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {37556#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {37557#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:04:54,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {37557#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {37544#false} is VALID [2022-04-08 10:04:54,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {37544#false} assume !false; {37544#false} is VALID [2022-04-08 10:04:54,551 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:04:54,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:54,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709750283] [2022-04-08 10:04:54,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709750283] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:54,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14664390] [2022-04-08 10:04:54,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:04:54,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:54,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:54,552 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:54,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-08 10:04:54,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:04:54,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:54,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 10:04:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:54,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:54,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {37543#true} call ULTIMATE.init(); {37543#true} is VALID [2022-04-08 10:04:54,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {37543#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37543#true} is VALID [2022-04-08 10:04:54,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {37543#true} assume true; {37543#true} is VALID [2022-04-08 10:04:54,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37543#true} {37543#true} #61#return; {37543#true} is VALID [2022-04-08 10:04:54,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {37543#true} call #t~ret11 := main(); {37543#true} is VALID [2022-04-08 10:04:54,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {37543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37543#true} is VALID [2022-04-08 10:04:54,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {37543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37543#true} is VALID [2022-04-08 10:04:54,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {37543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37543#true} is VALID [2022-04-08 10:04:54,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {37543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37543#true} is VALID [2022-04-08 10:04:54,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {37543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37543#true} is VALID [2022-04-08 10:04:54,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {37543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37543#true} is VALID [2022-04-08 10:04:54,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {37543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37543#true} is VALID [2022-04-08 10:04:54,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {37543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37543#true} is VALID [2022-04-08 10:04:54,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {37543#true} assume !(~x~0 % 4294967296 > 0); {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:54,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:54,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37549#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:04:54,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {37549#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37550#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:54,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {37550#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37551#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:54,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {37551#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37552#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:54,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {37552#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37553#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:04:54,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {37553#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37554#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:54,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {37554#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:54,940 INFO L290 TraceCheckUtils]: 22: Hoare triple {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:54,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37554#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:54,941 INFO L290 TraceCheckUtils]: 24: Hoare triple {37554#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37553#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:04:54,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {37553#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37552#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:54,943 INFO L290 TraceCheckUtils]: 26: Hoare triple {37552#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37551#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:54,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {37551#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37550#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:54,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {37550#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37549#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:04:54,945 INFO L290 TraceCheckUtils]: 29: Hoare triple {37549#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:54,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:54,946 INFO L272 TraceCheckUtils]: 31: Hoare triple {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {37655#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:04:54,946 INFO L290 TraceCheckUtils]: 32: Hoare triple {37655#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37659#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:04:54,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {37659#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37544#false} is VALID [2022-04-08 10:04:54,946 INFO L290 TraceCheckUtils]: 34: Hoare triple {37544#false} assume !false; {37544#false} is VALID [2022-04-08 10:04:54,947 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:04:54,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:55,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {37544#false} assume !false; {37544#false} is VALID [2022-04-08 10:04:55,232 INFO L290 TraceCheckUtils]: 33: Hoare triple {37659#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37544#false} is VALID [2022-04-08 10:04:55,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {37655#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37659#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:04:55,233 INFO L272 TraceCheckUtils]: 31: Hoare triple {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {37655#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:04:55,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:55,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {37549#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:55,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {37550#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37549#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:04:55,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {37551#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37550#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:55,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {37552#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37551#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:55,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {37553#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37552#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:55,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {37554#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37553#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:04:55,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37554#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:55,241 INFO L290 TraceCheckUtils]: 22: Hoare triple {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:55,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {37554#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:55,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {37553#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37554#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:55,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {37552#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37553#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:04:55,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {37551#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37552#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:55,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {37550#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37551#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:55,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {37549#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37550#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:55,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37549#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:04:55,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:55,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {37543#true} assume !(~x~0 % 4294967296 > 0); {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:55,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {37543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37543#true} is VALID [2022-04-08 10:04:55,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {37543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37543#true} is VALID [2022-04-08 10:04:55,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {37543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37543#true} is VALID [2022-04-08 10:04:55,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {37543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37543#true} is VALID [2022-04-08 10:04:55,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {37543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37543#true} is VALID [2022-04-08 10:04:55,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {37543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37543#true} is VALID [2022-04-08 10:04:55,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {37543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37543#true} is VALID [2022-04-08 10:04:55,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {37543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37543#true} is VALID [2022-04-08 10:04:55,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {37543#true} call #t~ret11 := main(); {37543#true} is VALID [2022-04-08 10:04:55,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37543#true} {37543#true} #61#return; {37543#true} is VALID [2022-04-08 10:04:55,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {37543#true} assume true; {37543#true} is VALID [2022-04-08 10:04:55,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {37543#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37543#true} is VALID [2022-04-08 10:04:55,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {37543#true} call ULTIMATE.init(); {37543#true} is VALID [2022-04-08 10:04:55,247 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:04:55,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14664390] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:55,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:55,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 15 [2022-04-08 10:04:55,248 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:55,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [34185165] [2022-04-08 10:04:55,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [34185165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:55,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:55,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:04:55,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890622661] [2022-04-08 10:04:55,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:55,248 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) 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 35 [2022-04-08 10:04:55,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:55,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.9230769230769231) 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-08 10:04:55,272 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-08 10:04:55,272 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:04:55,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:55,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:04:55,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:04:55,272 INFO L87 Difference]: Start difference. First operand 123 states and 158 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) 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-08 10:04:57,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:57,407 INFO L93 Difference]: Finished difference Result 314 states and 413 transitions. [2022-04-08 10:04:57,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:04:57,407 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) 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 35 [2022-04-08 10:04:57,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.9230769230769231) 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-08 10:04:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-08 10:04:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.9230769230769231) 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-08 10:04:57,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-08 10:04:57,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 57 transitions. [2022-04-08 10:04:57,457 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-08 10:04:57,462 INFO L225 Difference]: With dead ends: 314 [2022-04-08 10:04:57,462 INFO L226 Difference]: Without dead ends: 301 [2022-04-08 10:04:57,462 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:04:57,462 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 32 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:57,462 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 84 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:04:57,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-08 10:04:57,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 127. [2022-04-08 10:04:57,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:57,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:57,805 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:57,805 INFO L87 Difference]: Start difference. First operand 301 states. Second operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:57,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:57,809 INFO L93 Difference]: Finished difference Result 301 states and 399 transitions. [2022-04-08 10:04:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 399 transitions. [2022-04-08 10:04:57,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:57,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:57,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 301 states. [2022-04-08 10:04:57,810 INFO L87 Difference]: Start difference. First operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 301 states. [2022-04-08 10:04:57,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:57,815 INFO L93 Difference]: Finished difference Result 301 states and 399 transitions. [2022-04-08 10:04:57,815 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 399 transitions. [2022-04-08 10:04:57,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:57,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:57,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:57,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:57,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 164 transitions. [2022-04-08 10:04:57,817 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 164 transitions. Word has length 35 [2022-04-08 10:04:57,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:57,818 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 164 transitions. [2022-04-08 10:04:57,818 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) 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-08 10:04:57,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 164 transitions. [2022-04-08 10:04:58,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:58,111 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 164 transitions. [2022-04-08 10:04:58,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 10:04:58,111 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:58,111 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:58,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:58,312 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:58,312 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:58,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:58,312 INFO L85 PathProgramCache]: Analyzing trace with hash 75330479, now seen corresponding path program 99 times [2022-04-08 10:04:58,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:58,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [449863605] [2022-04-08 10:04:58,315 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:58,315 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:58,315 INFO L85 PathProgramCache]: Analyzing trace with hash 75330479, now seen corresponding path program 100 times [2022-04-08 10:04:58,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:58,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52400899] [2022-04-08 10:04:58,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:58,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:58,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:58,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {39294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {39274#true} is VALID [2022-04-08 10:04:58,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {39274#true} assume true; {39274#true} is VALID [2022-04-08 10:04:58,537 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39274#true} {39274#true} #61#return; {39274#true} is VALID [2022-04-08 10:04:58,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {39274#true} call ULTIMATE.init(); {39294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:58,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {39294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {39274#true} is VALID [2022-04-08 10:04:58,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {39274#true} assume true; {39274#true} is VALID [2022-04-08 10:04:58,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39274#true} {39274#true} #61#return; {39274#true} is VALID [2022-04-08 10:04:58,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {39274#true} call #t~ret11 := main(); {39274#true} is VALID [2022-04-08 10:04:58,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {39274#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39279#(= main_~y~0 0)} is VALID [2022-04-08 10:04:58,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {39279#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39280#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:58,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {39280#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39281#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:58,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {39281#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39282#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:58,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {39282#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39283#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:58,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {39283#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39284#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:58,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {39284#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39285#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:58,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {39285#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39286#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:58,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {39286#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39287#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:58,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {39287#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {39287#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:58,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {39287#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {39288#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:58,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {39288#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39289#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:58,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {39289#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39290#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:58,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {39290#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39291#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:58,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {39291#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39292#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:04:58,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {39292#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39293#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:58,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {39293#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {39275#false} is VALID [2022-04-08 10:04:58,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-08 10:04:58,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-08 10:04:58,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-08 10:04:58,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-08 10:04:58,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-08 10:04:58,546 INFO L290 TraceCheckUtils]: 27: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-08 10:04:58,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-08 10:04:58,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-08 10:04:58,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {39275#false} assume !(~y~0 % 4294967296 > 0); {39275#false} is VALID [2022-04-08 10:04:58,546 INFO L272 TraceCheckUtils]: 31: Hoare triple {39275#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {39275#false} is VALID [2022-04-08 10:04:58,546 INFO L290 TraceCheckUtils]: 32: Hoare triple {39275#false} ~cond := #in~cond; {39275#false} is VALID [2022-04-08 10:04:58,546 INFO L290 TraceCheckUtils]: 33: Hoare triple {39275#false} assume 0 == ~cond; {39275#false} is VALID [2022-04-08 10:04:58,546 INFO L290 TraceCheckUtils]: 34: Hoare triple {39275#false} assume !false; {39275#false} is VALID [2022-04-08 10:04:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:04:58,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:58,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52400899] [2022-04-08 10:04:58,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52400899] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:58,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505438474] [2022-04-08 10:04:58,547 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:04:58,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:58,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:58,549 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:58,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-04-08 10:04:58,608 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:04:58,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:58,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-08 10:04:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:58,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:58,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {39274#true} call ULTIMATE.init(); {39274#true} is VALID [2022-04-08 10:04:58,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {39274#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {39274#true} is VALID [2022-04-08 10:04:58,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {39274#true} assume true; {39274#true} is VALID [2022-04-08 10:04:58,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39274#true} {39274#true} #61#return; {39274#true} is VALID [2022-04-08 10:04:58,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {39274#true} call #t~ret11 := main(); {39274#true} is VALID [2022-04-08 10:04:58,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {39274#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39279#(= main_~y~0 0)} is VALID [2022-04-08 10:04:58,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {39279#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39280#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:58,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {39280#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39281#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:58,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {39281#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39282#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:58,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {39282#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39283#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:58,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {39283#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39284#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:58,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {39284#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39285#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:58,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {39285#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39286#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:58,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {39286#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39287#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:58,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {39287#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {39287#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:58,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {39287#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {39343#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:58,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {39343#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39347#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:04:58,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {39347#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39351#(and (<= main_~y~0 8) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:58,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {39351#(and (<= main_~y~0 8) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39355#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:58,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {39355#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39359#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:58,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {39359#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39363#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:58,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {39363#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 8 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {39275#false} is VALID [2022-04-08 10:04:58,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-08 10:04:58,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-08 10:04:58,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-08 10:04:58,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-08 10:04:58,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-08 10:04:58,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-08 10:04:58,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-08 10:04:58,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-08 10:04:58,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {39275#false} assume !(~y~0 % 4294967296 > 0); {39275#false} is VALID [2022-04-08 10:04:58,904 INFO L272 TraceCheckUtils]: 31: Hoare triple {39275#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {39275#false} is VALID [2022-04-08 10:04:58,904 INFO L290 TraceCheckUtils]: 32: Hoare triple {39275#false} ~cond := #in~cond; {39275#false} is VALID [2022-04-08 10:04:58,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {39275#false} assume 0 == ~cond; {39275#false} is VALID [2022-04-08 10:04:58,904 INFO L290 TraceCheckUtils]: 34: Hoare triple {39275#false} assume !false; {39275#false} is VALID [2022-04-08 10:04:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:04:58,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:59,287 INFO L290 TraceCheckUtils]: 34: Hoare triple {39275#false} assume !false; {39275#false} is VALID [2022-04-08 10:04:59,287 INFO L290 TraceCheckUtils]: 33: Hoare triple {39275#false} assume 0 == ~cond; {39275#false} is VALID [2022-04-08 10:04:59,287 INFO L290 TraceCheckUtils]: 32: Hoare triple {39275#false} ~cond := #in~cond; {39275#false} is VALID [2022-04-08 10:04:59,287 INFO L272 TraceCheckUtils]: 31: Hoare triple {39275#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {39275#false} is VALID [2022-04-08 10:04:59,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {39275#false} assume !(~y~0 % 4294967296 > 0); {39275#false} is VALID [2022-04-08 10:04:59,287 INFO L290 TraceCheckUtils]: 29: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-08 10:04:59,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-08 10:04:59,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {39427#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-08 10:04:59,289 INFO L290 TraceCheckUtils]: 26: Hoare triple {39431#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39427#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:04:59,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {39435#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39431#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:04:59,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {39439#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39435#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:04:59,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {39443#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39439#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:04:59,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {39447#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39443#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:04:59,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {39451#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {39447#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:04:59,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {39455#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39451#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:04:59,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {39459#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39455#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:04:59,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {39463#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39459#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:04:59,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {39467#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39463#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:04:59,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {39471#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39467#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:04:59,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {39274#true} ~z~0 := ~y~0; {39471#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:04:59,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {39274#true} assume !(~x~0 % 4294967296 > 0); {39274#true} is VALID [2022-04-08 10:04:59,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {39274#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39274#true} is VALID [2022-04-08 10:04:59,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {39274#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39274#true} is VALID [2022-04-08 10:04:59,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {39274#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39274#true} is VALID [2022-04-08 10:04:59,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {39274#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39274#true} is VALID [2022-04-08 10:04:59,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {39274#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39274#true} is VALID [2022-04-08 10:04:59,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {39274#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39274#true} is VALID [2022-04-08 10:04:59,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {39274#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39274#true} is VALID [2022-04-08 10:04:59,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {39274#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39274#true} is VALID [2022-04-08 10:04:59,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {39274#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39274#true} is VALID [2022-04-08 10:04:59,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {39274#true} call #t~ret11 := main(); {39274#true} is VALID [2022-04-08 10:04:59,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39274#true} {39274#true} #61#return; {39274#true} is VALID [2022-04-08 10:04:59,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {39274#true} assume true; {39274#true} is VALID [2022-04-08 10:04:59,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {39274#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {39274#true} is VALID [2022-04-08 10:04:59,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {39274#true} call ULTIMATE.init(); {39274#true} is VALID [2022-04-08 10:04:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 10:04:59,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505438474] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:59,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:59,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 14] total 36 [2022-04-08 10:04:59,298 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:59,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [449863605] [2022-04-08 10:04:59,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [449863605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:59,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:59,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:04:59,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691288072] [2022-04-08 10:04:59,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:59,298 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 10:04:59,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:59,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:59,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:59,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:04:59,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:59,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:04:59,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1087, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:04:59,318 INFO L87 Difference]: Start difference. First operand 127 states and 164 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:01,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:01,048 INFO L93 Difference]: Finished difference Result 152 states and 189 transitions. [2022-04-08 10:05:01,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:05:01,049 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 10:05:01,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:01,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 62 transitions. [2022-04-08 10:05:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 62 transitions. [2022-04-08 10:05:01,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 62 transitions. [2022-04-08 10:05:01,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:01,098 INFO L225 Difference]: With dead ends: 152 [2022-04-08 10:05:01,098 INFO L226 Difference]: Without dead ends: 138 [2022-04-08 10:05:01,098 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=366, Invalid=2714, Unknown=0, NotChecked=0, Total=3080 [2022-04-08 10:05:01,099 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:01,099 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 95 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:05:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-08 10:05:01,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 128. [2022-04-08 10:05:01,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:01,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:01,447 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:01,448 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:01,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:01,449 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2022-04-08 10:05:01,449 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 175 transitions. [2022-04-08 10:05:01,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:01,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:01,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 138 states. [2022-04-08 10:05:01,449 INFO L87 Difference]: Start difference. First operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 138 states. [2022-04-08 10:05:01,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:01,450 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2022-04-08 10:05:01,450 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 175 transitions. [2022-04-08 10:05:01,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:01,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:01,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:01,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:01,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:01,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 165 transitions. [2022-04-08 10:05:01,452 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 165 transitions. Word has length 35 [2022-04-08 10:05:01,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:01,452 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 165 transitions. [2022-04-08 10:05:01,452 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:01,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 165 transitions. [2022-04-08 10:05:01,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:01,751 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2022-04-08 10:05:01,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 10:05:01,751 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:01,751 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:01,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:01,952 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-04-08 10:05:01,952 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:01,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:01,952 INFO L85 PathProgramCache]: Analyzing trace with hash 963858751, now seen corresponding path program 101 times [2022-04-08 10:05:01,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:01,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [609652107] [2022-04-08 10:05:01,954 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:01,954 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:01,954 INFO L85 PathProgramCache]: Analyzing trace with hash 963858751, now seen corresponding path program 102 times [2022-04-08 10:05:01,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:01,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579711224] [2022-04-08 10:05:01,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:01,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:02,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:02,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {40417#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40398#true} is VALID [2022-04-08 10:05:02,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {40398#true} assume true; {40398#true} is VALID [2022-04-08 10:05:02,177 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40398#true} {40398#true} #61#return; {40398#true} is VALID [2022-04-08 10:05:02,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {40398#true} call ULTIMATE.init(); {40417#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:02,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {40417#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40398#true} is VALID [2022-04-08 10:05:02,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {40398#true} assume true; {40398#true} is VALID [2022-04-08 10:05:02,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40398#true} {40398#true} #61#return; {40398#true} is VALID [2022-04-08 10:05:02,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {40398#true} call #t~ret11 := main(); {40398#true} is VALID [2022-04-08 10:05:02,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {40398#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40403#(= main_~y~0 0)} is VALID [2022-04-08 10:05:02,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {40403#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40404#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:02,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {40404#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40405#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:02,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {40405#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40406#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:02,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {40406#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40407#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:02,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {40407#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40408#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:02,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {40408#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40409#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:02,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {40409#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40410#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:02,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {40410#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:02,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {40411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40412#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:02,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {40412#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {40412#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:02,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {40412#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {40413#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:02,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {40413#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40414#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:02,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {40414#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40415#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:02,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {40415#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40416#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:02,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {40416#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {40399#false} is VALID [2022-04-08 10:05:02,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {40399#false} assume !(~y~0 % 4294967296 > 0); {40399#false} is VALID [2022-04-08 10:05:02,186 INFO L272 TraceCheckUtils]: 31: Hoare triple {40399#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {40399#false} is VALID [2022-04-08 10:05:02,186 INFO L290 TraceCheckUtils]: 32: Hoare triple {40399#false} ~cond := #in~cond; {40399#false} is VALID [2022-04-08 10:05:02,186 INFO L290 TraceCheckUtils]: 33: Hoare triple {40399#false} assume 0 == ~cond; {40399#false} is VALID [2022-04-08 10:05:02,186 INFO L290 TraceCheckUtils]: 34: Hoare triple {40399#false} assume !false; {40399#false} is VALID [2022-04-08 10:05:02,186 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:05:02,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:02,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579711224] [2022-04-08 10:05:02,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579711224] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:02,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951508023] [2022-04-08 10:05:02,187 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:05:02,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:02,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:02,188 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:02,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-08 10:05:02,289 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:05:02,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:02,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:05:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:02,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:02,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {40398#true} call ULTIMATE.init(); {40398#true} is VALID [2022-04-08 10:05:02,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {40398#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40398#true} is VALID [2022-04-08 10:05:02,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {40398#true} assume true; {40398#true} is VALID [2022-04-08 10:05:02,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40398#true} {40398#true} #61#return; {40398#true} is VALID [2022-04-08 10:05:02,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {40398#true} call #t~ret11 := main(); {40398#true} is VALID [2022-04-08 10:05:02,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {40398#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40403#(= main_~y~0 0)} is VALID [2022-04-08 10:05:02,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {40403#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40404#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:02,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {40404#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40405#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:02,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {40405#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40406#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:02,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {40406#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40407#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:02,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {40407#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40408#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:02,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {40408#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40409#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:02,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {40409#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40410#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:02,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {40410#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:02,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {40411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40412#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:02,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {40412#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {40412#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:02,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {40412#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {40413#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:02,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {40413#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40414#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:02,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {40414#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40415#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:02,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {40415#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40478#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:02,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {40478#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {40399#false} is VALID [2022-04-08 10:05:02,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {40399#false} assume !(~y~0 % 4294967296 > 0); {40399#false} is VALID [2022-04-08 10:05:02,579 INFO L272 TraceCheckUtils]: 31: Hoare triple {40399#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {40399#false} is VALID [2022-04-08 10:05:02,579 INFO L290 TraceCheckUtils]: 32: Hoare triple {40399#false} ~cond := #in~cond; {40399#false} is VALID [2022-04-08 10:05:02,579 INFO L290 TraceCheckUtils]: 33: Hoare triple {40399#false} assume 0 == ~cond; {40399#false} is VALID [2022-04-08 10:05:02,580 INFO L290 TraceCheckUtils]: 34: Hoare triple {40399#false} assume !false; {40399#false} is VALID [2022-04-08 10:05:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:05:02,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:02,991 INFO L290 TraceCheckUtils]: 34: Hoare triple {40399#false} assume !false; {40399#false} is VALID [2022-04-08 10:05:02,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {40399#false} assume 0 == ~cond; {40399#false} is VALID [2022-04-08 10:05:02,992 INFO L290 TraceCheckUtils]: 32: Hoare triple {40399#false} ~cond := #in~cond; {40399#false} is VALID [2022-04-08 10:05:02,992 INFO L272 TraceCheckUtils]: 31: Hoare triple {40399#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {40399#false} is VALID [2022-04-08 10:05:02,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {40399#false} assume !(~y~0 % 4294967296 > 0); {40399#false} is VALID [2022-04-08 10:05:02,992 INFO L290 TraceCheckUtils]: 29: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,992 INFO L290 TraceCheckUtils]: 27: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,992 INFO L290 TraceCheckUtils]: 26: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,992 INFO L290 TraceCheckUtils]: 25: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-08 10:05:02,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {40566#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {40399#false} is VALID [2022-04-08 10:05:02,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {40570#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40566#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:02,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {40574#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40570#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:02,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {40578#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40574#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:02,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {40582#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {40578#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:02,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {40582#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {40582#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:02,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {40589#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40582#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:02,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {40593#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40589#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:02,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {40597#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40593#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:03,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {40601#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40597#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:03,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {40605#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40601#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:03,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {40609#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40605#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:03,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {40613#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40609#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:03,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {40617#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40613#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:03,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {40621#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40617#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:03,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {40398#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40621#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:05:03,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {40398#true} call #t~ret11 := main(); {40398#true} is VALID [2022-04-08 10:05:03,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40398#true} {40398#true} #61#return; {40398#true} is VALID [2022-04-08 10:05:03,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {40398#true} assume true; {40398#true} is VALID [2022-04-08 10:05:03,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {40398#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40398#true} is VALID [2022-04-08 10:05:03,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {40398#true} call ULTIMATE.init(); {40398#true} is VALID [2022-04-08 10:05:03,005 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:05:03,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951508023] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:03,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:03,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-08 10:05:03,006 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:03,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [609652107] [2022-04-08 10:05:03,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [609652107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:03,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:03,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:05:03,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68396124] [2022-04-08 10:05:03,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:03,006 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 10:05:03,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:03,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:03,027 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-08 10:05:03,027 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:05:03,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:03,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:05:03,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:05:03,028 INFO L87 Difference]: Start difference. First operand 128 states and 165 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:04,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:04,596 INFO L93 Difference]: Finished difference Result 155 states and 192 transitions. [2022-04-08 10:05:04,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 10:05:04,596 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 10:05:04,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:04,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 66 transitions. [2022-04-08 10:05:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 66 transitions. [2022-04-08 10:05:04,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 66 transitions. [2022-04-08 10:05:04,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:04,651 INFO L225 Difference]: With dead ends: 155 [2022-04-08 10:05:04,651 INFO L226 Difference]: Without dead ends: 140 [2022-04-08 10:05:04,652 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=509, Invalid=2041, Unknown=0, NotChecked=0, Total=2550 [2022-04-08 10:05:04,652 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:04,652 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 87 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:05:04,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-08 10:05:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 129. [2022-04-08 10:05:05,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:05,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 129 states, 124 states have (on average 1.3064516129032258) internal successors, (162), 124 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:05,005 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 129 states, 124 states have (on average 1.3064516129032258) internal successors, (162), 124 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:05,005 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 129 states, 124 states have (on average 1.3064516129032258) internal successors, (162), 124 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:05,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:05,006 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2022-04-08 10:05:05,006 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2022-04-08 10:05:05,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:05,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:05,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 124 states have (on average 1.3064516129032258) internal successors, (162), 124 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 140 states. [2022-04-08 10:05:05,006 INFO L87 Difference]: Start difference. First operand has 129 states, 124 states have (on average 1.3064516129032258) internal successors, (162), 124 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 140 states. [2022-04-08 10:05:05,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:05,008 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2022-04-08 10:05:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2022-04-08 10:05:05,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:05,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:05,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:05,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:05,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.3064516129032258) internal successors, (162), 124 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:05,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 166 transitions. [2022-04-08 10:05:05,009 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 166 transitions. Word has length 35 [2022-04-08 10:05:05,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:05,009 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 166 transitions. [2022-04-08 10:05:05,009 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:05,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 166 transitions. [2022-04-08 10:05:05,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:05,303 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 166 transitions. [2022-04-08 10:05:05,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 10:05:05,304 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:05,304 INFO L499 BasicCegarLoop]: trace histogram [18, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:05,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-04-08 10:05:05,504 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-04-08 10:05:05,504 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:05,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:05,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1360843247, now seen corresponding path program 103 times [2022-04-08 10:05:05,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:05,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1519764018] [2022-04-08 10:05:05,507 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:05,507 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:05,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1360843247, now seen corresponding path program 104 times [2022-04-08 10:05:05,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:05,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447273826] [2022-04-08 10:05:05,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:05,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:05,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:05,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {41554#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {41528#true} is VALID [2022-04-08 10:05:05,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {41528#true} assume true; {41528#true} is VALID [2022-04-08 10:05:05,913 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41528#true} {41528#true} #61#return; {41528#true} is VALID [2022-04-08 10:05:05,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {41528#true} call ULTIMATE.init(); {41554#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:05,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {41554#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {41528#true} is VALID [2022-04-08 10:05:05,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {41528#true} assume true; {41528#true} is VALID [2022-04-08 10:05:05,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41528#true} {41528#true} #61#return; {41528#true} is VALID [2022-04-08 10:05:05,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {41528#true} call #t~ret11 := main(); {41528#true} is VALID [2022-04-08 10:05:05,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {41528#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41533#(= main_~y~0 0)} is VALID [2022-04-08 10:05:05,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {41533#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41534#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:05,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {41534#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41535#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:05,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {41535#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41536#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:05,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {41536#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41537#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:05,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {41537#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41538#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:05,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {41538#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41539#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:05,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {41539#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41540#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:05,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {41540#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41541#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:05,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {41541#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41542#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:05,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {41542#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41543#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:05,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {41543#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41544#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:05,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {41544#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41545#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:05,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {41545#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41546#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:05,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {41546#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41547#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:05,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {41547#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41548#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:05:05,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {41548#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41549#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:05:05,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {41549#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41550#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:05:05,926 INFO L290 TraceCheckUtils]: 23: Hoare triple {41550#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41551#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:05:05,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {41551#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {41551#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:05:05,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {41551#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {41552#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-08 10:05:05,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {41552#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41553#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} is VALID [2022-04-08 10:05:05,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {41553#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {41529#false} is VALID [2022-04-08 10:05:05,928 INFO L290 TraceCheckUtils]: 28: Hoare triple {41529#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {41529#false} is VALID [2022-04-08 10:05:05,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {41529#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {41529#false} is VALID [2022-04-08 10:05:05,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {41529#false} assume !(~y~0 % 4294967296 > 0); {41529#false} is VALID [2022-04-08 10:05:05,928 INFO L272 TraceCheckUtils]: 31: Hoare triple {41529#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {41529#false} is VALID [2022-04-08 10:05:05,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {41529#false} ~cond := #in~cond; {41529#false} is VALID [2022-04-08 10:05:05,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {41529#false} assume 0 == ~cond; {41529#false} is VALID [2022-04-08 10:05:05,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {41529#false} assume !false; {41529#false} is VALID [2022-04-08 10:05:05,928 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:05:05,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:05,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447273826] [2022-04-08 10:05:05,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447273826] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:05,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123398254] [2022-04-08 10:05:05,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:05:05,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:05,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:05,930 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:05,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-04-08 10:05:05,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:05:05,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:05,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:05:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:05,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:06,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {41528#true} call ULTIMATE.init(); {41528#true} is VALID [2022-04-08 10:05:06,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {41528#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {41528#true} is VALID [2022-04-08 10:05:06,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {41528#true} assume true; {41528#true} is VALID [2022-04-08 10:05:06,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41528#true} {41528#true} #61#return; {41528#true} is VALID [2022-04-08 10:05:06,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {41528#true} call #t~ret11 := main(); {41528#true} is VALID [2022-04-08 10:05:06,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {41528#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41533#(= main_~y~0 0)} is VALID [2022-04-08 10:05:06,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {41533#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41534#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:06,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {41534#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41535#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:06,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {41535#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41536#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:06,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {41536#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41537#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:06,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {41537#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41538#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:06,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {41538#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41539#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:06,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {41539#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41540#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:06,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {41540#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41541#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:06,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {41541#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41542#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:06,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {41542#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41543#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:06,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {41543#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41544#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:06,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {41544#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41545#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:06,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {41545#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41546#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:06,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {41546#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41547#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:06,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {41547#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41548#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:05:06,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {41548#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41549#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:05:06,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {41549#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41550#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:05:06,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {41550#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41551#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:05:06,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {41551#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {41551#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:05:06,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {41551#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {41552#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-08 10:05:06,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {41552#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41636#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:05:06,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {41636#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !(~z~0 % 4294967296 > 0); {41529#false} is VALID [2022-04-08 10:05:06,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {41529#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {41529#false} is VALID [2022-04-08 10:05:06,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {41529#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {41529#false} is VALID [2022-04-08 10:05:06,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {41529#false} assume !(~y~0 % 4294967296 > 0); {41529#false} is VALID [2022-04-08 10:05:06,363 INFO L272 TraceCheckUtils]: 31: Hoare triple {41529#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {41529#false} is VALID [2022-04-08 10:05:06,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {41529#false} ~cond := #in~cond; {41529#false} is VALID [2022-04-08 10:05:06,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {41529#false} assume 0 == ~cond; {41529#false} is VALID [2022-04-08 10:05:06,363 INFO L290 TraceCheckUtils]: 34: Hoare triple {41529#false} assume !false; {41529#false} is VALID [2022-04-08 10:05:06,364 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:05:06,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:07,079 INFO L290 TraceCheckUtils]: 34: Hoare triple {41529#false} assume !false; {41529#false} is VALID [2022-04-08 10:05:07,080 INFO L290 TraceCheckUtils]: 33: Hoare triple {41529#false} assume 0 == ~cond; {41529#false} is VALID [2022-04-08 10:05:07,080 INFO L290 TraceCheckUtils]: 32: Hoare triple {41529#false} ~cond := #in~cond; {41529#false} is VALID [2022-04-08 10:05:07,080 INFO L272 TraceCheckUtils]: 31: Hoare triple {41529#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {41529#false} is VALID [2022-04-08 10:05:07,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {41529#false} assume !(~y~0 % 4294967296 > 0); {41529#false} is VALID [2022-04-08 10:05:07,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {41529#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {41529#false} is VALID [2022-04-08 10:05:07,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {41529#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {41529#false} is VALID [2022-04-08 10:05:07,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {41682#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {41529#false} is VALID [2022-04-08 10:05:07,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {41686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41682#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:07,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {41690#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {41686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:07,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {41690#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {41690#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:07,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {41697#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41690#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:07,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {41701#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41697#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:07,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {41705#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41701#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:07,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {41709#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41705#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:07,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {41713#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41709#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:07,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {41717#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41713#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:07,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {41721#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41717#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:07,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {41725#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41721#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:05:07,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {41729#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41725#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:07,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {41733#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41729#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:05:07,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {41737#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41733#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:05:07,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {41741#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41737#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:05:07,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {41745#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41741#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:05:07,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {41749#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41745#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:05:07,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {41753#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41749#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:05:07,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {41757#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41753#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:05:07,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {41761#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41757#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:05:07,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {41765#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41761#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:05:07,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {41528#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41765#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:05:07,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {41528#true} call #t~ret11 := main(); {41528#true} is VALID [2022-04-08 10:05:07,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41528#true} {41528#true} #61#return; {41528#true} is VALID [2022-04-08 10:05:07,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {41528#true} assume true; {41528#true} is VALID [2022-04-08 10:05:07,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {41528#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {41528#true} is VALID [2022-04-08 10:05:07,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {41528#true} call ULTIMATE.init(); {41528#true} is VALID [2022-04-08 10:05:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:05:07,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123398254] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:07,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:07,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-08 10:05:07,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:07,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1519764018] [2022-04-08 10:05:07,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1519764018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:07,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:07,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:05:07,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283088120] [2022-04-08 10:05:07,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:07,095 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 10:05:07,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:07,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:07,116 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-08 10:05:07,116 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:05:07,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:07,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:05:07,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=1614, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:05:07,117 INFO L87 Difference]: Start difference. First operand 129 states and 166 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:10,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:10,526 INFO L93 Difference]: Finished difference Result 201 states and 286 transitions. [2022-04-08 10:05:10,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:05:10,526 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 10:05:10,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:10,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:10,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 132 transitions. [2022-04-08 10:05:10,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 132 transitions. [2022-04-08 10:05:10,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 132 transitions. [2022-04-08 10:05:10,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:10,637 INFO L225 Difference]: With dead ends: 201 [2022-04-08 10:05:10,637 INFO L226 Difference]: Without dead ends: 193 [2022-04-08 10:05:10,637 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=974, Invalid=3582, Unknown=0, NotChecked=0, Total=4556 [2022-04-08 10:05:10,638 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 107 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1876 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:10,638 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 151 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1876 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-08 10:05:10,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-04-08 10:05:11,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 135. [2022-04-08 10:05:11,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:11,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:11,011 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:11,011 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:11,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:11,014 INFO L93 Difference]: Finished difference Result 193 states and 238 transitions. [2022-04-08 10:05:11,014 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2022-04-08 10:05:11,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:11,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:11,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 193 states. [2022-04-08 10:05:11,015 INFO L87 Difference]: Start difference. First operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 193 states. [2022-04-08 10:05:11,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:11,018 INFO L93 Difference]: Finished difference Result 193 states and 238 transitions. [2022-04-08 10:05:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2022-04-08 10:05:11,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:11,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:11,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:11,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:11,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 174 transitions. [2022-04-08 10:05:11,020 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 174 transitions. Word has length 35 [2022-04-08 10:05:11,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:11,021 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 174 transitions. [2022-04-08 10:05:11,021 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:11,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 174 transitions. [2022-04-08 10:05:11,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:11,356 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 174 transitions. [2022-04-08 10:05:11,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:05:11,356 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:11,356 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:11,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:11,556 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:11,557 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:11,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:11,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1944519039, now seen corresponding path program 105 times [2022-04-08 10:05:11,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:11,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [263215941] [2022-04-08 10:05:11,559 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:11,559 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:11,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1944519039, now seen corresponding path program 106 times [2022-04-08 10:05:11,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:11,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988432286] [2022-04-08 10:05:11,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:11,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:11,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:11,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {42909#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42888#true} is VALID [2022-04-08 10:05:11,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {42888#true} assume true; {42888#true} is VALID [2022-04-08 10:05:11,843 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42888#true} {42888#true} #61#return; {42888#true} is VALID [2022-04-08 10:05:11,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {42888#true} call ULTIMATE.init(); {42909#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:11,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {42909#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42888#true} is VALID [2022-04-08 10:05:11,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {42888#true} assume true; {42888#true} is VALID [2022-04-08 10:05:11,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42888#true} {42888#true} #61#return; {42888#true} is VALID [2022-04-08 10:05:11,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {42888#true} call #t~ret11 := main(); {42888#true} is VALID [2022-04-08 10:05:11,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {42888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42893#(= main_~y~0 0)} is VALID [2022-04-08 10:05:11,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {42893#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42894#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:11,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {42894#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42895#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:11,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {42895#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42896#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:11,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {42896#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42897#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:11,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {42897#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42898#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:11,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {42898#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42899#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:11,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {42899#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:11,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {42900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {42900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:11,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {42900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {42901#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:11,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {42901#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42902#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:11,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {42902#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42903#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:05:11,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {42903#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42904#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:05:11,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {42904#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42905#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:05:11,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {42905#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42906#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:05:11,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {42906#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42907#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:05:11,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {42907#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42908#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:05:11,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {42908#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42889#false} is VALID [2022-04-08 10:05:11,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {42889#false} assume !(~z~0 % 4294967296 > 0); {42889#false} is VALID [2022-04-08 10:05:11,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-08 10:05:11,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-08 10:05:11,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-08 10:05:11,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-08 10:05:11,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-08 10:05:11,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-08 10:05:11,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-08 10:05:11,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {42889#false} assume !(~y~0 % 4294967296 > 0); {42889#false} is VALID [2022-04-08 10:05:11,855 INFO L272 TraceCheckUtils]: 32: Hoare triple {42889#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {42889#false} is VALID [2022-04-08 10:05:11,855 INFO L290 TraceCheckUtils]: 33: Hoare triple {42889#false} ~cond := #in~cond; {42889#false} is VALID [2022-04-08 10:05:11,855 INFO L290 TraceCheckUtils]: 34: Hoare triple {42889#false} assume 0 == ~cond; {42889#false} is VALID [2022-04-08 10:05:11,855 INFO L290 TraceCheckUtils]: 35: Hoare triple {42889#false} assume !false; {42889#false} is VALID [2022-04-08 10:05:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:05:11,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:11,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988432286] [2022-04-08 10:05:11,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988432286] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:11,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168963854] [2022-04-08 10:05:11,856 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:05:11,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:11,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:11,860 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:11,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-04-08 10:05:11,916 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:05:11,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:11,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 10:05:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:11,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:12,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {42888#true} call ULTIMATE.init(); {42888#true} is VALID [2022-04-08 10:05:12,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {42888#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42888#true} is VALID [2022-04-08 10:05:12,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {42888#true} assume true; {42888#true} is VALID [2022-04-08 10:05:12,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42888#true} {42888#true} #61#return; {42888#true} is VALID [2022-04-08 10:05:12,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {42888#true} call #t~ret11 := main(); {42888#true} is VALID [2022-04-08 10:05:12,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {42888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42893#(= main_~y~0 0)} is VALID [2022-04-08 10:05:12,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {42893#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42894#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:12,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {42894#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42895#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:12,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {42895#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42896#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:12,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {42896#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42897#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:12,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {42897#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42898#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:12,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {42898#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42899#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:12,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {42899#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:12,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {42900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {42900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:12,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {42900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {42955#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:12,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {42955#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42959#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:05:12,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {42959#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42963#(and (= main_~y~0 (+ main_~z~0 2)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:12,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {42963#(and (= main_~y~0 (+ main_~z~0 2)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42967#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-08 10:05:12,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {42967#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42971#(and (= main_~y~0 (+ main_~z~0 4)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:12,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {42971#(and (= main_~y~0 (+ main_~z~0 4)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42975#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:12,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {42975#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42979#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:12,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {42979#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42983#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 4)) (+ main_~z~0 3)))} is VALID [2022-04-08 10:05:12,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {42983#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 4)) (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42889#false} is VALID [2022-04-08 10:05:12,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {42889#false} assume !(~z~0 % 4294967296 > 0); {42889#false} is VALID [2022-04-08 10:05:12,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-08 10:05:12,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-08 10:05:12,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-08 10:05:12,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-08 10:05:12,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-08 10:05:12,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-08 10:05:12,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-08 10:05:12,288 INFO L290 TraceCheckUtils]: 31: Hoare triple {42889#false} assume !(~y~0 % 4294967296 > 0); {42889#false} is VALID [2022-04-08 10:05:12,288 INFO L272 TraceCheckUtils]: 32: Hoare triple {42889#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {42889#false} is VALID [2022-04-08 10:05:12,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {42889#false} ~cond := #in~cond; {42889#false} is VALID [2022-04-08 10:05:12,288 INFO L290 TraceCheckUtils]: 34: Hoare triple {42889#false} assume 0 == ~cond; {42889#false} is VALID [2022-04-08 10:05:12,288 INFO L290 TraceCheckUtils]: 35: Hoare triple {42889#false} assume !false; {42889#false} is VALID [2022-04-08 10:05:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:05:12,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:12,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {42889#false} assume !false; {42889#false} is VALID [2022-04-08 10:05:12,929 INFO L290 TraceCheckUtils]: 34: Hoare triple {42889#false} assume 0 == ~cond; {42889#false} is VALID [2022-04-08 10:05:12,929 INFO L290 TraceCheckUtils]: 33: Hoare triple {42889#false} ~cond := #in~cond; {42889#false} is VALID [2022-04-08 10:05:12,929 INFO L272 TraceCheckUtils]: 32: Hoare triple {42889#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {42889#false} is VALID [2022-04-08 10:05:12,929 INFO L290 TraceCheckUtils]: 31: Hoare triple {43038#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {42889#false} is VALID [2022-04-08 10:05:12,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {43042#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43038#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:12,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {43046#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43042#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:12,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {43050#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43046#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:12,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {43054#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43050#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:12,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {43058#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43054#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:12,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {43062#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43058#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:12,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {43066#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43062#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:12,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {43066#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~z~0 % 4294967296 > 0); {43066#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:05:12,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {43073#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43066#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:05:12,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {43077#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43073#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-08 10:05:12,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {43081#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43077#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:05:12,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {43085#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43081#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:05:12,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {43089#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43085#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:05:12,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {43093#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43089#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:05:12,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {43097#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43093#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:05:12,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {43101#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43097#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:05:12,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {42888#true} ~z~0 := ~y~0; {43101#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-08 10:05:12,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {42888#true} assume !(~x~0 % 4294967296 > 0); {42888#true} is VALID [2022-04-08 10:05:12,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {42888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42888#true} is VALID [2022-04-08 10:05:12,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {42888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42888#true} is VALID [2022-04-08 10:05:12,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {42888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42888#true} is VALID [2022-04-08 10:05:12,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {42888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42888#true} is VALID [2022-04-08 10:05:12,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {42888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42888#true} is VALID [2022-04-08 10:05:12,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {42888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42888#true} is VALID [2022-04-08 10:05:12,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {42888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42888#true} is VALID [2022-04-08 10:05:12,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {42888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42888#true} is VALID [2022-04-08 10:05:12,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {42888#true} call #t~ret11 := main(); {42888#true} is VALID [2022-04-08 10:05:12,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42888#true} {42888#true} #61#return; {42888#true} is VALID [2022-04-08 10:05:12,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {42888#true} assume true; {42888#true} is VALID [2022-04-08 10:05:12,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {42888#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42888#true} is VALID [2022-04-08 10:05:12,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {42888#true} call ULTIMATE.init(); {42888#true} is VALID [2022-04-08 10:05:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:05:12,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168963854] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:12,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:12,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 43 [2022-04-08 10:05:12,948 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:12,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [263215941] [2022-04-08 10:05:12,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [263215941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:12,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:12,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:05:12,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313230662] [2022-04-08 10:05:12,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:12,949 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 10:05:12,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:12,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:12,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:12,973 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:05:12,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:12,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:05:12,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1515, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 10:05:12,974 INFO L87 Difference]: Start difference. First operand 135 states and 174 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:14,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:14,203 INFO L93 Difference]: Finished difference Result 148 states and 186 transitions. [2022-04-08 10:05:14,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:05:14,203 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 10:05:14,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:14,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:14,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 43 transitions. [2022-04-08 10:05:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:14,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 43 transitions. [2022-04-08 10:05:14,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 43 transitions. [2022-04-08 10:05:14,235 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-08 10:05:14,236 INFO L225 Difference]: With dead ends: 148 [2022-04-08 10:05:14,236 INFO L226 Difference]: Without dead ends: 125 [2022-04-08 10:05:14,237 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=555, Invalid=2867, Unknown=0, NotChecked=0, Total=3422 [2022-04-08 10:05:14,237 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:14,237 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 96 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:05:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-08 10:05:14,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-04-08 10:05:14,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:14,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 125 states, 120 states have (on average 1.3166666666666667) internal successors, (158), 120 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:14,594 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 125 states, 120 states have (on average 1.3166666666666667) internal successors, (158), 120 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:14,594 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 125 states, 120 states have (on average 1.3166666666666667) internal successors, (158), 120 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:14,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:14,595 INFO L93 Difference]: Finished difference Result 125 states and 162 transitions. [2022-04-08 10:05:14,595 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2022-04-08 10:05:14,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:14,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:14,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 120 states have (on average 1.3166666666666667) internal successors, (158), 120 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-08 10:05:14,595 INFO L87 Difference]: Start difference. First operand has 125 states, 120 states have (on average 1.3166666666666667) internal successors, (158), 120 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-08 10:05:14,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:14,596 INFO L93 Difference]: Finished difference Result 125 states and 162 transitions. [2022-04-08 10:05:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2022-04-08 10:05:14,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:14,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:14,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:14,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.3166666666666667) internal successors, (158), 120 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:14,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 162 transitions. [2022-04-08 10:05:14,598 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 162 transitions. Word has length 36 [2022-04-08 10:05:14,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:14,598 INFO L478 AbstractCegarLoop]: Abstraction has 125 states and 162 transitions. [2022-04-08 10:05:14,598 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:14,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 162 transitions. [2022-04-08 10:05:14,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:14,871 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2022-04-08 10:05:14,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:05:14,871 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:14,871 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:14,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-04-08 10:05:15,071 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:15,072 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:15,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:15,072 INFO L85 PathProgramCache]: Analyzing trace with hash -927796211, now seen corresponding path program 107 times [2022-04-08 10:05:15,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:15,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1715088946] [2022-04-08 10:05:15,074 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:15,074 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:15,074 INFO L85 PathProgramCache]: Analyzing trace with hash -927796211, now seen corresponding path program 108 times [2022-04-08 10:05:15,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:15,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567838301] [2022-04-08 10:05:15,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:15,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:15,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:15,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {43998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43977#true} is VALID [2022-04-08 10:05:15,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {43977#true} assume true; {43977#true} is VALID [2022-04-08 10:05:15,312 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43977#true} {43977#true} #61#return; {43977#true} is VALID [2022-04-08 10:05:15,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {43977#true} call ULTIMATE.init(); {43998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:15,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {43998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43977#true} is VALID [2022-04-08 10:05:15,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {43977#true} assume true; {43977#true} is VALID [2022-04-08 10:05:15,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43977#true} {43977#true} #61#return; {43977#true} is VALID [2022-04-08 10:05:15,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {43977#true} call #t~ret11 := main(); {43977#true} is VALID [2022-04-08 10:05:15,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {43977#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43982#(= main_~y~0 0)} is VALID [2022-04-08 10:05:15,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {43982#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43983#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:15,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {43983#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43984#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:15,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {43984#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43985#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:15,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {43985#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43986#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:15,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {43986#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43987#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:15,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {43987#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43988#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:15,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {43988#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43989#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:15,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {43989#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:15,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {43990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {43990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:15,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {43990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {43991#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:15,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {43991#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43992#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:15,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {43992#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43993#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:15,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {43993#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43994#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:05:15,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {43994#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43995#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:05:15,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {43995#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43996#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:05:15,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {43996#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43997#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:05:15,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {43997#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {43978#false} is VALID [2022-04-08 10:05:15,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-08 10:05:15,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-08 10:05:15,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-08 10:05:15,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-08 10:05:15,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-08 10:05:15,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-08 10:05:15,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-08 10:05:15,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-08 10:05:15,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {43978#false} assume !(~y~0 % 4294967296 > 0); {43978#false} is VALID [2022-04-08 10:05:15,322 INFO L272 TraceCheckUtils]: 32: Hoare triple {43978#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {43978#false} is VALID [2022-04-08 10:05:15,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {43978#false} ~cond := #in~cond; {43978#false} is VALID [2022-04-08 10:05:15,322 INFO L290 TraceCheckUtils]: 34: Hoare triple {43978#false} assume 0 == ~cond; {43978#false} is VALID [2022-04-08 10:05:15,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {43978#false} assume !false; {43978#false} is VALID [2022-04-08 10:05:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:05:15,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:15,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567838301] [2022-04-08 10:05:15,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567838301] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:15,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206838218] [2022-04-08 10:05:15,323 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:05:15,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:15,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:15,324 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:15,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-08 10:05:15,416 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:05:15,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:15,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-08 10:05:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:15,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:15,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {43977#true} call ULTIMATE.init(); {43977#true} is VALID [2022-04-08 10:05:15,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {43977#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43977#true} is VALID [2022-04-08 10:05:15,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {43977#true} assume true; {43977#true} is VALID [2022-04-08 10:05:15,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43977#true} {43977#true} #61#return; {43977#true} is VALID [2022-04-08 10:05:15,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {43977#true} call #t~ret11 := main(); {43977#true} is VALID [2022-04-08 10:05:15,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {43977#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43982#(= main_~y~0 0)} is VALID [2022-04-08 10:05:15,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {43982#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43983#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:15,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {43983#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43984#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:15,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {43984#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43985#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:15,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {43985#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43986#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:15,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {43986#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43987#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:15,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {43987#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43988#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:15,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {43988#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43989#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:15,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {43989#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:15,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {43990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {43990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:15,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {43990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {44047#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:15,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {44047#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44051#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:05:15,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {44051#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44055#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:15,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {44055#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44059#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:15,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {44059#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44063#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-08 10:05:15,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {44063#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44067#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:15,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {44067#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44071#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:15,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {44071#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {43978#false} is VALID [2022-04-08 10:05:15,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-08 10:05:15,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-08 10:05:15,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-08 10:05:15,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-08 10:05:15,757 INFO L290 TraceCheckUtils]: 27: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-08 10:05:15,757 INFO L290 TraceCheckUtils]: 28: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-08 10:05:15,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-08 10:05:15,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-08 10:05:15,757 INFO L290 TraceCheckUtils]: 31: Hoare triple {43978#false} assume !(~y~0 % 4294967296 > 0); {43978#false} is VALID [2022-04-08 10:05:15,757 INFO L272 TraceCheckUtils]: 32: Hoare triple {43978#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {43978#false} is VALID [2022-04-08 10:05:15,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {43978#false} ~cond := #in~cond; {43978#false} is VALID [2022-04-08 10:05:15,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {43978#false} assume 0 == ~cond; {43978#false} is VALID [2022-04-08 10:05:15,757 INFO L290 TraceCheckUtils]: 35: Hoare triple {43978#false} assume !false; {43978#false} is VALID [2022-04-08 10:05:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:05:15,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:16,211 INFO L290 TraceCheckUtils]: 35: Hoare triple {43978#false} assume !false; {43978#false} is VALID [2022-04-08 10:05:16,211 INFO L290 TraceCheckUtils]: 34: Hoare triple {43978#false} assume 0 == ~cond; {43978#false} is VALID [2022-04-08 10:05:16,211 INFO L290 TraceCheckUtils]: 33: Hoare triple {43978#false} ~cond := #in~cond; {43978#false} is VALID [2022-04-08 10:05:16,211 INFO L272 TraceCheckUtils]: 32: Hoare triple {43978#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {43978#false} is VALID [2022-04-08 10:05:16,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {43978#false} assume !(~y~0 % 4294967296 > 0); {43978#false} is VALID [2022-04-08 10:05:16,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-08 10:05:16,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {44132#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-08 10:05:16,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {44136#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {44132#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:05:16,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {44140#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {44136#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:05:16,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {44144#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {44140#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:05:16,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {44148#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {44144#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:05:16,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {44152#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {44148#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:05:16,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {44156#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {44152#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:05:16,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {44160#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {44156#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:05:16,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {44164#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44160#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:05:16,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {44168#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44164#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:05:16,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {44172#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44168#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:05:16,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {44176#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44172#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:05:16,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {44180#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44176#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:05:16,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {44184#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44180#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:05:16,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {43977#true} ~z~0 := ~y~0; {44184#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:05:16,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {43977#true} assume !(~x~0 % 4294967296 > 0); {43977#true} is VALID [2022-04-08 10:05:16,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {43977#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43977#true} is VALID [2022-04-08 10:05:16,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {43977#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43977#true} is VALID [2022-04-08 10:05:16,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {43977#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43977#true} is VALID [2022-04-08 10:05:16,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {43977#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43977#true} is VALID [2022-04-08 10:05:16,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {43977#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43977#true} is VALID [2022-04-08 10:05:16,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {43977#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43977#true} is VALID [2022-04-08 10:05:16,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {43977#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43977#true} is VALID [2022-04-08 10:05:16,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {43977#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43977#true} is VALID [2022-04-08 10:05:16,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {43977#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43977#true} is VALID [2022-04-08 10:05:16,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {43977#true} call #t~ret11 := main(); {43977#true} is VALID [2022-04-08 10:05:16,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43977#true} {43977#true} #61#return; {43977#true} is VALID [2022-04-08 10:05:16,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {43977#true} assume true; {43977#true} is VALID [2022-04-08 10:05:16,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {43977#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43977#true} is VALID [2022-04-08 10:05:16,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {43977#true} call ULTIMATE.init(); {43977#true} is VALID [2022-04-08 10:05:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-08 10:05:16,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206838218] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:16,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:16,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 16] total 40 [2022-04-08 10:05:16,223 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:16,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1715088946] [2022-04-08 10:05:16,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1715088946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:16,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:16,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:05:16,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999598618] [2022-04-08 10:05:16,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:16,223 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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 36 [2022-04-08 10:05:16,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:16,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:05:16,242 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-08 10:05:16,242 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:05:16,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:16,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:05:16,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1352, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:05:16,243 INFO L87 Difference]: Start difference. First operand 125 states and 162 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:05:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:17,613 INFO L93 Difference]: Finished difference Result 150 states and 187 transitions. [2022-04-08 10:05:17,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:05:17,613 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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 36 [2022-04-08 10:05:17,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:05:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 54 transitions. [2022-04-08 10:05:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:05:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 54 transitions. [2022-04-08 10:05:17,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 54 transitions. [2022-04-08 10:05:17,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:17,657 INFO L225 Difference]: With dead ends: 150 [2022-04-08 10:05:17,657 INFO L226 Difference]: Without dead ends: 136 [2022-04-08 10:05:17,658 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=358, Invalid=2722, Unknown=0, NotChecked=0, Total=3080 [2022-04-08 10:05:17,658 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:17,658 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 73 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:05:17,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-08 10:05:17,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2022-04-08 10:05:17,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:17,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 126 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 121 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:17,997 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 126 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 121 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:17,997 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 126 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 121 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:17,998 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2022-04-08 10:05:17,998 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 173 transitions. [2022-04-08 10:05:17,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:17,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:17,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 121 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 136 states. [2022-04-08 10:05:17,999 INFO L87 Difference]: Start difference. First operand has 126 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 121 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 136 states. [2022-04-08 10:05:18,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:18,000 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2022-04-08 10:05:18,000 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 173 transitions. [2022-04-08 10:05:18,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:18,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:18,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:18,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 121 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2022-04-08 10:05:18,001 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 36 [2022-04-08 10:05:18,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:18,001 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2022-04-08 10:05:18,001 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:05:18,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 163 transitions. [2022-04-08 10:05:18,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:18,281 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2022-04-08 10:05:18,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:05:18,282 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:18,282 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:18,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-04-08 10:05:18,482 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:18,482 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:18,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:18,483 INFO L85 PathProgramCache]: Analyzing trace with hash 704939903, now seen corresponding path program 109 times [2022-04-08 10:05:18,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:18,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [330555848] [2022-04-08 10:05:18,485 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:18,485 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:18,485 INFO L85 PathProgramCache]: Analyzing trace with hash 704939903, now seen corresponding path program 110 times [2022-04-08 10:05:18,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:18,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104685806] [2022-04-08 10:05:18,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:18,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:18,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:18,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {45111#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {45091#true} is VALID [2022-04-08 10:05:18,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {45091#true} assume true; {45091#true} is VALID [2022-04-08 10:05:18,721 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45091#true} {45091#true} #61#return; {45091#true} is VALID [2022-04-08 10:05:18,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {45091#true} call ULTIMATE.init(); {45111#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:18,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {45111#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {45091#true} is VALID [2022-04-08 10:05:18,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {45091#true} assume true; {45091#true} is VALID [2022-04-08 10:05:18,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45091#true} {45091#true} #61#return; {45091#true} is VALID [2022-04-08 10:05:18,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {45091#true} call #t~ret11 := main(); {45091#true} is VALID [2022-04-08 10:05:18,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {45091#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45096#(= main_~y~0 0)} is VALID [2022-04-08 10:05:18,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {45096#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45097#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:18,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {45097#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45098#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:18,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {45098#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45099#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:18,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {45099#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45100#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:18,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {45100#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45101#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:18,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {45101#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45102#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:18,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {45102#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45103#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:18,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {45103#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45104#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:18,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {45104#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45105#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:18,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {45105#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {45105#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:18,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {45105#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {45106#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:18,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {45106#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45107#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:18,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {45107#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45108#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:18,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {45108#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45109#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:18,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {45109#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45110#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:05:18,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {45110#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {45092#false} is VALID [2022-04-08 10:05:18,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:18,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:18,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:18,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:18,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:18,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:18,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:18,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:18,730 INFO L290 TraceCheckUtils]: 30: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:18,730 INFO L290 TraceCheckUtils]: 31: Hoare triple {45092#false} assume !(~y~0 % 4294967296 > 0); {45092#false} is VALID [2022-04-08 10:05:18,730 INFO L272 TraceCheckUtils]: 32: Hoare triple {45092#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {45092#false} is VALID [2022-04-08 10:05:18,730 INFO L290 TraceCheckUtils]: 33: Hoare triple {45092#false} ~cond := #in~cond; {45092#false} is VALID [2022-04-08 10:05:18,730 INFO L290 TraceCheckUtils]: 34: Hoare triple {45092#false} assume 0 == ~cond; {45092#false} is VALID [2022-04-08 10:05:18,730 INFO L290 TraceCheckUtils]: 35: Hoare triple {45092#false} assume !false; {45092#false} is VALID [2022-04-08 10:05:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:05:18,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:18,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104685806] [2022-04-08 10:05:18,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104685806] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:18,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598673587] [2022-04-08 10:05:18,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:05:18,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:18,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:18,732 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:18,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-08 10:05:18,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:05:18,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:18,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:05:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:18,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:19,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {45091#true} call ULTIMATE.init(); {45091#true} is VALID [2022-04-08 10:05:19,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {45091#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {45091#true} is VALID [2022-04-08 10:05:19,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {45091#true} assume true; {45091#true} is VALID [2022-04-08 10:05:19,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45091#true} {45091#true} #61#return; {45091#true} is VALID [2022-04-08 10:05:19,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {45091#true} call #t~ret11 := main(); {45091#true} is VALID [2022-04-08 10:05:19,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {45091#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45096#(= main_~y~0 0)} is VALID [2022-04-08 10:05:19,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {45096#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45097#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:19,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {45097#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45098#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:19,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {45098#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45099#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:19,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {45099#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45100#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:19,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {45100#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45101#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:19,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {45101#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45102#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:19,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {45102#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45103#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:19,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {45103#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45104#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:19,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {45104#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45105#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:19,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {45105#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {45105#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:19,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {45105#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {45106#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:19,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {45106#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45107#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:19,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {45107#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45108#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:19,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {45108#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45109#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:19,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {45109#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45175#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:05:19,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {45175#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {45092#false} is VALID [2022-04-08 10:05:19,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:19,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:19,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:19,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:19,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:19,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:19,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:19,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:19,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:19,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {45092#false} assume !(~y~0 % 4294967296 > 0); {45092#false} is VALID [2022-04-08 10:05:19,087 INFO L272 TraceCheckUtils]: 32: Hoare triple {45092#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {45092#false} is VALID [2022-04-08 10:05:19,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {45092#false} ~cond := #in~cond; {45092#false} is VALID [2022-04-08 10:05:19,087 INFO L290 TraceCheckUtils]: 34: Hoare triple {45092#false} assume 0 == ~cond; {45092#false} is VALID [2022-04-08 10:05:19,087 INFO L290 TraceCheckUtils]: 35: Hoare triple {45092#false} assume !false; {45092#false} is VALID [2022-04-08 10:05:19,087 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:05:19,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:19,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {45092#false} assume !false; {45092#false} is VALID [2022-04-08 10:05:19,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {45092#false} assume 0 == ~cond; {45092#false} is VALID [2022-04-08 10:05:19,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {45092#false} ~cond := #in~cond; {45092#false} is VALID [2022-04-08 10:05:19,500 INFO L272 TraceCheckUtils]: 32: Hoare triple {45092#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {45092#false} is VALID [2022-04-08 10:05:19,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {45092#false} assume !(~y~0 % 4294967296 > 0); {45092#false} is VALID [2022-04-08 10:05:19,500 INFO L290 TraceCheckUtils]: 30: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:19,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:19,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:19,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:19,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:19,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:19,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:19,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:19,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-08 10:05:19,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {45263#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {45092#false} is VALID [2022-04-08 10:05:19,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {45267#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45263#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:19,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {45271#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45267#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:19,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {45275#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45271#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:19,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {45279#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45275#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:19,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {45283#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {45279#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:05:19,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {45283#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {45283#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:19,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {45290#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45283#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:19,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {45294#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45290#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:19,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {45298#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45294#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:19,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {45302#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45298#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:19,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {45306#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45302#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:19,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {45310#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45306#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:19,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {45314#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45310#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:19,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {45318#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45314#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:19,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {45322#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45318#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:19,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {45091#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45322#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:19,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {45091#true} call #t~ret11 := main(); {45091#true} is VALID [2022-04-08 10:05:19,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45091#true} {45091#true} #61#return; {45091#true} is VALID [2022-04-08 10:05:19,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {45091#true} assume true; {45091#true} is VALID [2022-04-08 10:05:19,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {45091#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {45091#true} is VALID [2022-04-08 10:05:19,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {45091#true} call ULTIMATE.init(); {45091#true} is VALID [2022-04-08 10:05:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:05:19,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598673587] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:19,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:19,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-08 10:05:19,511 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:19,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [330555848] [2022-04-08 10:05:19,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [330555848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:19,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:19,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:05:19,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79773427] [2022-04-08 10:05:19,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:19,512 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 10:05:19,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:19,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:19,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:19,539 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:05:19,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:19,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:05:19,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=927, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:05:19,540 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:21,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:21,072 INFO L93 Difference]: Finished difference Result 153 states and 190 transitions. [2022-04-08 10:05:21,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 10:05:21,072 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 10:05:21,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:21,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 62 transitions. [2022-04-08 10:05:21,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:21,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 62 transitions. [2022-04-08 10:05:21,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 62 transitions. [2022-04-08 10:05:21,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:21,122 INFO L225 Difference]: With dead ends: 153 [2022-04-08 10:05:21,122 INFO L226 Difference]: Without dead ends: 138 [2022-04-08 10:05:21,123 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=533, Invalid=2223, Unknown=0, NotChecked=0, Total=2756 [2022-04-08 10:05:21,123 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:21,123 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 90 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:05:21,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-08 10:05:21,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 127. [2022-04-08 10:05:21,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:21,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:21,492 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:21,492 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:21,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:21,493 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2022-04-08 10:05:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 175 transitions. [2022-04-08 10:05:21,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:21,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:21,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 138 states. [2022-04-08 10:05:21,494 INFO L87 Difference]: Start difference. First operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 138 states. [2022-04-08 10:05:21,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:21,495 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2022-04-08 10:05:21,495 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 175 transitions. [2022-04-08 10:05:21,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:21,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:21,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:21,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:21,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:21,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 164 transitions. [2022-04-08 10:05:21,496 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 164 transitions. Word has length 36 [2022-04-08 10:05:21,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:21,496 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 164 transitions. [2022-04-08 10:05:21,497 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:21,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 164 transitions. [2022-04-08 10:05:21,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:21,780 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 164 transitions. [2022-04-08 10:05:21,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:05:21,780 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:21,780 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:21,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2022-04-08 10:05:21,981 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-04-08 10:05:21,981 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:21,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:21,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1735304717, now seen corresponding path program 111 times [2022-04-08 10:05:21,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:21,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1195504160] [2022-04-08 10:05:21,983 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:21,983 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:21,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1735304717, now seen corresponding path program 112 times [2022-04-08 10:05:21,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:21,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632606654] [2022-04-08 10:05:21,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:21,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:22,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:22,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {46236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46217#true} is VALID [2022-04-08 10:05:22,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {46217#true} assume true; {46217#true} is VALID [2022-04-08 10:05:22,224 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46217#true} {46217#true} #61#return; {46217#true} is VALID [2022-04-08 10:05:22,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {46217#true} call ULTIMATE.init(); {46236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:22,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {46236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46217#true} is VALID [2022-04-08 10:05:22,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {46217#true} assume true; {46217#true} is VALID [2022-04-08 10:05:22,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46217#true} {46217#true} #61#return; {46217#true} is VALID [2022-04-08 10:05:22,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {46217#true} call #t~ret11 := main(); {46217#true} is VALID [2022-04-08 10:05:22,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {46217#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46222#(= main_~y~0 0)} is VALID [2022-04-08 10:05:22,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {46222#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46223#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:22,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {46223#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46224#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:22,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {46224#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46225#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:22,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {46225#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46226#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:22,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {46226#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46227#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:22,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {46227#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46228#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:22,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {46228#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46229#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:22,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {46229#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46230#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:22,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {46230#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46231#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:22,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {46231#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46232#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:22,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {46232#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {46232#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:22,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {46232#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {46233#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:05:22,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {46233#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46234#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:22,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {46234#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46235#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:05:22,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {46235#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {46218#false} is VALID [2022-04-08 10:05:22,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,233 INFO L290 TraceCheckUtils]: 28: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {46218#false} assume !(~y~0 % 4294967296 > 0); {46218#false} is VALID [2022-04-08 10:05:22,233 INFO L272 TraceCheckUtils]: 32: Hoare triple {46218#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {46218#false} is VALID [2022-04-08 10:05:22,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {46218#false} ~cond := #in~cond; {46218#false} is VALID [2022-04-08 10:05:22,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {46218#false} assume 0 == ~cond; {46218#false} is VALID [2022-04-08 10:05:22,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {46218#false} assume !false; {46218#false} is VALID [2022-04-08 10:05:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:05:22,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:22,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632606654] [2022-04-08 10:05:22,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632606654] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:22,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499588334] [2022-04-08 10:05:22,234 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:05:22,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:22,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:22,235 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:22,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-08 10:05:22,277 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:05:22,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:22,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:05:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:22,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:22,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {46217#true} call ULTIMATE.init(); {46217#true} is VALID [2022-04-08 10:05:22,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {46217#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46217#true} is VALID [2022-04-08 10:05:22,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {46217#true} assume true; {46217#true} is VALID [2022-04-08 10:05:22,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46217#true} {46217#true} #61#return; {46217#true} is VALID [2022-04-08 10:05:22,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {46217#true} call #t~ret11 := main(); {46217#true} is VALID [2022-04-08 10:05:22,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {46217#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46222#(= main_~y~0 0)} is VALID [2022-04-08 10:05:22,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {46222#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46223#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:22,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {46223#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46224#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:22,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {46224#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46225#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:22,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {46225#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46226#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:22,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {46226#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46227#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:22,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {46227#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46228#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:22,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {46228#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46229#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:22,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {46229#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46230#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:22,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {46230#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46231#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:22,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {46231#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46232#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:22,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {46232#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {46232#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:22,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {46232#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {46233#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:05:22,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {46233#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46234#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:22,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {46234#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46297#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:22,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {46297#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {46218#false} is VALID [2022-04-08 10:05:22,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {46218#false} assume !(~y~0 % 4294967296 > 0); {46218#false} is VALID [2022-04-08 10:05:22,548 INFO L272 TraceCheckUtils]: 32: Hoare triple {46218#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {46218#false} is VALID [2022-04-08 10:05:22,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {46218#false} ~cond := #in~cond; {46218#false} is VALID [2022-04-08 10:05:22,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {46218#false} assume 0 == ~cond; {46218#false} is VALID [2022-04-08 10:05:22,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {46218#false} assume !false; {46218#false} is VALID [2022-04-08 10:05:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:05:22,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:22,919 INFO L290 TraceCheckUtils]: 35: Hoare triple {46218#false} assume !false; {46218#false} is VALID [2022-04-08 10:05:22,920 INFO L290 TraceCheckUtils]: 34: Hoare triple {46218#false} assume 0 == ~cond; {46218#false} is VALID [2022-04-08 10:05:22,920 INFO L290 TraceCheckUtils]: 33: Hoare triple {46218#false} ~cond := #in~cond; {46218#false} is VALID [2022-04-08 10:05:22,920 INFO L272 TraceCheckUtils]: 32: Hoare triple {46218#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {46218#false} is VALID [2022-04-08 10:05:22,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {46218#false} assume !(~y~0 % 4294967296 > 0); {46218#false} is VALID [2022-04-08 10:05:22,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-08 10:05:22,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {46391#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {46218#false} is VALID [2022-04-08 10:05:22,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {46395#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46391#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:22,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {46399#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46395#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:22,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {46403#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {46399#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:22,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {46403#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {46403#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:22,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {46410#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46403#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:22,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {46414#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46410#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:22,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {46418#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46414#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:22,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {46422#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46418#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:22,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {46426#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46422#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:22,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {46430#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46426#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:22,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {46434#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46430#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:22,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {46438#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46434#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:22,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {46442#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46438#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:05:22,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {46446#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46442#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:22,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {46217#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46446#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:05:22,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {46217#true} call #t~ret11 := main(); {46217#true} is VALID [2022-04-08 10:05:22,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46217#true} {46217#true} #61#return; {46217#true} is VALID [2022-04-08 10:05:22,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {46217#true} assume true; {46217#true} is VALID [2022-04-08 10:05:22,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {46217#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46217#true} is VALID [2022-04-08 10:05:22,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {46217#true} call ULTIMATE.init(); {46217#true} is VALID [2022-04-08 10:05:22,930 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:05:22,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499588334] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:22,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:22,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-08 10:05:22,930 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:22,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1195504160] [2022-04-08 10:05:22,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1195504160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:22,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:22,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:05:22,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449284220] [2022-04-08 10:05:22,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:22,931 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 10:05:22,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:22,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:22,948 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-08 10:05:22,948 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:05:22,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:22,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:05:22,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:05:22,949 INFO L87 Difference]: Start difference. First operand 127 states and 164 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:24,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:24,372 INFO L93 Difference]: Finished difference Result 156 states and 193 transitions. [2022-04-08 10:05:24,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:05:24,372 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 10:05:24,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 65 transitions. [2022-04-08 10:05:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:24,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 65 transitions. [2022-04-08 10:05:24,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 65 transitions. [2022-04-08 10:05:24,427 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-08 10:05:24,429 INFO L225 Difference]: With dead ends: 156 [2022-04-08 10:05:24,429 INFO L226 Difference]: Without dead ends: 140 [2022-04-08 10:05:24,429 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=482, Invalid=1870, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 10:05:24,429 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:24,429 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 85 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:05:24,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-08 10:05:24,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2022-04-08 10:05:24,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:24,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:24,782 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:24,782 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:24,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:24,783 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2022-04-08 10:05:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2022-04-08 10:05:24,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:24,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:24,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 140 states. [2022-04-08 10:05:24,784 INFO L87 Difference]: Start difference. First operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 140 states. [2022-04-08 10:05:24,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:24,785 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2022-04-08 10:05:24,785 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2022-04-08 10:05:24,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:24,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:24,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:24,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:24,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:24,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 165 transitions. [2022-04-08 10:05:24,787 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 165 transitions. Word has length 36 [2022-04-08 10:05:24,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:24,787 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 165 transitions. [2022-04-08 10:05:24,787 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:24,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 165 transitions. [2022-04-08 10:05:25,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:25,073 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2022-04-08 10:05:25,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:05:25,073 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:25,073 INFO L499 BasicCegarLoop]: trace histogram [19, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:25,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-04-08 10:05:25,273 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2022-04-08 10:05:25,274 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:25,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:25,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1307083474, now seen corresponding path program 113 times [2022-04-08 10:05:25,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:25,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1334864189] [2022-04-08 10:05:25,276 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:25,276 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:25,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1307083474, now seen corresponding path program 114 times [2022-04-08 10:05:25,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:25,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464451078] [2022-04-08 10:05:25,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:25,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:25,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:25,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {47376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {47349#true} is VALID [2022-04-08 10:05:25,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {47349#true} assume true; {47349#true} is VALID [2022-04-08 10:05:25,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47349#true} {47349#true} #61#return; {47349#true} is VALID [2022-04-08 10:05:25,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {47349#true} call ULTIMATE.init(); {47376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:25,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {47376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {47349#true} is VALID [2022-04-08 10:05:25,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {47349#true} assume true; {47349#true} is VALID [2022-04-08 10:05:25,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47349#true} {47349#true} #61#return; {47349#true} is VALID [2022-04-08 10:05:25,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {47349#true} call #t~ret11 := main(); {47349#true} is VALID [2022-04-08 10:05:25,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {47349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47354#(= main_~y~0 0)} is VALID [2022-04-08 10:05:25,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {47354#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47355#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:25,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {47355#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:25,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {47356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47357#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:25,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {47357#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47358#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:25,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {47358#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47359#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:25,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {47359#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47360#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:25,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {47360#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47361#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:25,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {47361#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47362#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:25,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {47362#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47363#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:25,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {47363#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47364#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:25,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {47364#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47365#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:25,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {47365#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47366#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:25,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {47366#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47367#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:25,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {47367#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47368#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:25,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {47368#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47369#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:05:25,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {47369#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47370#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:05:25,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {47370#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47371#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:05:25,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {47371#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47372#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:05:25,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {47372#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47373#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:05:25,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {47373#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {47373#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:05:25,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {47373#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {47374#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-08 10:05:25,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {47374#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47375#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} is VALID [2022-04-08 10:05:25,679 INFO L290 TraceCheckUtils]: 28: Hoare triple {47375#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {47350#false} is VALID [2022-04-08 10:05:25,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {47350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {47350#false} is VALID [2022-04-08 10:05:25,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {47350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {47350#false} is VALID [2022-04-08 10:05:25,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {47350#false} assume !(~y~0 % 4294967296 > 0); {47350#false} is VALID [2022-04-08 10:05:25,679 INFO L272 TraceCheckUtils]: 32: Hoare triple {47350#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {47350#false} is VALID [2022-04-08 10:05:25,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {47350#false} ~cond := #in~cond; {47350#false} is VALID [2022-04-08 10:05:25,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {47350#false} assume 0 == ~cond; {47350#false} is VALID [2022-04-08 10:05:25,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {47350#false} assume !false; {47350#false} is VALID [2022-04-08 10:05:25,680 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:05:25,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:25,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464451078] [2022-04-08 10:05:25,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464451078] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:25,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165745376] [2022-04-08 10:05:25,680 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:05:25,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:25,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:25,682 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:25,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-08 10:05:25,733 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:05:25,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:25,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 10:05:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:25,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:25,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {47349#true} call ULTIMATE.init(); {47349#true} is VALID [2022-04-08 10:05:25,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {47349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {47349#true} is VALID [2022-04-08 10:05:25,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {47349#true} assume true; {47349#true} is VALID [2022-04-08 10:05:25,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47349#true} {47349#true} #61#return; {47349#true} is VALID [2022-04-08 10:05:25,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {47349#true} call #t~ret11 := main(); {47349#true} is VALID [2022-04-08 10:05:25,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {47349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47349#true} is VALID [2022-04-08 10:05:25,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:25,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:25,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:25,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:25,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:25,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:25,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:25,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:25,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:25,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:25,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:25,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:25,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:25,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:25,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:25,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:25,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:25,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:25,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:25,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {47349#true} assume !(~x~0 % 4294967296 > 0); {47349#true} is VALID [2022-04-08 10:05:25,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {47349#true} ~z~0 := ~y~0; {47458#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:05:25,910 INFO L290 TraceCheckUtils]: 27: Hoare triple {47458#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47462#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:05:25,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {47462#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {47466#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:05:25,912 INFO L290 TraceCheckUtils]: 29: Hoare triple {47466#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {47470#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:05:25,912 INFO L290 TraceCheckUtils]: 30: Hoare triple {47470#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {47350#false} is VALID [2022-04-08 10:05:25,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {47350#false} assume !(~y~0 % 4294967296 > 0); {47350#false} is VALID [2022-04-08 10:05:25,913 INFO L272 TraceCheckUtils]: 32: Hoare triple {47350#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {47350#false} is VALID [2022-04-08 10:05:25,913 INFO L290 TraceCheckUtils]: 33: Hoare triple {47350#false} ~cond := #in~cond; {47350#false} is VALID [2022-04-08 10:05:25,913 INFO L290 TraceCheckUtils]: 34: Hoare triple {47350#false} assume 0 == ~cond; {47350#false} is VALID [2022-04-08 10:05:25,913 INFO L290 TraceCheckUtils]: 35: Hoare triple {47350#false} assume !false; {47350#false} is VALID [2022-04-08 10:05:25,913 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-08 10:05:25,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:26,081 INFO L290 TraceCheckUtils]: 35: Hoare triple {47350#false} assume !false; {47350#false} is VALID [2022-04-08 10:05:26,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {47350#false} assume 0 == ~cond; {47350#false} is VALID [2022-04-08 10:05:26,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {47350#false} ~cond := #in~cond; {47350#false} is VALID [2022-04-08 10:05:26,081 INFO L272 TraceCheckUtils]: 32: Hoare triple {47350#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {47350#false} is VALID [2022-04-08 10:05:26,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {47350#false} assume !(~y~0 % 4294967296 > 0); {47350#false} is VALID [2022-04-08 10:05:26,082 INFO L290 TraceCheckUtils]: 30: Hoare triple {47470#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {47350#false} is VALID [2022-04-08 10:05:26,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {47466#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {47470#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:05:26,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {47510#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {47466#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:05:26,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {47514#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47510#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:05:26,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {47349#true} ~z~0 := ~y~0; {47514#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:05:26,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {47349#true} assume !(~x~0 % 4294967296 > 0); {47349#true} is VALID [2022-04-08 10:05:26,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:26,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:26,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:26,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:26,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:26,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:26,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:26,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:26,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:26,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:26,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:26,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:26,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:26,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:26,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:26,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:26,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:26,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:26,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {47349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47349#true} is VALID [2022-04-08 10:05:26,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {47349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47349#true} is VALID [2022-04-08 10:05:26,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {47349#true} call #t~ret11 := main(); {47349#true} is VALID [2022-04-08 10:05:26,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47349#true} {47349#true} #61#return; {47349#true} is VALID [2022-04-08 10:05:26,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {47349#true} assume true; {47349#true} is VALID [2022-04-08 10:05:26,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {47349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {47349#true} is VALID [2022-04-08 10:05:26,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {47349#true} call ULTIMATE.init(); {47349#true} is VALID [2022-04-08 10:05:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-08 10:05:26,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165745376] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:26,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:26,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 6, 6] total 31 [2022-04-08 10:05:26,088 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:26,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1334864189] [2022-04-08 10:05:26,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1334864189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:26,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:26,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:05:26,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361187701] [2022-04-08 10:05:26,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:26,089 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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 36 [2022-04-08 10:05:26,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:26,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:05:26,113 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-08 10:05:26,113 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:05:26,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:26,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:05:26,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=858, Unknown=0, NotChecked=0, Total=930 [2022-04-08 10:05:26,114 INFO L87 Difference]: Start difference. First operand 128 states and 165 transitions. Second operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:05:29,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:29,577 INFO L93 Difference]: Finished difference Result 201 states and 287 transitions. [2022-04-08 10:05:29,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 10:05:29,577 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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 36 [2022-04-08 10:05:29,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:29,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:05:29,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 135 transitions. [2022-04-08 10:05:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:05:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 135 transitions. [2022-04-08 10:05:29,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 135 transitions. [2022-04-08 10:05:29,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:29,689 INFO L225 Difference]: With dead ends: 201 [2022-04-08 10:05:29,689 INFO L226 Difference]: Without dead ends: 193 [2022-04-08 10:05:29,689 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=183, Invalid=2679, Unknown=0, NotChecked=0, Total=2862 [2022-04-08 10:05:29,690 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 107 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1921 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:29,690 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 151 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1921 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-08 10:05:29,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-04-08 10:05:30,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 134. [2022-04-08 10:05:30,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:30,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 134 states, 129 states have (on average 1.310077519379845) internal successors, (169), 129 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:30,058 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 134 states, 129 states have (on average 1.310077519379845) internal successors, (169), 129 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:30,058 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 134 states, 129 states have (on average 1.310077519379845) internal successors, (169), 129 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:30,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:30,060 INFO L93 Difference]: Finished difference Result 193 states and 238 transitions. [2022-04-08 10:05:30,061 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2022-04-08 10:05:30,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:30,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:30,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 129 states have (on average 1.310077519379845) internal successors, (169), 129 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 193 states. [2022-04-08 10:05:30,061 INFO L87 Difference]: Start difference. First operand has 134 states, 129 states have (on average 1.310077519379845) internal successors, (169), 129 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 193 states. [2022-04-08 10:05:30,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:30,064 INFO L93 Difference]: Finished difference Result 193 states and 238 transitions. [2022-04-08 10:05:30,064 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2022-04-08 10:05:30,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:30,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:30,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:30,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:30,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.310077519379845) internal successors, (169), 129 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 173 transitions. [2022-04-08 10:05:30,067 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 173 transitions. Word has length 36 [2022-04-08 10:05:30,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:30,067 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 173 transitions. [2022-04-08 10:05:30,067 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:05:30,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 173 transitions. [2022-04-08 10:05:30,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:30,378 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 173 transitions. [2022-04-08 10:05:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:05:30,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:30,378 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:30,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2022-04-08 10:05:30,579 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2022-04-08 10:05:30,579 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:30,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:30,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1959952529, now seen corresponding path program 115 times [2022-04-08 10:05:30,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:30,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [530945225] [2022-04-08 10:05:30,581 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:30,581 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:30,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1959952529, now seen corresponding path program 116 times [2022-04-08 10:05:30,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:30,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59990385] [2022-04-08 10:05:30,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:30,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:30,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:30,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {48722#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48700#true} is VALID [2022-04-08 10:05:30,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {48700#true} assume true; {48700#true} is VALID [2022-04-08 10:05:30,862 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48700#true} {48700#true} #61#return; {48700#true} is VALID [2022-04-08 10:05:30,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {48700#true} call ULTIMATE.init(); {48722#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:30,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {48722#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48700#true} is VALID [2022-04-08 10:05:30,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {48700#true} assume true; {48700#true} is VALID [2022-04-08 10:05:30,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48700#true} {48700#true} #61#return; {48700#true} is VALID [2022-04-08 10:05:30,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {48700#true} call #t~ret11 := main(); {48700#true} is VALID [2022-04-08 10:05:30,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {48700#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48705#(= main_~y~0 0)} is VALID [2022-04-08 10:05:30,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {48705#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48706#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:30,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {48706#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48707#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:30,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {48707#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48708#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:30,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {48708#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48709#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:30,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {48709#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48710#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:30,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {48710#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48711#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:30,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {48711#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48712#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:30,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {48712#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48713#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:30,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {48713#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {48713#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:30,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {48713#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {48714#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:30,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {48714#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48715#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:30,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {48715#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48716#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:30,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {48716#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48717#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:05:30,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {48717#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48718#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:05:30,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {48718#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48719#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:05:30,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {48719#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48720#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:05:30,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {48720#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48721#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:05:30,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {48721#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {48701#false} is VALID [2022-04-08 10:05:30,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-08 10:05:30,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-08 10:05:30,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-08 10:05:30,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-08 10:05:30,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-08 10:05:30,871 INFO L290 TraceCheckUtils]: 29: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-08 10:05:30,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-08 10:05:30,872 INFO L290 TraceCheckUtils]: 31: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-08 10:05:30,872 INFO L290 TraceCheckUtils]: 32: Hoare triple {48701#false} assume !(~y~0 % 4294967296 > 0); {48701#false} is VALID [2022-04-08 10:05:30,872 INFO L272 TraceCheckUtils]: 33: Hoare triple {48701#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {48701#false} is VALID [2022-04-08 10:05:30,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {48701#false} ~cond := #in~cond; {48701#false} is VALID [2022-04-08 10:05:30,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {48701#false} assume 0 == ~cond; {48701#false} is VALID [2022-04-08 10:05:30,872 INFO L290 TraceCheckUtils]: 36: Hoare triple {48701#false} assume !false; {48701#false} is VALID [2022-04-08 10:05:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:05:30,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:30,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59990385] [2022-04-08 10:05:30,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59990385] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:30,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892280863] [2022-04-08 10:05:30,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:05:30,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:30,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:30,873 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:30,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-04-08 10:05:30,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:05:30,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:30,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-08 10:05:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:30,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:31,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {48700#true} call ULTIMATE.init(); {48700#true} is VALID [2022-04-08 10:05:31,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {48700#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48700#true} is VALID [2022-04-08 10:05:31,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {48700#true} assume true; {48700#true} is VALID [2022-04-08 10:05:31,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48700#true} {48700#true} #61#return; {48700#true} is VALID [2022-04-08 10:05:31,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {48700#true} call #t~ret11 := main(); {48700#true} is VALID [2022-04-08 10:05:31,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {48700#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48705#(= main_~y~0 0)} is VALID [2022-04-08 10:05:31,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {48705#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48706#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:31,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {48706#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48707#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:31,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {48707#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48708#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:31,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {48708#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48709#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:31,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {48709#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48710#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:31,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {48710#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48711#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:31,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {48711#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48712#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:31,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {48712#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48713#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:31,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {48713#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {48713#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:31,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {48713#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {48771#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:31,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {48771#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48775#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:05:31,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {48775#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48779#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:31,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {48779#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48783#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:31,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {48783#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48787#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:31,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {48787#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48791#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:31,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {48791#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48795#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:31,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {48795#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48799#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 3)) (+ main_~z~0 4)) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:31,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {48799#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 3)) (+ main_~z~0 4)) (<= 8 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {48701#false} is VALID [2022-04-08 10:05:31,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-08 10:05:31,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-08 10:05:31,286 INFO L290 TraceCheckUtils]: 26: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-08 10:05:31,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-08 10:05:31,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-08 10:05:31,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-08 10:05:31,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-08 10:05:31,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-08 10:05:31,287 INFO L290 TraceCheckUtils]: 32: Hoare triple {48701#false} assume !(~y~0 % 4294967296 > 0); {48701#false} is VALID [2022-04-08 10:05:31,287 INFO L272 TraceCheckUtils]: 33: Hoare triple {48701#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {48701#false} is VALID [2022-04-08 10:05:31,287 INFO L290 TraceCheckUtils]: 34: Hoare triple {48701#false} ~cond := #in~cond; {48701#false} is VALID [2022-04-08 10:05:31,287 INFO L290 TraceCheckUtils]: 35: Hoare triple {48701#false} assume 0 == ~cond; {48701#false} is VALID [2022-04-08 10:05:31,287 INFO L290 TraceCheckUtils]: 36: Hoare triple {48701#false} assume !false; {48701#false} is VALID [2022-04-08 10:05:31,287 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:05:31,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:31,845 INFO L290 TraceCheckUtils]: 36: Hoare triple {48701#false} assume !false; {48701#false} is VALID [2022-04-08 10:05:31,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {48701#false} assume 0 == ~cond; {48701#false} is VALID [2022-04-08 10:05:31,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {48701#false} ~cond := #in~cond; {48701#false} is VALID [2022-04-08 10:05:31,846 INFO L272 TraceCheckUtils]: 33: Hoare triple {48701#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {48701#false} is VALID [2022-04-08 10:05:31,846 INFO L290 TraceCheckUtils]: 32: Hoare triple {48701#false} assume !(~y~0 % 4294967296 > 0); {48701#false} is VALID [2022-04-08 10:05:31,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {48857#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-08 10:05:31,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {48861#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48857#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:05:31,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {48865#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48861#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:05:31,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {48869#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48865#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:05:31,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {48873#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48869#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:05:31,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {48877#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48873#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:05:31,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {48881#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48877#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:05:31,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {48885#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48881#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:05:31,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {48889#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {48885#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:05:31,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {48893#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48889#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:05:31,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {48897#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48893#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:05:31,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {48901#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48897#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:05:31,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {48905#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48901#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:05:31,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {48909#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48905#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:05:31,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {48913#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48909#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:05:31,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {48917#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48913#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:05:31,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {48700#true} ~z~0 := ~y~0; {48917#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:05:31,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {48700#true} assume !(~x~0 % 4294967296 > 0); {48700#true} is VALID [2022-04-08 10:05:31,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {48700#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48700#true} is VALID [2022-04-08 10:05:31,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {48700#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48700#true} is VALID [2022-04-08 10:05:31,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {48700#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48700#true} is VALID [2022-04-08 10:05:31,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {48700#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48700#true} is VALID [2022-04-08 10:05:31,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {48700#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48700#true} is VALID [2022-04-08 10:05:31,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {48700#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48700#true} is VALID [2022-04-08 10:05:31,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {48700#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48700#true} is VALID [2022-04-08 10:05:31,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {48700#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48700#true} is VALID [2022-04-08 10:05:31,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {48700#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48700#true} is VALID [2022-04-08 10:05:31,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {48700#true} call #t~ret11 := main(); {48700#true} is VALID [2022-04-08 10:05:31,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48700#true} {48700#true} #61#return; {48700#true} is VALID [2022-04-08 10:05:31,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {48700#true} assume true; {48700#true} is VALID [2022-04-08 10:05:31,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {48700#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48700#true} is VALID [2022-04-08 10:05:31,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {48700#true} call ULTIMATE.init(); {48700#true} is VALID [2022-04-08 10:05:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:05:31,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892280863] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:31,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:31,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 18] total 44 [2022-04-08 10:05:31,859 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:31,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [530945225] [2022-04-08 10:05:31,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [530945225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:31,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:31,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:05:31,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081445120] [2022-04-08 10:05:31,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:31,860 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-08 10:05:31,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:31,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:31,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:31,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:05:31,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:31,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:05:31,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1645, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:05:31,879 INFO L87 Difference]: Start difference. First operand 134 states and 173 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:33,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:33,481 INFO L93 Difference]: Finished difference Result 159 states and 198 transitions. [2022-04-08 10:05:33,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:05:33,482 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-08 10:05:33,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:33,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 55 transitions. [2022-04-08 10:05:33,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 55 transitions. [2022-04-08 10:05:33,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 55 transitions. [2022-04-08 10:05:33,535 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-08 10:05:33,536 INFO L225 Difference]: With dead ends: 159 [2022-04-08 10:05:33,537 INFO L226 Difference]: Without dead ends: 145 [2022-04-08 10:05:33,537 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=419, Invalid=3241, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 10:05:33,537 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:33,537 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 98 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:05:33,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-04-08 10:05:33,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2022-04-08 10:05:33,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:33,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:33,909 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:33,910 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:33,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:33,911 INFO L93 Difference]: Finished difference Result 145 states and 184 transitions. [2022-04-08 10:05:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 184 transitions. [2022-04-08 10:05:33,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:33,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:33,912 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 145 states. [2022-04-08 10:05:33,912 INFO L87 Difference]: Start difference. First operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 145 states. [2022-04-08 10:05:33,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:33,914 INFO L93 Difference]: Finished difference Result 145 states and 184 transitions. [2022-04-08 10:05:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 184 transitions. [2022-04-08 10:05:33,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:33,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:33,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:33,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:33,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 174 transitions. [2022-04-08 10:05:33,917 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 174 transitions. Word has length 37 [2022-04-08 10:05:33,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:33,917 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 174 transitions. [2022-04-08 10:05:33,917 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:33,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 174 transitions. [2022-04-08 10:05:34,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 174 transitions. [2022-04-08 10:05:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:05:34,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:34,256 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:34,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2022-04-08 10:05:34,459 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:34,459 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:34,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:34,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1268390207, now seen corresponding path program 117 times [2022-04-08 10:05:34,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:34,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1889712771] [2022-04-08 10:05:34,462 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:34,462 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:34,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1268390207, now seen corresponding path program 118 times [2022-04-08 10:05:34,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:34,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686757662] [2022-04-08 10:05:34,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:34,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:34,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:34,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {49901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {49880#true} is VALID [2022-04-08 10:05:34,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {49880#true} assume true; {49880#true} is VALID [2022-04-08 10:05:34,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49880#true} {49880#true} #61#return; {49880#true} is VALID [2022-04-08 10:05:34,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {49880#true} call ULTIMATE.init(); {49901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:34,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {49901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {49880#true} is VALID [2022-04-08 10:05:34,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {49880#true} assume true; {49880#true} is VALID [2022-04-08 10:05:34,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49880#true} {49880#true} #61#return; {49880#true} is VALID [2022-04-08 10:05:34,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {49880#true} call #t~ret11 := main(); {49880#true} is VALID [2022-04-08 10:05:34,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {49880#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49885#(= main_~y~0 0)} is VALID [2022-04-08 10:05:34,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {49885#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49886#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:34,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {49886#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49887#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:34,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {49887#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49888#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:34,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {49888#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49889#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:34,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {49889#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49890#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:34,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {49890#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49891#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:34,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {49891#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49892#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:34,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {49892#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:34,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {49893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49894#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:34,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {49894#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {49894#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:34,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {49894#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {49895#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:34,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {49895#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49896#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:34,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {49896#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49897#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:34,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {49897#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49898#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:34,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {49898#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49899#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:05:34,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {49899#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49900#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:05:34,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {49900#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {49881#false} is VALID [2022-04-08 10:05:34,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:34,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:34,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:34,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:34,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:34,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:34,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:34,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:34,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:34,723 INFO L290 TraceCheckUtils]: 32: Hoare triple {49881#false} assume !(~y~0 % 4294967296 > 0); {49881#false} is VALID [2022-04-08 10:05:34,723 INFO L272 TraceCheckUtils]: 33: Hoare triple {49881#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {49881#false} is VALID [2022-04-08 10:05:34,723 INFO L290 TraceCheckUtils]: 34: Hoare triple {49881#false} ~cond := #in~cond; {49881#false} is VALID [2022-04-08 10:05:34,723 INFO L290 TraceCheckUtils]: 35: Hoare triple {49881#false} assume 0 == ~cond; {49881#false} is VALID [2022-04-08 10:05:34,723 INFO L290 TraceCheckUtils]: 36: Hoare triple {49881#false} assume !false; {49881#false} is VALID [2022-04-08 10:05:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:05:34,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:34,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686757662] [2022-04-08 10:05:34,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686757662] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:34,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236491427] [2022-04-08 10:05:34,724 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:05:34,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:34,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:34,732 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:34,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-04-08 10:05:34,780 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:05:34,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:34,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:05:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:34,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:35,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {49880#true} call ULTIMATE.init(); {49880#true} is VALID [2022-04-08 10:05:35,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {49880#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {49880#true} is VALID [2022-04-08 10:05:35,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {49880#true} assume true; {49880#true} is VALID [2022-04-08 10:05:35,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49880#true} {49880#true} #61#return; {49880#true} is VALID [2022-04-08 10:05:35,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {49880#true} call #t~ret11 := main(); {49880#true} is VALID [2022-04-08 10:05:35,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {49880#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49885#(= main_~y~0 0)} is VALID [2022-04-08 10:05:35,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {49885#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49886#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:35,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {49886#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49887#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:35,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {49887#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49888#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:35,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {49888#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49889#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:35,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {49889#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49890#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:35,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {49890#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49891#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:35,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {49891#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49892#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:35,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {49892#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:35,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {49893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49894#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:35,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {49894#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {49894#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:35,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {49894#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {49895#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:35,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {49895#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49896#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:35,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {49896#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49897#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:35,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {49897#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49898#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:35,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {49898#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49899#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:05:35,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {49899#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49968#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:05:35,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {49968#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {49881#false} is VALID [2022-04-08 10:05:35,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:35,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:35,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:35,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:35,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:35,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:35,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:35,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:35,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:35,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {49881#false} assume !(~y~0 % 4294967296 > 0); {49881#false} is VALID [2022-04-08 10:05:35,066 INFO L272 TraceCheckUtils]: 33: Hoare triple {49881#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {49881#false} is VALID [2022-04-08 10:05:35,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {49881#false} ~cond := #in~cond; {49881#false} is VALID [2022-04-08 10:05:35,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {49881#false} assume 0 == ~cond; {49881#false} is VALID [2022-04-08 10:05:35,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {49881#false} assume !false; {49881#false} is VALID [2022-04-08 10:05:35,066 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:05:35,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:35,506 INFO L290 TraceCheckUtils]: 36: Hoare triple {49881#false} assume !false; {49881#false} is VALID [2022-04-08 10:05:35,506 INFO L290 TraceCheckUtils]: 35: Hoare triple {49881#false} assume 0 == ~cond; {49881#false} is VALID [2022-04-08 10:05:35,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {49881#false} ~cond := #in~cond; {49881#false} is VALID [2022-04-08 10:05:35,506 INFO L272 TraceCheckUtils]: 33: Hoare triple {49881#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {49881#false} is VALID [2022-04-08 10:05:35,506 INFO L290 TraceCheckUtils]: 32: Hoare triple {49881#false} assume !(~y~0 % 4294967296 > 0); {49881#false} is VALID [2022-04-08 10:05:35,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:35,507 INFO L290 TraceCheckUtils]: 30: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:35,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:35,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:35,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:35,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:35,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:35,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:35,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-08 10:05:35,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {50056#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {49881#false} is VALID [2022-04-08 10:05:35,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {50060#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {50056#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:35,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {50064#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {50060#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:35,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {50068#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {50064#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:35,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {50072#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {50068#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:35,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {50076#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {50072#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:05:35,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {50080#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {50076#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:05:35,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {50080#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {50080#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:35,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {50087#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50080#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:35,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {50091#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50087#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:35,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {50095#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50091#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:35,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {50099#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50095#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:35,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {50103#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50099#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:35,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {50107#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50103#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:35,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {50111#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50107#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:35,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {50115#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50111#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:35,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {50119#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50115#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:35,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {49880#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {50119#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:35,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {49880#true} call #t~ret11 := main(); {49880#true} is VALID [2022-04-08 10:05:35,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49880#true} {49880#true} #61#return; {49880#true} is VALID [2022-04-08 10:05:35,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {49880#true} assume true; {49880#true} is VALID [2022-04-08 10:05:35,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {49880#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {49880#true} is VALID [2022-04-08 10:05:35,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {49880#true} call ULTIMATE.init(); {49880#true} is VALID [2022-04-08 10:05:35,518 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:05:35,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236491427] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:35,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:35,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 10:05:35,518 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:35,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1889712771] [2022-04-08 10:05:35,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1889712771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:35,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:35,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:05:35,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75300034] [2022-04-08 10:05:35,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:35,519 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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 37 [2022-04-08 10:05:35,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:35,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:05:35,538 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-08 10:05:35,538 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:05:35,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:35,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:05:35,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:05:35,539 INFO L87 Difference]: Start difference. First operand 135 states and 174 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:05:37,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:37,296 INFO L93 Difference]: Finished difference Result 162 states and 201 transitions. [2022-04-08 10:05:37,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:05:37,296 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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 37 [2022-04-08 10:05:37,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:37,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:05:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 64 transitions. [2022-04-08 10:05:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:05:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 64 transitions. [2022-04-08 10:05:37,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 64 transitions. [2022-04-08 10:05:37,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:37,348 INFO L225 Difference]: With dead ends: 162 [2022-04-08 10:05:37,348 INFO L226 Difference]: Without dead ends: 147 [2022-04-08 10:05:37,348 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=595, Invalid=2597, Unknown=0, NotChecked=0, Total=3192 [2022-04-08 10:05:37,349 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:37,349 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 100 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:05:37,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-04-08 10:05:37,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2022-04-08 10:05:37,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:37,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 136 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 131 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:37,738 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 136 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 131 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:37,738 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 136 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 131 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:37,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:37,740 INFO L93 Difference]: Finished difference Result 147 states and 186 transitions. [2022-04-08 10:05:37,740 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 186 transitions. [2022-04-08 10:05:37,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:37,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:37,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 131 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 147 states. [2022-04-08 10:05:37,740 INFO L87 Difference]: Start difference. First operand has 136 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 131 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 147 states. [2022-04-08 10:05:37,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:37,742 INFO L93 Difference]: Finished difference Result 147 states and 186 transitions. [2022-04-08 10:05:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 186 transitions. [2022-04-08 10:05:37,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:37,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:37,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:37,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 131 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 175 transitions. [2022-04-08 10:05:37,744 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 175 transitions. Word has length 37 [2022-04-08 10:05:37,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:37,744 INFO L478 AbstractCegarLoop]: Abstraction has 136 states and 175 transitions. [2022-04-08 10:05:37,744 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:05:37,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 175 transitions. [2022-04-08 10:05:38,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:38,054 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 175 transitions. [2022-04-08 10:05:38,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:05:38,055 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:38,055 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:38,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2022-04-08 10:05:38,255 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:38,255 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:38,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:38,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1252004433, now seen corresponding path program 119 times [2022-04-08 10:05:38,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:38,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [462458687] [2022-04-08 10:05:38,259 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:38,260 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:38,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1252004433, now seen corresponding path program 120 times [2022-04-08 10:05:38,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:38,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565130001] [2022-04-08 10:05:38,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:38,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:38,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:38,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {51092#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {51072#true} is VALID [2022-04-08 10:05:38,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {51072#true} assume true; {51072#true} is VALID [2022-04-08 10:05:38,553 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51072#true} {51072#true} #61#return; {51072#true} is VALID [2022-04-08 10:05:38,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {51072#true} call ULTIMATE.init(); {51092#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:38,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {51092#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {51072#true} is VALID [2022-04-08 10:05:38,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {51072#true} assume true; {51072#true} is VALID [2022-04-08 10:05:38,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51072#true} {51072#true} #61#return; {51072#true} is VALID [2022-04-08 10:05:38,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {51072#true} call #t~ret11 := main(); {51072#true} is VALID [2022-04-08 10:05:38,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {51072#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51077#(= main_~y~0 0)} is VALID [2022-04-08 10:05:38,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {51077#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51078#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:38,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {51078#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51079#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:38,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {51079#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51080#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:38,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {51080#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51081#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:38,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {51081#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51082#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:38,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {51082#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51083#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:38,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {51083#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51084#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:38,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {51084#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51085#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:38,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {51085#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51086#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:38,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {51086#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51087#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:38,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {51087#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {51087#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:38,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {51087#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {51088#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:05:38,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {51088#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51089#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:38,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {51089#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51090#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:38,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {51090#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51091#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:05:38,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {51091#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {51073#false} is VALID [2022-04-08 10:05:38,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:38,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:38,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:38,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:38,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:38,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:38,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:38,565 INFO L290 TraceCheckUtils]: 29: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:38,565 INFO L290 TraceCheckUtils]: 30: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:38,565 INFO L290 TraceCheckUtils]: 31: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:38,565 INFO L290 TraceCheckUtils]: 32: Hoare triple {51073#false} assume !(~y~0 % 4294967296 > 0); {51073#false} is VALID [2022-04-08 10:05:38,565 INFO L272 TraceCheckUtils]: 33: Hoare triple {51073#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {51073#false} is VALID [2022-04-08 10:05:38,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {51073#false} ~cond := #in~cond; {51073#false} is VALID [2022-04-08 10:05:38,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {51073#false} assume 0 == ~cond; {51073#false} is VALID [2022-04-08 10:05:38,565 INFO L290 TraceCheckUtils]: 36: Hoare triple {51073#false} assume !false; {51073#false} is VALID [2022-04-08 10:05:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:05:38,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:38,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565130001] [2022-04-08 10:05:38,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565130001] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:38,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709942617] [2022-04-08 10:05:38,566 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:05:38,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:38,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:38,567 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:38,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-04-08 10:05:38,684 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:05:38,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:38,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:05:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:38,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:38,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {51072#true} call ULTIMATE.init(); {51072#true} is VALID [2022-04-08 10:05:38,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {51072#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {51072#true} is VALID [2022-04-08 10:05:38,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {51072#true} assume true; {51072#true} is VALID [2022-04-08 10:05:38,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51072#true} {51072#true} #61#return; {51072#true} is VALID [2022-04-08 10:05:38,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {51072#true} call #t~ret11 := main(); {51072#true} is VALID [2022-04-08 10:05:38,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {51072#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51077#(= main_~y~0 0)} is VALID [2022-04-08 10:05:38,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {51077#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51078#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:38,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {51078#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51079#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:38,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {51079#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51080#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:38,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {51080#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51081#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:38,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {51081#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51082#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:38,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {51082#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51083#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:38,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {51083#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51084#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:38,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {51084#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51085#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:38,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {51085#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51086#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:38,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {51086#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51087#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:38,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {51087#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {51087#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:38,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {51087#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {51088#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:05:38,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {51088#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51089#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:38,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {51089#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51090#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:38,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {51090#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51156#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:38,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {51156#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {51073#false} is VALID [2022-04-08 10:05:38,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:38,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:38,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:38,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:38,979 INFO L290 TraceCheckUtils]: 26: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:38,979 INFO L290 TraceCheckUtils]: 27: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:38,979 INFO L290 TraceCheckUtils]: 28: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:38,979 INFO L290 TraceCheckUtils]: 29: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:38,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:38,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:38,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {51073#false} assume !(~y~0 % 4294967296 > 0); {51073#false} is VALID [2022-04-08 10:05:38,980 INFO L272 TraceCheckUtils]: 33: Hoare triple {51073#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {51073#false} is VALID [2022-04-08 10:05:38,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {51073#false} ~cond := #in~cond; {51073#false} is VALID [2022-04-08 10:05:38,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {51073#false} assume 0 == ~cond; {51073#false} is VALID [2022-04-08 10:05:38,981 INFO L290 TraceCheckUtils]: 36: Hoare triple {51073#false} assume !false; {51073#false} is VALID [2022-04-08 10:05:38,981 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:05:38,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:39,383 INFO L290 TraceCheckUtils]: 36: Hoare triple {51073#false} assume !false; {51073#false} is VALID [2022-04-08 10:05:39,383 INFO L290 TraceCheckUtils]: 35: Hoare triple {51073#false} assume 0 == ~cond; {51073#false} is VALID [2022-04-08 10:05:39,383 INFO L290 TraceCheckUtils]: 34: Hoare triple {51073#false} ~cond := #in~cond; {51073#false} is VALID [2022-04-08 10:05:39,383 INFO L272 TraceCheckUtils]: 33: Hoare triple {51073#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {51073#false} is VALID [2022-04-08 10:05:39,383 INFO L290 TraceCheckUtils]: 32: Hoare triple {51073#false} assume !(~y~0 % 4294967296 > 0); {51073#false} is VALID [2022-04-08 10:05:39,383 INFO L290 TraceCheckUtils]: 31: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:39,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:39,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:39,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:39,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:39,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:39,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:39,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:39,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:39,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-08 10:05:39,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {51250#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {51073#false} is VALID [2022-04-08 10:05:39,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {51254#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51250#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:39,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {51258#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51254#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:39,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {51262#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51258#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:39,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {51266#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {51262#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:39,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {51266#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {51266#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:39,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {51273#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51266#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:39,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {51277#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51273#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:39,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {51281#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51277#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:39,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {51285#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51281#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:39,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {51289#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51285#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:39,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {51293#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51289#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:39,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {51297#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51293#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:39,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {51301#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51297#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:39,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {51305#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51301#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:39,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {51309#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51305#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:05:39,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {51072#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51309#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:39,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {51072#true} call #t~ret11 := main(); {51072#true} is VALID [2022-04-08 10:05:39,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51072#true} {51072#true} #61#return; {51072#true} is VALID [2022-04-08 10:05:39,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {51072#true} assume true; {51072#true} is VALID [2022-04-08 10:05:39,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {51072#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {51072#true} is VALID [2022-04-08 10:05:39,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {51072#true} call ULTIMATE.init(); {51072#true} is VALID [2022-04-08 10:05:39,394 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:05:39,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709942617] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:39,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:39,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-08 10:05:39,395 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:39,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [462458687] [2022-04-08 10:05:39,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [462458687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:39,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:39,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:05:39,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569816475] [2022-04-08 10:05:39,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:39,395 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-08 10:05:39,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:39,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:39,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:39,414 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:05:39,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:39,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:05:39,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:05:39,414 INFO L87 Difference]: Start difference. First operand 136 states and 175 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:41,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:41,064 INFO L93 Difference]: Finished difference Result 165 states and 204 transitions. [2022-04-08 10:05:41,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:05:41,064 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-08 10:05:41,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 68 transitions. [2022-04-08 10:05:41,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 68 transitions. [2022-04-08 10:05:41,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 68 transitions. [2022-04-08 10:05:41,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:41,120 INFO L225 Difference]: With dead ends: 165 [2022-04-08 10:05:41,120 INFO L226 Difference]: Without dead ends: 149 [2022-04-08 10:05:41,120 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=568, Invalid=2294, Unknown=0, NotChecked=0, Total=2862 [2022-04-08 10:05:41,120 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:41,121 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 92 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:05:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-08 10:05:41,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 137. [2022-04-08 10:05:41,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:41,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 137 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:41,519 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 137 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:41,519 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 137 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:41,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:41,520 INFO L93 Difference]: Finished difference Result 149 states and 188 transitions. [2022-04-08 10:05:41,520 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 188 transitions. [2022-04-08 10:05:41,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:41,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:41,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 149 states. [2022-04-08 10:05:41,521 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 149 states. [2022-04-08 10:05:41,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:41,522 INFO L93 Difference]: Finished difference Result 149 states and 188 transitions. [2022-04-08 10:05:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 188 transitions. [2022-04-08 10:05:41,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:41,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:41,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:41,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 176 transitions. [2022-04-08 10:05:41,524 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 176 transitions. Word has length 37 [2022-04-08 10:05:41,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:41,524 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 176 transitions. [2022-04-08 10:05:41,524 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:41,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 176 transitions. [2022-04-08 10:05:41,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:41,843 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 176 transitions. [2022-04-08 10:05:41,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:05:41,843 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:41,843 INFO L499 BasicCegarLoop]: trace histogram [20, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:41,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:42,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-04-08 10:05:42,044 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:42,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:42,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1886534095, now seen corresponding path program 121 times [2022-04-08 10:05:42,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:42,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [722398982] [2022-04-08 10:05:42,047 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:42,048 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:42,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1886534095, now seen corresponding path program 122 times [2022-04-08 10:05:42,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:42,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897731736] [2022-04-08 10:05:42,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:42,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:42,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:42,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {52300#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52272#true} is VALID [2022-04-08 10:05:42,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {52272#true} assume true; {52272#true} is VALID [2022-04-08 10:05:42,436 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52272#true} {52272#true} #61#return; {52272#true} is VALID [2022-04-08 10:05:42,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {52272#true} call ULTIMATE.init(); {52300#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:42,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {52300#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52272#true} is VALID [2022-04-08 10:05:42,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {52272#true} assume true; {52272#true} is VALID [2022-04-08 10:05:42,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52272#true} {52272#true} #61#return; {52272#true} is VALID [2022-04-08 10:05:42,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {52272#true} call #t~ret11 := main(); {52272#true} is VALID [2022-04-08 10:05:42,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {52272#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52277#(= main_~y~0 0)} is VALID [2022-04-08 10:05:42,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {52277#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52278#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:42,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {52278#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52279#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:42,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {52279#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52280#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:42,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {52280#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52281#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:42,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {52281#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52282#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:42,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {52282#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52283#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:42,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {52283#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52284#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:42,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {52284#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52285#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:42,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {52285#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52286#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:42,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {52286#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52287#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:42,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {52287#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52288#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:42,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {52288#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52289#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:42,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {52289#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52290#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:42,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {52290#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52291#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:42,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {52291#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52292#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:05:42,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {52292#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52293#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:05:42,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {52293#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52294#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:05:42,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {52294#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52295#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:05:42,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {52295#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52296#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:05:42,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {52296#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:05:42,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:05:42,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {52298#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-08 10:05:42,448 INFO L290 TraceCheckUtils]: 28: Hoare triple {52298#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52299#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:05:42,449 INFO L290 TraceCheckUtils]: 29: Hoare triple {52299#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {52273#false} is VALID [2022-04-08 10:05:42,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {52273#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {52273#false} is VALID [2022-04-08 10:05:42,449 INFO L290 TraceCheckUtils]: 31: Hoare triple {52273#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {52273#false} is VALID [2022-04-08 10:05:42,449 INFO L290 TraceCheckUtils]: 32: Hoare triple {52273#false} assume !(~y~0 % 4294967296 > 0); {52273#false} is VALID [2022-04-08 10:05:42,449 INFO L272 TraceCheckUtils]: 33: Hoare triple {52273#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {52273#false} is VALID [2022-04-08 10:05:42,449 INFO L290 TraceCheckUtils]: 34: Hoare triple {52273#false} ~cond := #in~cond; {52273#false} is VALID [2022-04-08 10:05:42,449 INFO L290 TraceCheckUtils]: 35: Hoare triple {52273#false} assume 0 == ~cond; {52273#false} is VALID [2022-04-08 10:05:42,449 INFO L290 TraceCheckUtils]: 36: Hoare triple {52273#false} assume !false; {52273#false} is VALID [2022-04-08 10:05:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:05:42,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:42,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897731736] [2022-04-08 10:05:42,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897731736] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:42,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130132392] [2022-04-08 10:05:42,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:05:42,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:42,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:42,451 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:42,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-04-08 10:05:42,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:05:42,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:42,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 10:05:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:42,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:42,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {52272#true} call ULTIMATE.init(); {52272#true} is VALID [2022-04-08 10:05:42,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {52272#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52272#true} is VALID [2022-04-08 10:05:42,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {52272#true} assume true; {52272#true} is VALID [2022-04-08 10:05:42,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52272#true} {52272#true} #61#return; {52272#true} is VALID [2022-04-08 10:05:42,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {52272#true} call #t~ret11 := main(); {52272#true} is VALID [2022-04-08 10:05:42,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {52272#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52277#(= main_~y~0 0)} is VALID [2022-04-08 10:05:42,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {52277#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52278#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:42,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {52278#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52279#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:42,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {52279#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52280#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:42,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {52280#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52281#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:42,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {52281#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52282#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:42,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {52282#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52283#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:42,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {52283#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52284#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:42,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {52284#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52285#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:42,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {52285#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52286#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:42,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {52286#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52287#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:42,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {52287#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52288#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:42,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {52288#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52289#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:42,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {52289#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52290#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:42,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {52290#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52291#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:42,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {52291#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52292#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:05:42,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {52292#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52293#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:05:42,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {52293#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52294#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:05:42,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {52294#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52295#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:05:42,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {52295#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52296#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:05:42,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {52296#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:05:42,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:05:42,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:05:42,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:05:42,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~z~0 % 4294967296 > 0); {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:05:42,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {52296#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:05:42,838 INFO L290 TraceCheckUtils]: 31: Hoare triple {52296#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {52295#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:05:42,838 INFO L290 TraceCheckUtils]: 32: Hoare triple {52295#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~y~0 % 4294967296 > 0); {52273#false} is VALID [2022-04-08 10:05:42,838 INFO L272 TraceCheckUtils]: 33: Hoare triple {52273#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {52273#false} is VALID [2022-04-08 10:05:42,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {52273#false} ~cond := #in~cond; {52273#false} is VALID [2022-04-08 10:05:42,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {52273#false} assume 0 == ~cond; {52273#false} is VALID [2022-04-08 10:05:42,839 INFO L290 TraceCheckUtils]: 36: Hoare triple {52273#false} assume !false; {52273#false} is VALID [2022-04-08 10:05:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:05:42,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:43,608 INFO L290 TraceCheckUtils]: 36: Hoare triple {52273#false} assume !false; {52273#false} is VALID [2022-04-08 10:05:43,609 INFO L290 TraceCheckUtils]: 35: Hoare triple {52273#false} assume 0 == ~cond; {52273#false} is VALID [2022-04-08 10:05:43,609 INFO L290 TraceCheckUtils]: 34: Hoare triple {52273#false} ~cond := #in~cond; {52273#false} is VALID [2022-04-08 10:05:43,609 INFO L272 TraceCheckUtils]: 33: Hoare triple {52273#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {52273#false} is VALID [2022-04-08 10:05:43,609 INFO L290 TraceCheckUtils]: 32: Hoare triple {52424#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {52273#false} is VALID [2022-04-08 10:05:43,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {52428#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {52424#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:43,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {52432#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {52428#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:43,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {52432#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {52432#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:43,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {52432#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52432#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:43,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {52432#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {52432#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:43,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {52432#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {52432#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:43,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {52428#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52432#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:43,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {52424#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52428#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:43,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {52454#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52424#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:43,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {52458#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52454#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:43,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {52462#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52458#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:43,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {52466#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52462#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:43,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {52470#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52466#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:43,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {52474#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52470#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:43,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {52478#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52474#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:05:43,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {52482#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52478#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:43,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {52486#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52482#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:05:43,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {52490#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52486#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:05:43,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {52494#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52490#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:05:43,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {52498#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52494#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:05:43,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {52502#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52498#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:05:43,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {52506#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52502#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:05:43,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {52510#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52506#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:05:43,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {52514#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52510#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:05:43,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {52518#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52514#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:05:43,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {52522#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52518#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:05:43,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {52272#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52522#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:05:43,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {52272#true} call #t~ret11 := main(); {52272#true} is VALID [2022-04-08 10:05:43,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52272#true} {52272#true} #61#return; {52272#true} is VALID [2022-04-08 10:05:43,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {52272#true} assume true; {52272#true} is VALID [2022-04-08 10:05:43,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {52272#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52272#true} is VALID [2022-04-08 10:05:43,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {52272#true} call ULTIMATE.init(); {52272#true} is VALID [2022-04-08 10:05:43,625 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:05:43,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130132392] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:43,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:43,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 23] total 47 [2022-04-08 10:05:43,627 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:43,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [722398982] [2022-04-08 10:05:43,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [722398982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:43,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:43,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 10:05:43,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174435803] [2022-04-08 10:05:43,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:43,628 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-08 10:05:43,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:43,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:43,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:43,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 10:05:43,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:43,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 10:05:43,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=1632, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 10:05:43,651 INFO L87 Difference]: Start difference. First operand 137 states and 176 transitions. Second operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:47,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:47,418 INFO L93 Difference]: Finished difference Result 211 states and 300 transitions. [2022-04-08 10:05:47,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 10:05:47,418 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-08 10:05:47,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:47,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:47,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 142 transitions. [2022-04-08 10:05:47,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:47,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 142 transitions. [2022-04-08 10:05:47,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 142 transitions. [2022-04-08 10:05:47,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:47,534 INFO L225 Difference]: With dead ends: 211 [2022-04-08 10:05:47,534 INFO L226 Difference]: Without dead ends: 203 [2022-04-08 10:05:47,534 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1135, Invalid=3835, Unknown=0, NotChecked=0, Total=4970 [2022-04-08 10:05:47,535 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 115 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2143 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:47,535 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 159 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2143 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-08 10:05:47,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-04-08 10:05:47,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 143. [2022-04-08 10:05:47,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:47,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 143 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 138 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:47,969 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 143 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 138 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:47,969 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 143 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 138 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:47,971 INFO L93 Difference]: Finished difference Result 203 states and 250 transitions. [2022-04-08 10:05:47,972 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 250 transitions. [2022-04-08 10:05:47,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:47,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:47,972 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 138 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 203 states. [2022-04-08 10:05:47,972 INFO L87 Difference]: Start difference. First operand has 143 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 138 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 203 states. [2022-04-08 10:05:47,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:47,974 INFO L93 Difference]: Finished difference Result 203 states and 250 transitions. [2022-04-08 10:05:47,974 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 250 transitions. [2022-04-08 10:05:47,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:47,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:47,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:47,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 138 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:47,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 184 transitions. [2022-04-08 10:05:47,976 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 184 transitions. Word has length 37 [2022-04-08 10:05:47,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:47,976 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 184 transitions. [2022-04-08 10:05:47,976 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:47,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 184 transitions. [2022-04-08 10:05:48,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:48,303 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 184 transitions. [2022-04-08 10:05:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:05:48,303 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:48,303 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:48,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2022-04-08 10:05:48,504 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2022-04-08 10:05:48,504 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:48,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:48,504 INFO L85 PathProgramCache]: Analyzing trace with hash 402939981, now seen corresponding path program 123 times [2022-04-08 10:05:48,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:48,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1307126379] [2022-04-08 10:05:48,506 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:48,506 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:48,506 INFO L85 PathProgramCache]: Analyzing trace with hash 402939981, now seen corresponding path program 124 times [2022-04-08 10:05:48,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:48,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442229410] [2022-04-08 10:05:48,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:48,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:48,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:48,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {53721#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53705#true} is VALID [2022-04-08 10:05:48,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {53705#true} assume true; {53705#true} is VALID [2022-04-08 10:05:48,724 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53705#true} {53705#true} #61#return; {53705#true} is VALID [2022-04-08 10:05:48,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {53705#true} call ULTIMATE.init(); {53721#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:48,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {53721#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53705#true} is VALID [2022-04-08 10:05:48,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {53705#true} assume true; {53705#true} is VALID [2022-04-08 10:05:48,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53705#true} {53705#true} #61#return; {53705#true} is VALID [2022-04-08 10:05:48,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {53705#true} call #t~ret11 := main(); {53705#true} is VALID [2022-04-08 10:05:48,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {53705#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53705#true} is VALID [2022-04-08 10:05:48,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:48,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:48,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:48,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:48,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:48,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:48,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:48,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:48,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {53705#true} assume !(~x~0 % 4294967296 > 0); {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:05:48,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:05:48,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53711#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:05:48,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {53711#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53712#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:48,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {53712#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53713#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:48,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {53713#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53714#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:48,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {53714#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53715#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:05:48,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {53715#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53716#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:48,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {53716#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:48,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:48,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:48,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:48,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53716#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:48,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {53716#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53715#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:05:48,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {53715#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53714#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:48,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {53714#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53713#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:48,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {53713#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53712#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:48,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {53712#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53711#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:05:48,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {53711#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:05:48,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:05:48,742 INFO L272 TraceCheckUtils]: 34: Hoare triple {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {53719#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:05:48,743 INFO L290 TraceCheckUtils]: 35: Hoare triple {53719#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {53720#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:05:48,743 INFO L290 TraceCheckUtils]: 36: Hoare triple {53720#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {53706#false} is VALID [2022-04-08 10:05:48,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {53706#false} assume !false; {53706#false} is VALID [2022-04-08 10:05:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:05:48,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:48,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442229410] [2022-04-08 10:05:48,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442229410] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:48,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229553410] [2022-04-08 10:05:48,744 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:05:48,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:48,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:48,745 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:48,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-04-08 10:05:48,803 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:05:48,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:48,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 10:05:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:48,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:49,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {53705#true} call ULTIMATE.init(); {53705#true} is VALID [2022-04-08 10:05:49,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {53705#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53705#true} is VALID [2022-04-08 10:05:49,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {53705#true} assume true; {53705#true} is VALID [2022-04-08 10:05:49,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53705#true} {53705#true} #61#return; {53705#true} is VALID [2022-04-08 10:05:49,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {53705#true} call #t~ret11 := main(); {53705#true} is VALID [2022-04-08 10:05:49,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {53705#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53705#true} is VALID [2022-04-08 10:05:49,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:49,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:49,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:49,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:49,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:49,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:49,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:49,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:49,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {53705#true} assume !(~x~0 % 4294967296 > 0); {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:05:49,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:05:49,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53711#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:05:49,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {53711#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53712#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {53712#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53713#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {53713#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53714#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {53714#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53715#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:05:49,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {53715#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53716#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {53716#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,119 INFO L290 TraceCheckUtils]: 26: Hoare triple {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53716#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {53716#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53715#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:05:49,120 INFO L290 TraceCheckUtils]: 28: Hoare triple {53715#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53714#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {53714#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53713#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {53713#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53712#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {53712#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53711#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:05:49,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {53711#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:05:49,124 INFO L290 TraceCheckUtils]: 33: Hoare triple {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:05:49,124 INFO L272 TraceCheckUtils]: 34: Hoare triple {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {53827#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:05:49,125 INFO L290 TraceCheckUtils]: 35: Hoare triple {53827#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {53831#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:05:49,125 INFO L290 TraceCheckUtils]: 36: Hoare triple {53831#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {53706#false} is VALID [2022-04-08 10:05:49,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {53706#false} assume !false; {53706#false} is VALID [2022-04-08 10:05:49,131 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:05:49,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:49,421 INFO L290 TraceCheckUtils]: 37: Hoare triple {53706#false} assume !false; {53706#false} is VALID [2022-04-08 10:05:49,421 INFO L290 TraceCheckUtils]: 36: Hoare triple {53831#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {53706#false} is VALID [2022-04-08 10:05:49,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {53827#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {53831#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:05:49,422 INFO L272 TraceCheckUtils]: 34: Hoare triple {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {53827#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:05:49,422 INFO L290 TraceCheckUtils]: 33: Hoare triple {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:05:49,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {53711#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:05:49,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {53712#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53711#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:05:49,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {53713#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53712#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {53714#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53713#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {53715#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53714#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {53716#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53715#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:05:49,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53716#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {53716#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {53715#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53716#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {53714#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53715#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:05:49,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {53713#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53714#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {53712#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53713#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {53711#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53712#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:49,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53711#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:05:49,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:05:49,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {53705#true} assume !(~x~0 % 4294967296 > 0); {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:05:49,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:49,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:49,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:49,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:49,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:49,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:49,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:49,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {53705#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53705#true} is VALID [2022-04-08 10:05:49,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {53705#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53705#true} is VALID [2022-04-08 10:05:49,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {53705#true} call #t~ret11 := main(); {53705#true} is VALID [2022-04-08 10:05:49,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53705#true} {53705#true} #61#return; {53705#true} is VALID [2022-04-08 10:05:49,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {53705#true} assume true; {53705#true} is VALID [2022-04-08 10:05:49,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {53705#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53705#true} is VALID [2022-04-08 10:05:49,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {53705#true} call ULTIMATE.init(); {53705#true} is VALID [2022-04-08 10:05:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:05:49,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229553410] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:49,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:49,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 16 [2022-04-08 10:05:49,436 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:49,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1307126379] [2022-04-08 10:05:49,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1307126379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:49,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:49,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:05:49,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679044216] [2022-04-08 10:05:49,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:49,437 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) 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 38 [2022-04-08 10:05:49,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:49,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 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-08 10:05:49,462 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-08 10:05:49,462 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:05:49,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:49,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:05:49,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:05:49,463 INFO L87 Difference]: Start difference. First operand 143 states and 184 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) 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-08 10:05:52,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:52,245 INFO L93 Difference]: Finished difference Result 395 states and 523 transitions. [2022-04-08 10:05:52,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 10:05:52,245 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) 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 38 [2022-04-08 10:05:52,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:52,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) 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-08 10:05:52,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2022-04-08 10:05:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) 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-08 10:05:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2022-04-08 10:05:52,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 62 transitions. [2022-04-08 10:05:52,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:52,307 INFO L225 Difference]: With dead ends: 395 [2022-04-08 10:05:52,307 INFO L226 Difference]: Without dead ends: 381 [2022-04-08 10:05:52,307 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2022-04-08 10:05:52,308 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 35 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:52,308 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 92 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:05:52,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-04-08 10:05:52,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 147. [2022-04-08 10:05:52,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:52,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 381 states. Second operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:52,763 INFO L74 IsIncluded]: Start isIncluded. First operand 381 states. Second operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:52,763 INFO L87 Difference]: Start difference. First operand 381 states. Second operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:52,773 INFO L93 Difference]: Finished difference Result 381 states and 508 transitions. [2022-04-08 10:05:52,773 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 508 transitions. [2022-04-08 10:05:52,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:52,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:52,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 381 states. [2022-04-08 10:05:52,774 INFO L87 Difference]: Start difference. First operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 381 states. [2022-04-08 10:05:52,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:52,781 INFO L93 Difference]: Finished difference Result 381 states and 508 transitions. [2022-04-08 10:05:52,781 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 508 transitions. [2022-04-08 10:05:52,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:52,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:52,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:52,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:52,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 190 transitions. [2022-04-08 10:05:52,783 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 190 transitions. Word has length 38 [2022-04-08 10:05:52,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:52,783 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 190 transitions. [2022-04-08 10:05:52,783 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) 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-08 10:05:52,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 190 transitions. [2022-04-08 10:05:53,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 190 transitions. [2022-04-08 10:05:53,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:05:53,154 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:53,154 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:53,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:53,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:53,355 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:53,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:53,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1555480447, now seen corresponding path program 125 times [2022-04-08 10:05:53,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:53,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [639071152] [2022-04-08 10:05:53,357 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:53,357 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:53,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1555480447, now seen corresponding path program 126 times [2022-04-08 10:05:53,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:53,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839665285] [2022-04-08 10:05:53,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:53,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:53,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:53,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {55841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {55819#true} is VALID [2022-04-08 10:05:53,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {55819#true} assume true; {55819#true} is VALID [2022-04-08 10:05:53,664 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55819#true} {55819#true} #61#return; {55819#true} is VALID [2022-04-08 10:05:53,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {55819#true} call ULTIMATE.init(); {55841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:53,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {55841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {55819#true} is VALID [2022-04-08 10:05:53,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {55819#true} assume true; {55819#true} is VALID [2022-04-08 10:05:53,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55819#true} {55819#true} #61#return; {55819#true} is VALID [2022-04-08 10:05:53,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {55819#true} call #t~ret11 := main(); {55819#true} is VALID [2022-04-08 10:05:53,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {55819#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55824#(= main_~y~0 0)} is VALID [2022-04-08 10:05:53,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {55824#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55825#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:53,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {55825#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55826#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:53,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {55826#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55827#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:53,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {55827#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55828#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:53,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {55828#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55829#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:53,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {55829#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55830#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:53,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {55830#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55831#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:53,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {55831#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55832#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:53,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {55832#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55833#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:53,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {55833#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {55833#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:53,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {55833#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {55834#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:53,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {55834#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55835#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:53,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {55835#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55836#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:53,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {55836#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55837#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:53,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {55837#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55838#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:05:53,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {55838#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55839#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:05:53,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {55839#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55840#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:05:53,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {55840#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {55820#false} is VALID [2022-04-08 10:05:53,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-08 10:05:53,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-08 10:05:53,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-08 10:05:53,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-08 10:05:53,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-08 10:05:53,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-08 10:05:53,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-08 10:05:53,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-08 10:05:53,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-08 10:05:53,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {55820#false} assume !(~y~0 % 4294967296 > 0); {55820#false} is VALID [2022-04-08 10:05:53,676 INFO L272 TraceCheckUtils]: 34: Hoare triple {55820#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {55820#false} is VALID [2022-04-08 10:05:53,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {55820#false} ~cond := #in~cond; {55820#false} is VALID [2022-04-08 10:05:53,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {55820#false} assume 0 == ~cond; {55820#false} is VALID [2022-04-08 10:05:53,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {55820#false} assume !false; {55820#false} is VALID [2022-04-08 10:05:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:05:53,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:53,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839665285] [2022-04-08 10:05:53,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839665285] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:53,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588745786] [2022-04-08 10:05:53,677 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:05:53,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:53,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:53,680 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:53,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-04-08 10:05:53,905 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:05:53,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:53,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 10:05:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:53,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:54,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {55819#true} call ULTIMATE.init(); {55819#true} is VALID [2022-04-08 10:05:54,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {55819#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {55819#true} is VALID [2022-04-08 10:05:54,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {55819#true} assume true; {55819#true} is VALID [2022-04-08 10:05:54,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55819#true} {55819#true} #61#return; {55819#true} is VALID [2022-04-08 10:05:54,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {55819#true} call #t~ret11 := main(); {55819#true} is VALID [2022-04-08 10:05:54,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {55819#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55824#(= main_~y~0 0)} is VALID [2022-04-08 10:05:54,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {55824#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55825#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:54,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {55825#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55826#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:54,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {55826#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55827#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:54,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {55827#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55828#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:54,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {55828#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55829#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:54,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {55829#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55830#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:54,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {55830#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55831#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:54,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {55831#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55832#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:54,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {55832#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55833#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:54,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {55833#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {55833#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:54,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {55833#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {55893#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:54,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {55893#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55897#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:05:54,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {55897#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55901#(and (= main_~y~0 (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:54,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {55901#(and (= main_~y~0 (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55905#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:54,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {55905#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55909#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:54,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {55909#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55913#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:54,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {55913#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55917#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:54,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {55917#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~z~0 % 4294967296 > 0); {55820#false} is VALID [2022-04-08 10:05:54,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-08 10:05:54,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-08 10:05:54,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-08 10:05:54,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-08 10:05:54,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-08 10:05:54,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-08 10:05:54,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-08 10:05:54,256 INFO L290 TraceCheckUtils]: 31: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-08 10:05:54,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-08 10:05:54,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {55820#false} assume !(~y~0 % 4294967296 > 0); {55820#false} is VALID [2022-04-08 10:05:54,256 INFO L272 TraceCheckUtils]: 34: Hoare triple {55820#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {55820#false} is VALID [2022-04-08 10:05:54,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {55820#false} ~cond := #in~cond; {55820#false} is VALID [2022-04-08 10:05:54,256 INFO L290 TraceCheckUtils]: 36: Hoare triple {55820#false} assume 0 == ~cond; {55820#false} is VALID [2022-04-08 10:05:54,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {55820#false} assume !false; {55820#false} is VALID [2022-04-08 10:05:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:05:54,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:54,726 INFO L290 TraceCheckUtils]: 37: Hoare triple {55820#false} assume !false; {55820#false} is VALID [2022-04-08 10:05:54,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {55820#false} assume 0 == ~cond; {55820#false} is VALID [2022-04-08 10:05:54,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {55820#false} ~cond := #in~cond; {55820#false} is VALID [2022-04-08 10:05:54,727 INFO L272 TraceCheckUtils]: 34: Hoare triple {55820#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {55820#false} is VALID [2022-04-08 10:05:54,727 INFO L290 TraceCheckUtils]: 33: Hoare triple {55820#false} assume !(~y~0 % 4294967296 > 0); {55820#false} is VALID [2022-04-08 10:05:54,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-08 10:05:54,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-08 10:05:54,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {55984#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-08 10:05:54,728 INFO L290 TraceCheckUtils]: 29: Hoare triple {55988#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55984#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:05:54,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {55992#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55988#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:05:54,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {55996#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55992#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:05:54,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {56000#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55996#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:05:54,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {56004#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {56000#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:05:54,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {56008#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {56004#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:05:54,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {56012#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {56008#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:05:54,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {56016#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {56012#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:05:54,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {56020#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {56016#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:05:54,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {56024#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {56020#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:05:54,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {56028#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {56024#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:05:54,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {56032#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {56028#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:05:54,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {56036#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {56032#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:05:54,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {55819#true} ~z~0 := ~y~0; {56036#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:05:54,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {55819#true} assume !(~x~0 % 4294967296 > 0); {55819#true} is VALID [2022-04-08 10:05:54,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {55819#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55819#true} is VALID [2022-04-08 10:05:54,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {55819#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55819#true} is VALID [2022-04-08 10:05:54,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {55819#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55819#true} is VALID [2022-04-08 10:05:54,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {55819#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55819#true} is VALID [2022-04-08 10:05:54,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {55819#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55819#true} is VALID [2022-04-08 10:05:54,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {55819#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55819#true} is VALID [2022-04-08 10:05:54,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {55819#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55819#true} is VALID [2022-04-08 10:05:54,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {55819#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55819#true} is VALID [2022-04-08 10:05:54,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {55819#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55819#true} is VALID [2022-04-08 10:05:54,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {55819#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55819#true} is VALID [2022-04-08 10:05:54,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {55819#true} call #t~ret11 := main(); {55819#true} is VALID [2022-04-08 10:05:54,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55819#true} {55819#true} #61#return; {55819#true} is VALID [2022-04-08 10:05:54,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {55819#true} assume true; {55819#true} is VALID [2022-04-08 10:05:54,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {55819#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {55819#true} is VALID [2022-04-08 10:05:54,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {55819#true} call ULTIMATE.init(); {55819#true} is VALID [2022-04-08 10:05:54,739 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 10:05:54,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588745786] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:54,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:54,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 16] total 41 [2022-04-08 10:05:54,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:54,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [639071152] [2022-04-08 10:05:54,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [639071152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:54,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:54,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:05:54,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41426104] [2022-04-08 10:05:54,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:54,740 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 10:05:54,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:54,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:54,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:54,760 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:05:54,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:54,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:05:54,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1427, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 10:05:54,761 INFO L87 Difference]: Start difference. First operand 147 states and 190 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:56,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:56,779 INFO L93 Difference]: Finished difference Result 174 states and 217 transitions. [2022-04-08 10:05:56,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 10:05:56,779 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 10:05:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:56,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 66 transitions. [2022-04-08 10:05:56,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:56,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 66 transitions. [2022-04-08 10:05:56,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 66 transitions. [2022-04-08 10:05:56,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:56,846 INFO L225 Difference]: With dead ends: 174 [2022-04-08 10:05:56,846 INFO L226 Difference]: Without dead ends: 159 [2022-04-08 10:05:56,847 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=450, Invalid=3582, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 10:05:56,847 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:56,847 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 100 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:05:56,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-04-08 10:05:57,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 148. [2022-04-08 10:05:57,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:57,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:57,285 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:57,285 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:57,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:57,287 INFO L93 Difference]: Finished difference Result 159 states and 202 transitions. [2022-04-08 10:05:57,287 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 202 transitions. [2022-04-08 10:05:57,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:57,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:57,287 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 159 states. [2022-04-08 10:05:57,287 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 159 states. [2022-04-08 10:05:57,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:57,289 INFO L93 Difference]: Finished difference Result 159 states and 202 transitions. [2022-04-08 10:05:57,289 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 202 transitions. [2022-04-08 10:05:57,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:57,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:57,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:57,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:57,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2022-04-08 10:05:57,291 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 38 [2022-04-08 10:05:57,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:57,291 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 191 transitions. [2022-04-08 10:05:57,291 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:57,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 191 transitions. [2022-04-08 10:05:57,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:57,671 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 191 transitions. [2022-04-08 10:05:57,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:05:57,672 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:57,672 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:57,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2022-04-08 10:05:57,875 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-04-08 10:05:57,875 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:57,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:57,876 INFO L85 PathProgramCache]: Analyzing trace with hash 630692429, now seen corresponding path program 127 times [2022-04-08 10:05:57,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:57,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1937440579] [2022-04-08 10:05:57,878 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:57,878 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:57,878 INFO L85 PathProgramCache]: Analyzing trace with hash 630692429, now seen corresponding path program 128 times [2022-04-08 10:05:57,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:57,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66741284] [2022-04-08 10:05:57,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:57,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:58,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:58,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {57119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {57098#true} is VALID [2022-04-08 10:05:58,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {57098#true} assume true; {57098#true} is VALID [2022-04-08 10:05:58,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57098#true} {57098#true} #61#return; {57098#true} is VALID [2022-04-08 10:05:58,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {57098#true} call ULTIMATE.init(); {57119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:58,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {57119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {57098#true} is VALID [2022-04-08 10:05:58,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {57098#true} assume true; {57098#true} is VALID [2022-04-08 10:05:58,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57098#true} {57098#true} #61#return; {57098#true} is VALID [2022-04-08 10:05:58,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {57098#true} call #t~ret11 := main(); {57098#true} is VALID [2022-04-08 10:05:58,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {57098#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57103#(= main_~y~0 0)} is VALID [2022-04-08 10:05:58,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {57103#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57104#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:58,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {57104#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57105#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:58,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {57105#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57106#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:58,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {57106#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57107#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:58,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {57107#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57108#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:58,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {57108#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57109#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:58,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {57109#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57110#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:58,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {57110#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57111#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:58,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {57111#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57112#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:58,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {57112#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57113#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:58,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {57113#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {57113#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:58,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {57113#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {57114#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:05:58,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {57114#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57115#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:58,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {57115#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57116#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:58,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {57116#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57117#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:58,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {57117#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57118#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:58,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {57118#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {57099#false} is VALID [2022-04-08 10:05:58,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,127 INFO L290 TraceCheckUtils]: 28: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,127 INFO L290 TraceCheckUtils]: 33: Hoare triple {57099#false} assume !(~y~0 % 4294967296 > 0); {57099#false} is VALID [2022-04-08 10:05:58,127 INFO L272 TraceCheckUtils]: 34: Hoare triple {57099#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {57099#false} is VALID [2022-04-08 10:05:58,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {57099#false} ~cond := #in~cond; {57099#false} is VALID [2022-04-08 10:05:58,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {57099#false} assume 0 == ~cond; {57099#false} is VALID [2022-04-08 10:05:58,127 INFO L290 TraceCheckUtils]: 37: Hoare triple {57099#false} assume !false; {57099#false} is VALID [2022-04-08 10:05:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:05:58,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:58,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66741284] [2022-04-08 10:05:58,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66741284] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:58,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743114954] [2022-04-08 10:05:58,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:05:58,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:58,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:58,128 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:58,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-04-08 10:05:58,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:05:58,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:58,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:05:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:58,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:58,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {57098#true} call ULTIMATE.init(); {57098#true} is VALID [2022-04-08 10:05:58,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {57098#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {57098#true} is VALID [2022-04-08 10:05:58,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {57098#true} assume true; {57098#true} is VALID [2022-04-08 10:05:58,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57098#true} {57098#true} #61#return; {57098#true} is VALID [2022-04-08 10:05:58,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {57098#true} call #t~ret11 := main(); {57098#true} is VALID [2022-04-08 10:05:58,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {57098#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57103#(= main_~y~0 0)} is VALID [2022-04-08 10:05:58,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {57103#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57104#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:58,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {57104#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57105#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:58,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {57105#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57106#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:58,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {57106#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57107#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:58,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {57107#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57108#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:58,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {57108#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57109#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:58,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {57109#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57110#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:58,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {57110#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57111#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:58,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {57111#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57112#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:58,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {57112#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57113#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:58,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {57113#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {57113#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:58,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {57113#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {57114#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:05:58,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {57114#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57115#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:58,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {57115#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57116#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:58,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {57116#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57117#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:58,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {57117#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57186#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:58,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {57186#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {57099#false} is VALID [2022-04-08 10:05:58,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,461 INFO L290 TraceCheckUtils]: 25: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,461 INFO L290 TraceCheckUtils]: 26: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,461 INFO L290 TraceCheckUtils]: 27: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,461 INFO L290 TraceCheckUtils]: 28: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,461 INFO L290 TraceCheckUtils]: 29: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {57099#false} assume !(~y~0 % 4294967296 > 0); {57099#false} is VALID [2022-04-08 10:05:58,461 INFO L272 TraceCheckUtils]: 34: Hoare triple {57099#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {57099#false} is VALID [2022-04-08 10:05:58,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {57099#false} ~cond := #in~cond; {57099#false} is VALID [2022-04-08 10:05:58,461 INFO L290 TraceCheckUtils]: 36: Hoare triple {57099#false} assume 0 == ~cond; {57099#false} is VALID [2022-04-08 10:05:58,461 INFO L290 TraceCheckUtils]: 37: Hoare triple {57099#false} assume !false; {57099#false} is VALID [2022-04-08 10:05:58,461 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:05:58,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:58,906 INFO L290 TraceCheckUtils]: 37: Hoare triple {57099#false} assume !false; {57099#false} is VALID [2022-04-08 10:05:58,907 INFO L290 TraceCheckUtils]: 36: Hoare triple {57099#false} assume 0 == ~cond; {57099#false} is VALID [2022-04-08 10:05:58,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {57099#false} ~cond := #in~cond; {57099#false} is VALID [2022-04-08 10:05:58,907 INFO L272 TraceCheckUtils]: 34: Hoare triple {57099#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {57099#false} is VALID [2022-04-08 10:05:58,907 INFO L290 TraceCheckUtils]: 33: Hoare triple {57099#false} assume !(~y~0 % 4294967296 > 0); {57099#false} is VALID [2022-04-08 10:05:58,907 INFO L290 TraceCheckUtils]: 32: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,907 INFO L290 TraceCheckUtils]: 31: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,907 INFO L290 TraceCheckUtils]: 29: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,907 INFO L290 TraceCheckUtils]: 25: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-08 10:05:58,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {57280#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {57099#false} is VALID [2022-04-08 10:05:58,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {57284#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57280#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:58,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {57288#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57284#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:58,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {57292#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57288#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:58,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {57296#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57292#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:58,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {57300#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {57296#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:05:58,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {57300#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {57300#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:58,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {57307#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57300#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:58,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {57311#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57307#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:58,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {57315#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57311#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:58,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {57319#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57315#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:58,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {57323#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57319#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:58,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {57327#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57323#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:58,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {57331#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57327#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:58,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {57335#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57331#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:58,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {57339#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57335#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:58,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {57343#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57339#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:58,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {57098#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57343#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:05:58,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {57098#true} call #t~ret11 := main(); {57098#true} is VALID [2022-04-08 10:05:58,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57098#true} {57098#true} #61#return; {57098#true} is VALID [2022-04-08 10:05:58,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {57098#true} assume true; {57098#true} is VALID [2022-04-08 10:05:58,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {57098#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {57098#true} is VALID [2022-04-08 10:05:58,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {57098#true} call ULTIMATE.init(); {57098#true} is VALID [2022-04-08 10:05:58,918 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:05:58,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743114954] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:58,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:58,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 10:05:58,919 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:58,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1937440579] [2022-04-08 10:05:58,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1937440579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:58,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:58,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:05:58,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578673078] [2022-04-08 10:05:58,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:58,919 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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 38 [2022-04-08 10:05:58,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:58,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:05:58,939 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-08 10:05:58,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:05:58,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:58,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:05:58,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1040, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:05:58,940 INFO L87 Difference]: Start difference. First operand 148 states and 191 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:06:00,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:00,705 INFO L93 Difference]: Finished difference Result 177 states and 220 transitions. [2022-04-08 10:06:00,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 10:06:00,706 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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 38 [2022-04-08 10:06:00,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:00,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:06:00,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 71 transitions. [2022-04-08 10:06:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:06:00,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 71 transitions. [2022-04-08 10:06:00,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 71 transitions. [2022-04-08 10:06:00,765 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-08 10:06:00,767 INFO L225 Difference]: With dead ends: 177 [2022-04-08 10:06:00,767 INFO L226 Difference]: Without dead ends: 161 [2022-04-08 10:06:00,767 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=662, Invalid=2760, Unknown=0, NotChecked=0, Total=3422 [2022-04-08 10:06:00,768 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:00,768 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 82 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:06:00,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-08 10:06:01,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 149. [2022-04-08 10:06:01,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:01,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 149 states, 144 states have (on average 1.3055555555555556) internal successors, (188), 144 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:01,228 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 149 states, 144 states have (on average 1.3055555555555556) internal successors, (188), 144 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:01,229 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 149 states, 144 states have (on average 1.3055555555555556) internal successors, (188), 144 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:01,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:01,230 INFO L93 Difference]: Finished difference Result 161 states and 204 transitions. [2022-04-08 10:06:01,230 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 204 transitions. [2022-04-08 10:06:01,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:01,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:01,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 144 states have (on average 1.3055555555555556) internal successors, (188), 144 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-08 10:06:01,231 INFO L87 Difference]: Start difference. First operand has 149 states, 144 states have (on average 1.3055555555555556) internal successors, (188), 144 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-08 10:06:01,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:01,232 INFO L93 Difference]: Finished difference Result 161 states and 204 transitions. [2022-04-08 10:06:01,232 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 204 transitions. [2022-04-08 10:06:01,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:01,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:01,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:01,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:01,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 144 states have (on average 1.3055555555555556) internal successors, (188), 144 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:01,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 192 transitions. [2022-04-08 10:06:01,234 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 192 transitions. Word has length 38 [2022-04-08 10:06:01,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:01,234 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 192 transitions. [2022-04-08 10:06:01,234 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:06:01,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 149 states and 192 transitions. [2022-04-08 10:06:01,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:01,612 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 192 transitions. [2022-04-08 10:06:01,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:06:01,612 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:01,612 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:01,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-04-08 10:06:01,815 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-04-08 10:06:01,815 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:01,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:01,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1787736705, now seen corresponding path program 129 times [2022-04-08 10:06:01,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:01,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2128658511] [2022-04-08 10:06:01,818 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:01,818 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:01,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1787736705, now seen corresponding path program 130 times [2022-04-08 10:06:01,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:01,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228628291] [2022-04-08 10:06:01,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:01,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:02,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:02,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {58404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58384#true} is VALID [2022-04-08 10:06:02,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {58384#true} assume true; {58384#true} is VALID [2022-04-08 10:06:02,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58384#true} {58384#true} #61#return; {58384#true} is VALID [2022-04-08 10:06:02,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {58384#true} call ULTIMATE.init(); {58404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:02,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {58404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58384#true} is VALID [2022-04-08 10:06:02,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {58384#true} assume true; {58384#true} is VALID [2022-04-08 10:06:02,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58384#true} {58384#true} #61#return; {58384#true} is VALID [2022-04-08 10:06:02,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {58384#true} call #t~ret11 := main(); {58384#true} is VALID [2022-04-08 10:06:02,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {58384#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58389#(= main_~y~0 0)} is VALID [2022-04-08 10:06:02,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {58389#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58390#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:02,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {58390#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58391#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:02,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {58391#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58392#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:02,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {58392#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58393#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:02,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {58393#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58394#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:02,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {58394#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58395#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:02,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {58395#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58396#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:02,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {58396#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58397#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:02,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {58397#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58398#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:02,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {58398#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58399#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:02,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {58399#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58400#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:02,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {58400#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {58400#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:02,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {58400#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {58401#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:06:02,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {58401#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58402#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:06:02,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {58402#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58403#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:02,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {58403#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {58385#false} is VALID [2022-04-08 10:06:02,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,064 INFO L290 TraceCheckUtils]: 27: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,064 INFO L290 TraceCheckUtils]: 28: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,064 INFO L290 TraceCheckUtils]: 29: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,064 INFO L290 TraceCheckUtils]: 30: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,064 INFO L290 TraceCheckUtils]: 32: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {58385#false} assume !(~y~0 % 4294967296 > 0); {58385#false} is VALID [2022-04-08 10:06:02,064 INFO L272 TraceCheckUtils]: 34: Hoare triple {58385#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {58385#false} is VALID [2022-04-08 10:06:02,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {58385#false} ~cond := #in~cond; {58385#false} is VALID [2022-04-08 10:06:02,064 INFO L290 TraceCheckUtils]: 36: Hoare triple {58385#false} assume 0 == ~cond; {58385#false} is VALID [2022-04-08 10:06:02,065 INFO L290 TraceCheckUtils]: 37: Hoare triple {58385#false} assume !false; {58385#false} is VALID [2022-04-08 10:06:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:06:02,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:02,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228628291] [2022-04-08 10:06:02,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228628291] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:02,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487067687] [2022-04-08 10:06:02,065 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:06:02,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:02,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:02,068 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:06:02,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-04-08 10:06:02,124 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:06:02,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:02,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:06:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:02,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:02,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {58384#true} call ULTIMATE.init(); {58384#true} is VALID [2022-04-08 10:06:02,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {58384#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58384#true} is VALID [2022-04-08 10:06:02,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {58384#true} assume true; {58384#true} is VALID [2022-04-08 10:06:02,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58384#true} {58384#true} #61#return; {58384#true} is VALID [2022-04-08 10:06:02,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {58384#true} call #t~ret11 := main(); {58384#true} is VALID [2022-04-08 10:06:02,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {58384#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58389#(= main_~y~0 0)} is VALID [2022-04-08 10:06:02,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {58389#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58390#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:02,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {58390#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58391#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:02,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {58391#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58392#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:02,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {58392#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58393#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:02,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {58393#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58394#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:02,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {58394#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58395#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:02,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {58395#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58396#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:02,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {58396#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58397#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:02,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {58397#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58398#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:02,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {58398#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58399#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:02,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {58399#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58400#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:02,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {58400#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {58400#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:02,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {58400#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {58401#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:06:02,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {58401#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58402#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:06:02,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {58402#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58468#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:06:02,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {58468#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {58385#false} is VALID [2022-04-08 10:06:02,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,411 INFO L290 TraceCheckUtils]: 27: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,411 INFO L290 TraceCheckUtils]: 28: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,411 INFO L290 TraceCheckUtils]: 29: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,411 INFO L290 TraceCheckUtils]: 30: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,411 INFO L290 TraceCheckUtils]: 31: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,411 INFO L290 TraceCheckUtils]: 32: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {58385#false} assume !(~y~0 % 4294967296 > 0); {58385#false} is VALID [2022-04-08 10:06:02,411 INFO L272 TraceCheckUtils]: 34: Hoare triple {58385#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {58385#false} is VALID [2022-04-08 10:06:02,411 INFO L290 TraceCheckUtils]: 35: Hoare triple {58385#false} ~cond := #in~cond; {58385#false} is VALID [2022-04-08 10:06:02,411 INFO L290 TraceCheckUtils]: 36: Hoare triple {58385#false} assume 0 == ~cond; {58385#false} is VALID [2022-04-08 10:06:02,411 INFO L290 TraceCheckUtils]: 37: Hoare triple {58385#false} assume !false; {58385#false} is VALID [2022-04-08 10:06:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:06:02,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:02,827 INFO L290 TraceCheckUtils]: 37: Hoare triple {58385#false} assume !false; {58385#false} is VALID [2022-04-08 10:06:02,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {58385#false} assume 0 == ~cond; {58385#false} is VALID [2022-04-08 10:06:02,827 INFO L290 TraceCheckUtils]: 35: Hoare triple {58385#false} ~cond := #in~cond; {58385#false} is VALID [2022-04-08 10:06:02,827 INFO L272 TraceCheckUtils]: 34: Hoare triple {58385#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {58385#false} is VALID [2022-04-08 10:06:02,827 INFO L290 TraceCheckUtils]: 33: Hoare triple {58385#false} assume !(~y~0 % 4294967296 > 0); {58385#false} is VALID [2022-04-08 10:06:02,827 INFO L290 TraceCheckUtils]: 32: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,827 INFO L290 TraceCheckUtils]: 31: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,827 INFO L290 TraceCheckUtils]: 26: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,827 INFO L290 TraceCheckUtils]: 25: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,828 INFO L290 TraceCheckUtils]: 22: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-08 10:06:02,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {58568#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {58385#false} is VALID [2022-04-08 10:06:02,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {58572#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58568#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:02,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {58576#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58572#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:02,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {58580#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {58576#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:02,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {58580#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {58580#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:02,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {58587#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58580#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:02,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {58591#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58587#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:02,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {58595#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58591#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:02,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {58599#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58595#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:02,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {58603#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58599#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:02,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {58607#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58603#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:02,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {58611#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58607#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:02,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {58615#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58611#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:02,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {58619#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58615#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:06:02,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {58623#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58619#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:02,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {58627#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58623#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:06:02,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {58384#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58627#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:06:02,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {58384#true} call #t~ret11 := main(); {58384#true} is VALID [2022-04-08 10:06:02,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58384#true} {58384#true} #61#return; {58384#true} is VALID [2022-04-08 10:06:02,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {58384#true} assume true; {58384#true} is VALID [2022-04-08 10:06:02,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {58384#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58384#true} is VALID [2022-04-08 10:06:02,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {58384#true} call ULTIMATE.init(); {58384#true} is VALID [2022-04-08 10:06:02,838 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:06:02,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487067687] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:02,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:02,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-08 10:06:02,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:02,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2128658511] [2022-04-08 10:06:02,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2128658511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:02,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:02,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:06:02,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130339492] [2022-04-08 10:06:02,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:02,839 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 10:06:02,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:02,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:02,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:02,856 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:06:02,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:02,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:06:02,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:06:02,856 INFO L87 Difference]: Start difference. First operand 149 states and 192 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:04,638 INFO L93 Difference]: Finished difference Result 180 states and 223 transitions. [2022-04-08 10:06:04,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:06:04,638 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 10:06:04,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 71 transitions. [2022-04-08 10:06:04,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 71 transitions. [2022-04-08 10:06:04,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 71 transitions. [2022-04-08 10:06:04,695 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-08 10:06:04,697 INFO L225 Difference]: With dead ends: 180 [2022-04-08 10:06:04,697 INFO L226 Difference]: Without dead ends: 163 [2022-04-08 10:06:04,697 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=542, Invalid=2110, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:06:04,698 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:04,698 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 98 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:06:04,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-08 10:06:05,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2022-04-08 10:06:05,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:05,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.303448275862069) internal successors, (189), 145 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:05,155 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.303448275862069) internal successors, (189), 145 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:05,155 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.303448275862069) internal successors, (189), 145 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:05,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:05,156 INFO L93 Difference]: Finished difference Result 163 states and 206 transitions. [2022-04-08 10:06:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 206 transitions. [2022-04-08 10:06:05,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:05,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:05,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.303448275862069) internal successors, (189), 145 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 163 states. [2022-04-08 10:06:05,157 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.303448275862069) internal successors, (189), 145 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 163 states. [2022-04-08 10:06:05,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:05,158 INFO L93 Difference]: Finished difference Result 163 states and 206 transitions. [2022-04-08 10:06:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 206 transitions. [2022-04-08 10:06:05,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:05,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:05,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:05,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:05,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.303448275862069) internal successors, (189), 145 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:05,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 193 transitions. [2022-04-08 10:06:05,160 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 193 transitions. Word has length 38 [2022-04-08 10:06:05,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:05,161 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 193 transitions. [2022-04-08 10:06:05,161 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:05,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 193 transitions. [2022-04-08 10:06:05,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 193 transitions. [2022-04-08 10:06:05,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:06:05,542 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:05,542 INFO L499 BasicCegarLoop]: trace histogram [21, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:05,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-04-08 10:06:05,742 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-04-08 10:06:05,742 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:05,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:05,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2104430926, now seen corresponding path program 131 times [2022-04-08 10:06:05,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:05,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1063770571] [2022-04-08 10:06:05,745 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:05,745 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:05,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2104430926, now seen corresponding path program 132 times [2022-04-08 10:06:05,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:05,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507046870] [2022-04-08 10:06:05,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:05,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:06,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:06,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {59699#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {59670#true} is VALID [2022-04-08 10:06:06,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {59670#true} assume true; {59670#true} is VALID [2022-04-08 10:06:06,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59670#true} {59670#true} #61#return; {59670#true} is VALID [2022-04-08 10:06:06,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {59670#true} call ULTIMATE.init(); {59699#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:06,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {59699#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {59670#true} is VALID [2022-04-08 10:06:06,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {59670#true} assume true; {59670#true} is VALID [2022-04-08 10:06:06,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59670#true} {59670#true} #61#return; {59670#true} is VALID [2022-04-08 10:06:06,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {59670#true} call #t~ret11 := main(); {59670#true} is VALID [2022-04-08 10:06:06,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {59670#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59675#(= main_~y~0 0)} is VALID [2022-04-08 10:06:06,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {59675#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59676#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:06,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {59676#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59677#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:06,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {59677#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59678#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:06,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {59678#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59679#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:06,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {59679#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59680#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:06,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {59680#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59681#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:06,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {59681#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59682#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:06,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {59682#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59683#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:06,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {59683#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59684#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:06,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {59684#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59685#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:06,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {59685#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59686#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:06,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {59686#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59687#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:06,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {59687#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59688#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:06:06,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {59688#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59689#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:06:06,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {59689#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59690#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:06:06,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {59690#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59691#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:06:06,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {59691#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59692#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:06:06,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {59692#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59693#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:06:06,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {59693#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59694#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:06:06,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {59694#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59695#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:06:06,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {59695#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59696#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:06:06,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {59696#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {59696#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:06:06,169 INFO L290 TraceCheckUtils]: 28: Hoare triple {59696#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {59697#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-08 10:06:06,169 INFO L290 TraceCheckUtils]: 29: Hoare triple {59697#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59698#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} is VALID [2022-04-08 10:06:06,170 INFO L290 TraceCheckUtils]: 30: Hoare triple {59698#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {59671#false} is VALID [2022-04-08 10:06:06,170 INFO L290 TraceCheckUtils]: 31: Hoare triple {59671#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {59671#false} is VALID [2022-04-08 10:06:06,170 INFO L290 TraceCheckUtils]: 32: Hoare triple {59671#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {59671#false} is VALID [2022-04-08 10:06:06,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {59671#false} assume !(~y~0 % 4294967296 > 0); {59671#false} is VALID [2022-04-08 10:06:06,170 INFO L272 TraceCheckUtils]: 34: Hoare triple {59671#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {59671#false} is VALID [2022-04-08 10:06:06,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {59671#false} ~cond := #in~cond; {59671#false} is VALID [2022-04-08 10:06:06,170 INFO L290 TraceCheckUtils]: 36: Hoare triple {59671#false} assume 0 == ~cond; {59671#false} is VALID [2022-04-08 10:06:06,171 INFO L290 TraceCheckUtils]: 37: Hoare triple {59671#false} assume !false; {59671#false} is VALID [2022-04-08 10:06:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:06:06,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:06,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507046870] [2022-04-08 10:06:06,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507046870] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:06,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353597003] [2022-04-08 10:06:06,171 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:06:06,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:06,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:06,176 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:06:06,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-04-08 10:06:06,229 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:06:06,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:06,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 10:06:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:06,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:06,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {59670#true} call ULTIMATE.init(); {59670#true} is VALID [2022-04-08 10:06:06,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {59670#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {59670#true} is VALID [2022-04-08 10:06:06,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {59670#true} assume true; {59670#true} is VALID [2022-04-08 10:06:06,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59670#true} {59670#true} #61#return; {59670#true} is VALID [2022-04-08 10:06:06,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {59670#true} call #t~ret11 := main(); {59670#true} is VALID [2022-04-08 10:06:06,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {59670#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59670#true} is VALID [2022-04-08 10:06:06,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {59670#true} assume !(~x~0 % 4294967296 > 0); {59670#true} is VALID [2022-04-08 10:06:06,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {59670#true} ~z~0 := ~y~0; {59787#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:06:06,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {59787#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59791#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:06:06,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {59791#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {59795#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:06:06,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {59795#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {59799#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:06:06,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {59799#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {59671#false} is VALID [2022-04-08 10:06:06,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {59671#false} assume !(~y~0 % 4294967296 > 0); {59671#false} is VALID [2022-04-08 10:06:06,396 INFO L272 TraceCheckUtils]: 34: Hoare triple {59671#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {59671#false} is VALID [2022-04-08 10:06:06,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {59671#false} ~cond := #in~cond; {59671#false} is VALID [2022-04-08 10:06:06,396 INFO L290 TraceCheckUtils]: 36: Hoare triple {59671#false} assume 0 == ~cond; {59671#false} is VALID [2022-04-08 10:06:06,396 INFO L290 TraceCheckUtils]: 37: Hoare triple {59671#false} assume !false; {59671#false} is VALID [2022-04-08 10:06:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-04-08 10:06:06,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:06,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {59671#false} assume !false; {59671#false} is VALID [2022-04-08 10:06:06,533 INFO L290 TraceCheckUtils]: 36: Hoare triple {59671#false} assume 0 == ~cond; {59671#false} is VALID [2022-04-08 10:06:06,533 INFO L290 TraceCheckUtils]: 35: Hoare triple {59671#false} ~cond := #in~cond; {59671#false} is VALID [2022-04-08 10:06:06,533 INFO L272 TraceCheckUtils]: 34: Hoare triple {59671#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {59671#false} is VALID [2022-04-08 10:06:06,533 INFO L290 TraceCheckUtils]: 33: Hoare triple {59671#false} assume !(~y~0 % 4294967296 > 0); {59671#false} is VALID [2022-04-08 10:06:06,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {59799#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {59671#false} is VALID [2022-04-08 10:06:06,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {59795#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {59799#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:06:06,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {59839#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {59795#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:06:06,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {59843#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59839#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:06:06,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {59670#true} ~z~0 := ~y~0; {59843#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:06:06,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {59670#true} assume !(~x~0 % 4294967296 > 0); {59670#true} is VALID [2022-04-08 10:06:06,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {59670#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59670#true} is VALID [2022-04-08 10:06:06,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {59670#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59670#true} is VALID [2022-04-08 10:06:06,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {59670#true} call #t~ret11 := main(); {59670#true} is VALID [2022-04-08 10:06:06,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59670#true} {59670#true} #61#return; {59670#true} is VALID [2022-04-08 10:06:06,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {59670#true} assume true; {59670#true} is VALID [2022-04-08 10:06:06,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {59670#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {59670#true} is VALID [2022-04-08 10:06:06,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {59670#true} call ULTIMATE.init(); {59670#true} is VALID [2022-04-08 10:06:06,544 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-04-08 10:06:06,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353597003] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:06,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:06,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 6, 6] total 33 [2022-04-08 10:06:06,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:06,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1063770571] [2022-04-08 10:06:06,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1063770571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:06,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:06,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-08 10:06:06,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788670800] [2022-04-08 10:06:06,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:06,545 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 10:06:06,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:06,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:06,567 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-08 10:06:06,567 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-08 10:06:06,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:06,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-08 10:06:06,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 10:06:06,568 INFO L87 Difference]: Start difference. First operand 150 states and 193 transitions. Second operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:10,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:10,793 INFO L93 Difference]: Finished difference Result 235 states and 337 transitions. [2022-04-08 10:06:10,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 10:06:10,794 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 10:06:10,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:10,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 149 transitions. [2022-04-08 10:06:10,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 149 transitions. [2022-04-08 10:06:10,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 149 transitions. [2022-04-08 10:06:10,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:10,915 INFO L225 Difference]: With dead ends: 235 [2022-04-08 10:06:10,915 INFO L226 Difference]: Without dead ends: 227 [2022-04-08 10:06:10,915 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=195, Invalid=3111, Unknown=0, NotChecked=0, Total=3306 [2022-04-08 10:06:10,915 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 123 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 2472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:10,915 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 167 Invalid, 2472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-08 10:06:10,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-04-08 10:06:11,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 156. [2022-04-08 10:06:11,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:11,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:11,386 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:11,386 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:11,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:11,389 INFO L93 Difference]: Finished difference Result 227 states and 279 transitions. [2022-04-08 10:06:11,389 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 279 transitions. [2022-04-08 10:06:11,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:11,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:11,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 227 states. [2022-04-08 10:06:11,389 INFO L87 Difference]: Start difference. First operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 227 states. [2022-04-08 10:06:11,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:11,391 INFO L93 Difference]: Finished difference Result 227 states and 279 transitions. [2022-04-08 10:06:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 279 transitions. [2022-04-08 10:06:11,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:11,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:11,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:11,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 201 transitions. [2022-04-08 10:06:11,393 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 201 transitions. Word has length 38 [2022-04-08 10:06:11,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:11,394 INFO L478 AbstractCegarLoop]: Abstraction has 156 states and 201 transitions. [2022-04-08 10:06:11,394 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:11,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 156 states and 201 transitions. [2022-04-08 10:06:11,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:11,774 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 201 transitions. [2022-04-08 10:06:11,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:06:11,774 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:11,774 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:11,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2022-04-08 10:06:11,974 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable70 [2022-04-08 10:06:11,974 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:11,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:11,975 INFO L85 PathProgramCache]: Analyzing trace with hash 638163759, now seen corresponding path program 133 times [2022-04-08 10:06:11,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:11,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [433251215] [2022-04-08 10:06:11,977 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:11,977 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:11,977 INFO L85 PathProgramCache]: Analyzing trace with hash 638163759, now seen corresponding path program 134 times [2022-04-08 10:06:11,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:11,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635939610] [2022-04-08 10:06:11,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:11,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:12,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:12,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {61242#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61219#true} is VALID [2022-04-08 10:06:12,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {61219#true} assume true; {61219#true} is VALID [2022-04-08 10:06:12,279 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61219#true} {61219#true} #61#return; {61219#true} is VALID [2022-04-08 10:06:12,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {61219#true} call ULTIMATE.init(); {61242#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:12,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {61242#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61219#true} is VALID [2022-04-08 10:06:12,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {61219#true} assume true; {61219#true} is VALID [2022-04-08 10:06:12,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61219#true} {61219#true} #61#return; {61219#true} is VALID [2022-04-08 10:06:12,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {61219#true} call #t~ret11 := main(); {61219#true} is VALID [2022-04-08 10:06:12,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {61219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61224#(= main_~y~0 0)} is VALID [2022-04-08 10:06:12,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {61224#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:12,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {61225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:12,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {61226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61227#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:12,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {61227#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61228#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:12,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {61228#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61229#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:12,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {61229#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61230#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:12,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {61230#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61231#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:12,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {61231#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:12,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {61232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {61232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:12,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {61232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {61233#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:06:12,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {61233#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61234#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:06:12,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {61234#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61235#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:06:12,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {61235#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61236#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:06:12,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {61236#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61237#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:06:12,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {61237#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61238#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:06:12,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {61238#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61239#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:12,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {61239#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61240#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:12,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {61240#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61241#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:06:12,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {61241#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61220#false} is VALID [2022-04-08 10:06:12,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {61220#false} assume !(~z~0 % 4294967296 > 0); {61220#false} is VALID [2022-04-08 10:06:12,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-08 10:06:12,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-08 10:06:12,290 INFO L290 TraceCheckUtils]: 28: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-08 10:06:12,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-08 10:06:12,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-08 10:06:12,290 INFO L290 TraceCheckUtils]: 31: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-08 10:06:12,290 INFO L290 TraceCheckUtils]: 32: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-08 10:06:12,290 INFO L290 TraceCheckUtils]: 33: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-08 10:06:12,290 INFO L290 TraceCheckUtils]: 34: Hoare triple {61220#false} assume !(~y~0 % 4294967296 > 0); {61220#false} is VALID [2022-04-08 10:06:12,290 INFO L272 TraceCheckUtils]: 35: Hoare triple {61220#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {61220#false} is VALID [2022-04-08 10:06:12,290 INFO L290 TraceCheckUtils]: 36: Hoare triple {61220#false} ~cond := #in~cond; {61220#false} is VALID [2022-04-08 10:06:12,290 INFO L290 TraceCheckUtils]: 37: Hoare triple {61220#false} assume 0 == ~cond; {61220#false} is VALID [2022-04-08 10:06:12,290 INFO L290 TraceCheckUtils]: 38: Hoare triple {61220#false} assume !false; {61220#false} is VALID [2022-04-08 10:06:12,296 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:06:12,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:12,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635939610] [2022-04-08 10:06:12,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635939610] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:12,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120716048] [2022-04-08 10:06:12,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:12,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:12,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:12,297 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:06:12,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-04-08 10:06:12,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:12,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:12,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-08 10:06:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:12,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:12,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {61219#true} call ULTIMATE.init(); {61219#true} is VALID [2022-04-08 10:06:12,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {61219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61219#true} is VALID [2022-04-08 10:06:12,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {61219#true} assume true; {61219#true} is VALID [2022-04-08 10:06:12,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61219#true} {61219#true} #61#return; {61219#true} is VALID [2022-04-08 10:06:12,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {61219#true} call #t~ret11 := main(); {61219#true} is VALID [2022-04-08 10:06:12,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {61219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61224#(= main_~y~0 0)} is VALID [2022-04-08 10:06:12,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {61224#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:12,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {61225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:12,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {61226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61227#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:12,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {61227#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61228#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:12,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {61228#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61229#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:12,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {61229#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61230#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:12,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {61230#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61231#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:12,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {61231#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:12,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {61232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {61232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:12,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {61232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {61291#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:12,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {61291#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61295#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:06:12,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {61295#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61299#(and (<= main_~y~0 8) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:12,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {61299#(and (<= main_~y~0 8) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61303#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:12,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {61303#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61307#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-08 10:06:12,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {61307#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61311#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:12,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {61311#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61315#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:12,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {61315#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61319#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 4)) (+ main_~z~0 3)) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:12,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {61319#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 4)) (+ main_~z~0 3)) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61323#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 4)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:12,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {61323#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 4)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61220#false} is VALID [2022-04-08 10:06:12,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {61220#false} assume !(~z~0 % 4294967296 > 0); {61220#false} is VALID [2022-04-08 10:06:12,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-08 10:06:12,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-08 10:06:12,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-08 10:06:12,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-08 10:06:12,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-08 10:06:12,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-08 10:06:12,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-08 10:06:12,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-08 10:06:12,847 INFO L290 TraceCheckUtils]: 34: Hoare triple {61220#false} assume !(~y~0 % 4294967296 > 0); {61220#false} is VALID [2022-04-08 10:06:12,847 INFO L272 TraceCheckUtils]: 35: Hoare triple {61220#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {61220#false} is VALID [2022-04-08 10:06:12,847 INFO L290 TraceCheckUtils]: 36: Hoare triple {61220#false} ~cond := #in~cond; {61220#false} is VALID [2022-04-08 10:06:12,847 INFO L290 TraceCheckUtils]: 37: Hoare triple {61220#false} assume 0 == ~cond; {61220#false} is VALID [2022-04-08 10:06:12,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {61220#false} assume !false; {61220#false} is VALID [2022-04-08 10:06:12,847 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:06:12,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:13,484 INFO L290 TraceCheckUtils]: 38: Hoare triple {61220#false} assume !false; {61220#false} is VALID [2022-04-08 10:06:13,484 INFO L290 TraceCheckUtils]: 37: Hoare triple {61220#false} assume 0 == ~cond; {61220#false} is VALID [2022-04-08 10:06:13,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {61220#false} ~cond := #in~cond; {61220#false} is VALID [2022-04-08 10:06:13,485 INFO L272 TraceCheckUtils]: 35: Hoare triple {61220#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {61220#false} is VALID [2022-04-08 10:06:13,485 INFO L290 TraceCheckUtils]: 34: Hoare triple {61381#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {61220#false} is VALID [2022-04-08 10:06:13,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {61385#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61381#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:13,486 INFO L290 TraceCheckUtils]: 32: Hoare triple {61389#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61385#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:13,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {61393#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61389#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:13,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {61397#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61393#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:13,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {61401#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61397#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:13,490 INFO L290 TraceCheckUtils]: 28: Hoare triple {61405#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61401#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:13,490 INFO L290 TraceCheckUtils]: 27: Hoare triple {61409#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61405#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:13,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {61413#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61409#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:06:13,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {61413#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {61413#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:13,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {61420#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61413#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:13,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {61424#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61420#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:06:13,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {61428#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61424#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:06:13,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {61432#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61428#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:06:13,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {61436#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61432#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:06:13,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {61440#(or (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61436#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:06:13,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {61444#(or (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61440#(or (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:06:13,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {61448#(or (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61444#(or (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:06:13,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {61452#(or (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61448#(or (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:06:13,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {61219#true} ~z~0 := ~y~0; {61452#(or (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:06:13,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {61219#true} assume !(~x~0 % 4294967296 > 0); {61219#true} is VALID [2022-04-08 10:06:13,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {61219#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61219#true} is VALID [2022-04-08 10:06:13,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {61219#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61219#true} is VALID [2022-04-08 10:06:13,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {61219#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61219#true} is VALID [2022-04-08 10:06:13,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {61219#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61219#true} is VALID [2022-04-08 10:06:13,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {61219#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61219#true} is VALID [2022-04-08 10:06:13,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {61219#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61219#true} is VALID [2022-04-08 10:06:13,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {61219#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61219#true} is VALID [2022-04-08 10:06:13,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {61219#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61219#true} is VALID [2022-04-08 10:06:13,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {61219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61219#true} is VALID [2022-04-08 10:06:13,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {61219#true} call #t~ret11 := main(); {61219#true} is VALID [2022-04-08 10:06:13,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61219#true} {61219#true} #61#return; {61219#true} is VALID [2022-04-08 10:06:13,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {61219#true} assume true; {61219#true} is VALID [2022-04-08 10:06:13,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {61219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61219#true} is VALID [2022-04-08 10:06:13,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {61219#true} call ULTIMATE.init(); {61219#true} is VALID [2022-04-08 10:06:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:06:13,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120716048] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:13,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:13,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 48 [2022-04-08 10:06:13,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:13,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [433251215] [2022-04-08 10:06:13,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [433251215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:13,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:13,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:06:13,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694296054] [2022-04-08 10:06:13,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:13,501 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-08 10:06:13,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:13,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:13,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:13,521 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:06:13,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:13,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:06:13,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1902, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:06:13,522 INFO L87 Difference]: Start difference. First operand 156 states and 201 transitions. Second operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:14,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:14,981 INFO L93 Difference]: Finished difference Result 170 states and 214 transitions. [2022-04-08 10:06:14,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:06:14,981 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-08 10:06:14,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 45 transitions. [2022-04-08 10:06:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 45 transitions. [2022-04-08 10:06:14,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 45 transitions. [2022-04-08 10:06:15,014 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-08 10:06:15,016 INFO L225 Difference]: With dead ends: 170 [2022-04-08 10:06:15,016 INFO L226 Difference]: Without dead ends: 145 [2022-04-08 10:06:15,016 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=678, Invalid=3612, Unknown=0, NotChecked=0, Total=4290 [2022-04-08 10:06:15,017 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:15,017 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 106 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:06:15,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-04-08 10:06:15,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-04-08 10:06:15,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:15,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 145 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 140 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:15,440 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 145 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 140 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:15,441 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 145 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 140 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:15,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:15,442 INFO L93 Difference]: Finished difference Result 145 states and 188 transitions. [2022-04-08 10:06:15,442 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 188 transitions. [2022-04-08 10:06:15,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:15,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:15,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 140 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 145 states. [2022-04-08 10:06:15,442 INFO L87 Difference]: Start difference. First operand has 145 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 140 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 145 states. [2022-04-08 10:06:15,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:15,444 INFO L93 Difference]: Finished difference Result 145 states and 188 transitions. [2022-04-08 10:06:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 188 transitions. [2022-04-08 10:06:15,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:15,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:15,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:15,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:15,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 140 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 188 transitions. [2022-04-08 10:06:15,445 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 188 transitions. Word has length 39 [2022-04-08 10:06:15,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:15,445 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 188 transitions. [2022-04-08 10:06:15,446 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:15,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 145 states and 188 transitions. [2022-04-08 10:06:15,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:15,798 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 188 transitions. [2022-04-08 10:06:15,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:06:15,798 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:15,798 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:15,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2022-04-08 10:06:15,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:15,999 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:15,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:15,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1865343295, now seen corresponding path program 135 times [2022-04-08 10:06:15,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:15,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [322280527] [2022-04-08 10:06:16,001 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:16,001 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:16,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1865343295, now seen corresponding path program 136 times [2022-04-08 10:06:16,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:16,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240867932] [2022-04-08 10:06:16,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:16,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:16,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:16,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {62482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {62459#true} is VALID [2022-04-08 10:06:16,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {62459#true} assume true; {62459#true} is VALID [2022-04-08 10:06:16,341 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62459#true} {62459#true} #61#return; {62459#true} is VALID [2022-04-08 10:06:16,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {62459#true} call ULTIMATE.init(); {62482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:16,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {62482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {62459#true} is VALID [2022-04-08 10:06:16,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {62459#true} assume true; {62459#true} is VALID [2022-04-08 10:06:16,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62459#true} {62459#true} #61#return; {62459#true} is VALID [2022-04-08 10:06:16,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {62459#true} call #t~ret11 := main(); {62459#true} is VALID [2022-04-08 10:06:16,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {62459#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62464#(= main_~y~0 0)} is VALID [2022-04-08 10:06:16,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {62464#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62465#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:16,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {62465#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62466#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:16,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {62466#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62467#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:16,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {62467#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62468#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:16,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {62468#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62469#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:16,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {62469#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62470#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:16,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {62470#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62471#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:16,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {62471#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62472#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:16,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {62472#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62473#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:16,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {62473#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {62473#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:16,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {62473#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {62474#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:06:16,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {62474#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62475#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:06:16,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {62475#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62476#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:06:16,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {62476#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62477#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:06:16,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {62477#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62478#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:06:16,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {62478#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62479#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:06:16,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {62479#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62480#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:06:16,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {62480#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62481#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:16,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {62481#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {62460#false} is VALID [2022-04-08 10:06:16,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-08 10:06:16,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-08 10:06:16,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-08 10:06:16,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-08 10:06:16,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-08 10:06:16,354 INFO L290 TraceCheckUtils]: 30: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-08 10:06:16,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-08 10:06:16,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-08 10:06:16,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-08 10:06:16,355 INFO L290 TraceCheckUtils]: 34: Hoare triple {62460#false} assume !(~y~0 % 4294967296 > 0); {62460#false} is VALID [2022-04-08 10:06:16,355 INFO L272 TraceCheckUtils]: 35: Hoare triple {62460#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {62460#false} is VALID [2022-04-08 10:06:16,355 INFO L290 TraceCheckUtils]: 36: Hoare triple {62460#false} ~cond := #in~cond; {62460#false} is VALID [2022-04-08 10:06:16,355 INFO L290 TraceCheckUtils]: 37: Hoare triple {62460#false} assume 0 == ~cond; {62460#false} is VALID [2022-04-08 10:06:16,355 INFO L290 TraceCheckUtils]: 38: Hoare triple {62460#false} assume !false; {62460#false} is VALID [2022-04-08 10:06:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:06:16,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:16,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240867932] [2022-04-08 10:06:16,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240867932] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:16,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47920148] [2022-04-08 10:06:16,355 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:06:16,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:16,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:16,357 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:06:16,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-04-08 10:06:16,414 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:06:16,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:16,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-08 10:06:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:16,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:16,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {62459#true} call ULTIMATE.init(); {62459#true} is VALID [2022-04-08 10:06:16,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {62459#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {62459#true} is VALID [2022-04-08 10:06:16,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {62459#true} assume true; {62459#true} is VALID [2022-04-08 10:06:16,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62459#true} {62459#true} #61#return; {62459#true} is VALID [2022-04-08 10:06:16,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {62459#true} call #t~ret11 := main(); {62459#true} is VALID [2022-04-08 10:06:16,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {62459#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62464#(= main_~y~0 0)} is VALID [2022-04-08 10:06:16,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {62464#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62465#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:16,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {62465#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62466#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:16,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {62466#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62467#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:16,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {62467#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62468#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:16,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {62468#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62469#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:16,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {62469#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62470#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:16,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {62470#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62471#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:16,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {62471#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62472#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:16,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {62472#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62473#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:16,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {62473#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {62473#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:16,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {62473#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {62534#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:16,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {62534#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62538#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:06:16,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {62538#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62542#(and (= main_~y~0 (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:16,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {62542#(and (= main_~y~0 (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62546#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:16,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {62546#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62550#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:16,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {62550#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62554#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:16,837 INFO L290 TraceCheckUtils]: 22: Hoare triple {62554#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62558#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:16,838 INFO L290 TraceCheckUtils]: 23: Hoare triple {62558#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62562#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:16,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {62562#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~z~0 % 4294967296 > 0); {62460#false} is VALID [2022-04-08 10:06:16,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-08 10:06:16,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-08 10:06:16,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-08 10:06:16,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-08 10:06:16,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-08 10:06:16,838 INFO L290 TraceCheckUtils]: 30: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-08 10:06:16,838 INFO L290 TraceCheckUtils]: 31: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-08 10:06:16,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-08 10:06:16,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-08 10:06:16,839 INFO L290 TraceCheckUtils]: 34: Hoare triple {62460#false} assume !(~y~0 % 4294967296 > 0); {62460#false} is VALID [2022-04-08 10:06:16,839 INFO L272 TraceCheckUtils]: 35: Hoare triple {62460#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {62460#false} is VALID [2022-04-08 10:06:16,839 INFO L290 TraceCheckUtils]: 36: Hoare triple {62460#false} ~cond := #in~cond; {62460#false} is VALID [2022-04-08 10:06:16,839 INFO L290 TraceCheckUtils]: 37: Hoare triple {62460#false} assume 0 == ~cond; {62460#false} is VALID [2022-04-08 10:06:16,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {62460#false} assume !false; {62460#false} is VALID [2022-04-08 10:06:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:06:16,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:17,403 INFO L290 TraceCheckUtils]: 38: Hoare triple {62460#false} assume !false; {62460#false} is VALID [2022-04-08 10:06:17,403 INFO L290 TraceCheckUtils]: 37: Hoare triple {62460#false} assume 0 == ~cond; {62460#false} is VALID [2022-04-08 10:06:17,403 INFO L290 TraceCheckUtils]: 36: Hoare triple {62460#false} ~cond := #in~cond; {62460#false} is VALID [2022-04-08 10:06:17,404 INFO L272 TraceCheckUtils]: 35: Hoare triple {62460#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {62460#false} is VALID [2022-04-08 10:06:17,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {62460#false} assume !(~y~0 % 4294967296 > 0); {62460#false} is VALID [2022-04-08 10:06:17,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-08 10:06:17,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {62626#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-08 10:06:17,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {62630#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62626#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:06:17,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {62634#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62630#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:06:17,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {62638#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62634#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:06:17,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {62642#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62638#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:06:17,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {62646#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62642#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:06:17,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {62650#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62646#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:06:17,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {62654#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62650#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:06:17,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {62658#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {62654#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:06:17,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {62662#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62658#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:06:17,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {62666#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62662#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:06:17,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {62670#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62666#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:06:17,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {62674#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62670#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:06:17,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {62678#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62674#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:06:17,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {62682#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62678#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:06:17,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {62686#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62682#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:06:17,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {62459#true} ~z~0 := ~y~0; {62686#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:06:17,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {62459#true} assume !(~x~0 % 4294967296 > 0); {62459#true} is VALID [2022-04-08 10:06:17,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {62459#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62459#true} is VALID [2022-04-08 10:06:17,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {62459#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62459#true} is VALID [2022-04-08 10:06:17,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {62459#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62459#true} is VALID [2022-04-08 10:06:17,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {62459#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62459#true} is VALID [2022-04-08 10:06:17,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {62459#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62459#true} is VALID [2022-04-08 10:06:17,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {62459#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62459#true} is VALID [2022-04-08 10:06:17,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {62459#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62459#true} is VALID [2022-04-08 10:06:17,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {62459#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62459#true} is VALID [2022-04-08 10:06:17,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {62459#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62459#true} is VALID [2022-04-08 10:06:17,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {62459#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62459#true} is VALID [2022-04-08 10:06:17,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {62459#true} call #t~ret11 := main(); {62459#true} is VALID [2022-04-08 10:06:17,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62459#true} {62459#true} #61#return; {62459#true} is VALID [2022-04-08 10:06:17,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {62459#true} assume true; {62459#true} is VALID [2022-04-08 10:06:17,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {62459#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {62459#true} is VALID [2022-04-08 10:06:17,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {62459#true} call ULTIMATE.init(); {62459#true} is VALID [2022-04-08 10:06:17,416 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-08 10:06:17,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47920148] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:17,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:17,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 18] total 45 [2022-04-08 10:06:17,416 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:17,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [322280527] [2022-04-08 10:06:17,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [322280527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:17,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:17,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:06:17,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557645042] [2022-04-08 10:06:17,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:17,417 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-08 10:06:17,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:17,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:17,437 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-08 10:06:17,438 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:06:17,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:17,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:06:17,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1728, Unknown=0, NotChecked=0, Total=1980 [2022-04-08 10:06:17,438 INFO L87 Difference]: Start difference. First operand 145 states and 188 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:19,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:19,159 INFO L93 Difference]: Finished difference Result 172 states and 215 transitions. [2022-04-08 10:06:19,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:06:19,159 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-08 10:06:19,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:19,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 57 transitions. [2022-04-08 10:06:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 57 transitions. [2022-04-08 10:06:19,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 57 transitions. [2022-04-08 10:06:19,206 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-08 10:06:19,207 INFO L225 Difference]: With dead ends: 172 [2022-04-08 10:06:19,208 INFO L226 Difference]: Without dead ends: 157 [2022-04-08 10:06:19,208 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=430, Invalid=3476, Unknown=0, NotChecked=0, Total=3906 [2022-04-08 10:06:19,208 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:19,208 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 93 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:06:19,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-08 10:06:19,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2022-04-08 10:06:19,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:19,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 146 states, 141 states have (on average 1.3120567375886525) internal successors, (185), 141 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:19,640 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 146 states, 141 states have (on average 1.3120567375886525) internal successors, (185), 141 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:19,640 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 146 states, 141 states have (on average 1.3120567375886525) internal successors, (185), 141 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:19,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:19,642 INFO L93 Difference]: Finished difference Result 157 states and 200 transitions. [2022-04-08 10:06:19,642 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 200 transitions. [2022-04-08 10:06:19,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:19,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:19,642 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 141 states have (on average 1.3120567375886525) internal successors, (185), 141 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 157 states. [2022-04-08 10:06:19,642 INFO L87 Difference]: Start difference. First operand has 146 states, 141 states have (on average 1.3120567375886525) internal successors, (185), 141 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 157 states. [2022-04-08 10:06:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:19,643 INFO L93 Difference]: Finished difference Result 157 states and 200 transitions. [2022-04-08 10:06:19,643 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 200 transitions. [2022-04-08 10:06:19,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:19,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:19,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:19,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.3120567375886525) internal successors, (185), 141 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2022-04-08 10:06:19,645 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 189 transitions. Word has length 39 [2022-04-08 10:06:19,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:19,645 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 189 transitions. [2022-04-08 10:06:19,645 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:19,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 189 transitions. [2022-04-08 10:06:20,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:20,004 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 189 transitions. [2022-04-08 10:06:20,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:06:20,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:20,005 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:20,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2022-04-08 10:06:20,205 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:20,205 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:20,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:20,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1135246993, now seen corresponding path program 137 times [2022-04-08 10:06:20,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:20,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [824822860] [2022-04-08 10:06:20,207 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:20,208 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:20,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1135246993, now seen corresponding path program 138 times [2022-04-08 10:06:20,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:20,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424502385] [2022-04-08 10:06:20,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:20,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:20,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:20,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {63748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {63726#true} is VALID [2022-04-08 10:06:20,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {63726#true} assume true; {63726#true} is VALID [2022-04-08 10:06:20,489 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63726#true} {63726#true} #61#return; {63726#true} is VALID [2022-04-08 10:06:20,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {63726#true} call ULTIMATE.init(); {63748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:20,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {63748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {63726#true} is VALID [2022-04-08 10:06:20,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {63726#true} assume true; {63726#true} is VALID [2022-04-08 10:06:20,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63726#true} {63726#true} #61#return; {63726#true} is VALID [2022-04-08 10:06:20,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {63726#true} call #t~ret11 := main(); {63726#true} is VALID [2022-04-08 10:06:20,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {63726#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63731#(= main_~y~0 0)} is VALID [2022-04-08 10:06:20,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {63731#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63732#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:20,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {63732#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63733#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:20,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {63733#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63734#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:20,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {63734#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63735#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:20,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {63735#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63736#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:20,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {63736#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63737#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:20,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {63737#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63738#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:20,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {63738#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63739#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:20,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {63739#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63740#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:20,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {63740#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63741#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:20,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {63741#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {63741#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:20,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {63741#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {63742#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:06:20,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {63742#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63743#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:06:20,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {63743#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63744#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:06:20,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {63744#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63745#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:06:20,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {63745#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63746#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:06:20,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {63746#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63747#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:20,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {63747#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {63727#false} is VALID [2022-04-08 10:06:20,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:20,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:20,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:20,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:20,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:20,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:20,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:20,502 INFO L290 TraceCheckUtils]: 31: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:20,502 INFO L290 TraceCheckUtils]: 32: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:20,502 INFO L290 TraceCheckUtils]: 33: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:20,503 INFO L290 TraceCheckUtils]: 34: Hoare triple {63727#false} assume !(~y~0 % 4294967296 > 0); {63727#false} is VALID [2022-04-08 10:06:20,503 INFO L272 TraceCheckUtils]: 35: Hoare triple {63727#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {63727#false} is VALID [2022-04-08 10:06:20,503 INFO L290 TraceCheckUtils]: 36: Hoare triple {63727#false} ~cond := #in~cond; {63727#false} is VALID [2022-04-08 10:06:20,503 INFO L290 TraceCheckUtils]: 37: Hoare triple {63727#false} assume 0 == ~cond; {63727#false} is VALID [2022-04-08 10:06:20,503 INFO L290 TraceCheckUtils]: 38: Hoare triple {63727#false} assume !false; {63727#false} is VALID [2022-04-08 10:06:20,503 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:06:20,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:20,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424502385] [2022-04-08 10:06:20,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424502385] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:20,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103806987] [2022-04-08 10:06:20,504 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:06:20,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:20,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:20,506 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:06:20,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-04-08 10:06:20,646 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:06:20,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:20,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 10:06:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:20,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:20,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {63726#true} call ULTIMATE.init(); {63726#true} is VALID [2022-04-08 10:06:20,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {63726#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {63726#true} is VALID [2022-04-08 10:06:20,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {63726#true} assume true; {63726#true} is VALID [2022-04-08 10:06:20,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63726#true} {63726#true} #61#return; {63726#true} is VALID [2022-04-08 10:06:20,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {63726#true} call #t~ret11 := main(); {63726#true} is VALID [2022-04-08 10:06:20,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {63726#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63731#(= main_~y~0 0)} is VALID [2022-04-08 10:06:20,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {63731#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63732#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:20,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {63732#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63733#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:20,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {63733#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63734#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:20,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {63734#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63735#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:20,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {63735#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63736#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:20,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {63736#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63737#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:20,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {63737#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63738#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:20,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {63738#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63739#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:20,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {63739#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63740#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:20,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {63740#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63741#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:20,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {63741#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {63741#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:20,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {63741#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {63742#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:06:20,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {63742#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63743#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:06:20,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {63743#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63744#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:06:20,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {63744#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63745#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:06:20,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {63745#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63746#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:06:20,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {63746#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63818#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:06:20,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {63818#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {63727#false} is VALID [2022-04-08 10:06:20,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:20,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:20,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:20,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:20,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:20,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:20,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:20,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:20,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:20,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:20,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {63727#false} assume !(~y~0 % 4294967296 > 0); {63727#false} is VALID [2022-04-08 10:06:20,947 INFO L272 TraceCheckUtils]: 35: Hoare triple {63727#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {63727#false} is VALID [2022-04-08 10:06:20,947 INFO L290 TraceCheckUtils]: 36: Hoare triple {63727#false} ~cond := #in~cond; {63727#false} is VALID [2022-04-08 10:06:20,947 INFO L290 TraceCheckUtils]: 37: Hoare triple {63727#false} assume 0 == ~cond; {63727#false} is VALID [2022-04-08 10:06:20,947 INFO L290 TraceCheckUtils]: 38: Hoare triple {63727#false} assume !false; {63727#false} is VALID [2022-04-08 10:06:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:06:20,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:21,430 INFO L290 TraceCheckUtils]: 38: Hoare triple {63727#false} assume !false; {63727#false} is VALID [2022-04-08 10:06:21,430 INFO L290 TraceCheckUtils]: 37: Hoare triple {63727#false} assume 0 == ~cond; {63727#false} is VALID [2022-04-08 10:06:21,430 INFO L290 TraceCheckUtils]: 36: Hoare triple {63727#false} ~cond := #in~cond; {63727#false} is VALID [2022-04-08 10:06:21,430 INFO L272 TraceCheckUtils]: 35: Hoare triple {63727#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {63727#false} is VALID [2022-04-08 10:06:21,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {63727#false} assume !(~y~0 % 4294967296 > 0); {63727#false} is VALID [2022-04-08 10:06:21,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:21,431 INFO L290 TraceCheckUtils]: 32: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:21,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:21,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:21,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:21,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:21,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:21,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:21,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:21,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-08 10:06:21,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {63912#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {63727#false} is VALID [2022-04-08 10:06:21,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {63916#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63912#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:21,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {63920#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63916#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:21,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {63924#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63920#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:21,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {63928#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63924#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:21,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {63932#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63928#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:06:21,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {63936#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {63932#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:06:21,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {63936#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {63936#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:21,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {63943#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63936#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:21,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {63947#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63943#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:21,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {63951#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63947#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:21,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {63955#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63951#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:21,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {63959#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63955#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:21,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {63963#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63959#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:21,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {63967#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63963#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:21,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {63971#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63967#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:21,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {63975#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63971#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:21,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {63979#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63975#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:21,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {63726#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63979#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:21,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {63726#true} call #t~ret11 := main(); {63726#true} is VALID [2022-04-08 10:06:21,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63726#true} {63726#true} #61#return; {63726#true} is VALID [2022-04-08 10:06:21,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {63726#true} assume true; {63726#true} is VALID [2022-04-08 10:06:21,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {63726#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {63726#true} is VALID [2022-04-08 10:06:21,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {63726#true} call ULTIMATE.init(); {63726#true} is VALID [2022-04-08 10:06:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:06:21,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103806987] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:21,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:21,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-08 10:06:21,443 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:21,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [824822860] [2022-04-08 10:06:21,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [824822860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:21,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:21,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:06:21,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818947991] [2022-04-08 10:06:21,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:21,444 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-08 10:06:21,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:21,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:21,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:21,463 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:06:21,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:21,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:06:21,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:06:21,464 INFO L87 Difference]: Start difference. First operand 146 states and 189 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:23,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:23,260 INFO L93 Difference]: Finished difference Result 175 states and 218 transitions. [2022-04-08 10:06:23,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:06:23,260 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-08 10:06:23,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:23,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 66 transitions. [2022-04-08 10:06:23,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:23,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 66 transitions. [2022-04-08 10:06:23,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 66 transitions. [2022-04-08 10:06:23,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:23,322 INFO L225 Difference]: With dead ends: 175 [2022-04-08 10:06:23,322 INFO L226 Difference]: Without dead ends: 159 [2022-04-08 10:06:23,322 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=662, Invalid=2878, Unknown=0, NotChecked=0, Total=3540 [2022-04-08 10:06:23,323 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:23,323 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 90 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:06:23,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-04-08 10:06:23,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 147. [2022-04-08 10:06:23,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:23,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:23,758 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:23,758 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:23,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:23,759 INFO L93 Difference]: Finished difference Result 159 states and 202 transitions. [2022-04-08 10:06:23,759 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 202 transitions. [2022-04-08 10:06:23,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:23,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:23,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 159 states. [2022-04-08 10:06:23,760 INFO L87 Difference]: Start difference. First operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 159 states. [2022-04-08 10:06:23,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:23,761 INFO L93 Difference]: Finished difference Result 159 states and 202 transitions. [2022-04-08 10:06:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 202 transitions. [2022-04-08 10:06:23,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:23,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:23,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:23,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:23,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 190 transitions. [2022-04-08 10:06:23,763 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 190 transitions. Word has length 39 [2022-04-08 10:06:23,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:23,763 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 190 transitions. [2022-04-08 10:06:23,763 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:23,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 190 transitions. [2022-04-08 10:06:24,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:24,124 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 190 transitions. [2022-04-08 10:06:24,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:06:24,124 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:24,124 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:24,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2022-04-08 10:06:24,324 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:24,324 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:24,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:24,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1958069505, now seen corresponding path program 139 times [2022-04-08 10:06:24,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:24,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [347773130] [2022-04-08 10:06:24,327 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:24,327 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:24,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1958069505, now seen corresponding path program 140 times [2022-04-08 10:06:24,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:24,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860567937] [2022-04-08 10:06:24,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:24,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:24,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:24,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {65027#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {65006#true} is VALID [2022-04-08 10:06:24,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {65006#true} assume true; {65006#true} is VALID [2022-04-08 10:06:24,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65006#true} {65006#true} #61#return; {65006#true} is VALID [2022-04-08 10:06:24,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {65006#true} call ULTIMATE.init(); {65027#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:24,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {65027#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {65006#true} is VALID [2022-04-08 10:06:24,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {65006#true} assume true; {65006#true} is VALID [2022-04-08 10:06:24,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65006#true} {65006#true} #61#return; {65006#true} is VALID [2022-04-08 10:06:24,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {65006#true} call #t~ret11 := main(); {65006#true} is VALID [2022-04-08 10:06:24,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {65006#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65011#(= main_~y~0 0)} is VALID [2022-04-08 10:06:24,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {65011#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65012#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:24,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {65012#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:24,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {65013#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65014#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:24,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {65014#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65015#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:24,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {65015#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65016#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:24,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {65016#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65017#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:24,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {65017#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65018#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:24,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {65018#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65019#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:24,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {65019#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65020#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:24,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {65020#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65021#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:24,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {65021#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65022#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:24,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {65022#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {65022#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:24,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {65022#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {65023#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:06:24,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {65023#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65024#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:06:24,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {65024#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65025#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:06:24,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {65025#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65026#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:24,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {65026#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {65007#false} is VALID [2022-04-08 10:06:24,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,598 INFO L290 TraceCheckUtils]: 32: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {65007#false} assume !(~y~0 % 4294967296 > 0); {65007#false} is VALID [2022-04-08 10:06:24,598 INFO L272 TraceCheckUtils]: 35: Hoare triple {65007#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {65007#false} is VALID [2022-04-08 10:06:24,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {65007#false} ~cond := #in~cond; {65007#false} is VALID [2022-04-08 10:06:24,598 INFO L290 TraceCheckUtils]: 37: Hoare triple {65007#false} assume 0 == ~cond; {65007#false} is VALID [2022-04-08 10:06:24,598 INFO L290 TraceCheckUtils]: 38: Hoare triple {65007#false} assume !false; {65007#false} is VALID [2022-04-08 10:06:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:06:24,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:24,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860567937] [2022-04-08 10:06:24,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860567937] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:24,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94750996] [2022-04-08 10:06:24,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:24,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:24,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:24,599 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:06:24,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-04-08 10:06:24,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:24,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:24,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:06:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:24,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:24,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {65006#true} call ULTIMATE.init(); {65006#true} is VALID [2022-04-08 10:06:24,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {65006#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {65006#true} is VALID [2022-04-08 10:06:24,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {65006#true} assume true; {65006#true} is VALID [2022-04-08 10:06:24,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65006#true} {65006#true} #61#return; {65006#true} is VALID [2022-04-08 10:06:24,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {65006#true} call #t~ret11 := main(); {65006#true} is VALID [2022-04-08 10:06:24,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {65006#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65011#(= main_~y~0 0)} is VALID [2022-04-08 10:06:24,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {65011#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65012#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:24,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {65012#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:24,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {65013#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65014#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:24,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {65014#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65015#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:24,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {65015#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65016#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:24,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {65016#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65017#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:24,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {65017#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65018#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:24,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {65018#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65019#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:24,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {65019#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65020#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:24,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {65020#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65021#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:24,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {65021#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65022#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:24,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {65022#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {65022#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:24,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {65022#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {65023#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:06:24,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {65023#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65024#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:06:24,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {65024#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65025#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:06:24,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {65025#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65094#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:06:24,940 INFO L290 TraceCheckUtils]: 22: Hoare triple {65094#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {65007#false} is VALID [2022-04-08 10:06:24,941 INFO L290 TraceCheckUtils]: 23: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,941 INFO L290 TraceCheckUtils]: 24: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,941 INFO L290 TraceCheckUtils]: 25: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,941 INFO L290 TraceCheckUtils]: 32: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:24,941 INFO L290 TraceCheckUtils]: 34: Hoare triple {65007#false} assume !(~y~0 % 4294967296 > 0); {65007#false} is VALID [2022-04-08 10:06:24,941 INFO L272 TraceCheckUtils]: 35: Hoare triple {65007#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {65007#false} is VALID [2022-04-08 10:06:24,941 INFO L290 TraceCheckUtils]: 36: Hoare triple {65007#false} ~cond := #in~cond; {65007#false} is VALID [2022-04-08 10:06:24,941 INFO L290 TraceCheckUtils]: 37: Hoare triple {65007#false} assume 0 == ~cond; {65007#false} is VALID [2022-04-08 10:06:24,941 INFO L290 TraceCheckUtils]: 38: Hoare triple {65007#false} assume !false; {65007#false} is VALID [2022-04-08 10:06:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:06:24,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:25,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {65007#false} assume !false; {65007#false} is VALID [2022-04-08 10:06:25,394 INFO L290 TraceCheckUtils]: 37: Hoare triple {65007#false} assume 0 == ~cond; {65007#false} is VALID [2022-04-08 10:06:25,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {65007#false} ~cond := #in~cond; {65007#false} is VALID [2022-04-08 10:06:25,394 INFO L272 TraceCheckUtils]: 35: Hoare triple {65007#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {65007#false} is VALID [2022-04-08 10:06:25,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {65007#false} assume !(~y~0 % 4294967296 > 0); {65007#false} is VALID [2022-04-08 10:06:25,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:25,394 INFO L290 TraceCheckUtils]: 32: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:25,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:25,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:25,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:25,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:25,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:25,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:25,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:25,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:25,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-08 10:06:25,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {65194#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {65007#false} is VALID [2022-04-08 10:06:25,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {65198#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65194#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:25,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {65202#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65198#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:25,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {65206#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65202#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:25,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {65210#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {65206#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:25,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {65210#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {65210#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:25,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {65217#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65210#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:25,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {65221#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65217#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:25,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {65225#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65221#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:25,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {65229#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65225#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:25,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {65233#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65229#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:25,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {65237#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65233#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:25,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {65241#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65237#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:25,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {65245#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65241#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:25,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {65249#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65245#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:25,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {65253#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65249#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:06:25,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {65257#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65253#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:25,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {65006#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65257#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:06:25,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {65006#true} call #t~ret11 := main(); {65006#true} is VALID [2022-04-08 10:06:25,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65006#true} {65006#true} #61#return; {65006#true} is VALID [2022-04-08 10:06:25,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {65006#true} assume true; {65006#true} is VALID [2022-04-08 10:06:25,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {65006#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {65006#true} is VALID [2022-04-08 10:06:25,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {65006#true} call ULTIMATE.init(); {65006#true} is VALID [2022-04-08 10:06:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:06:25,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94750996] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:25,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:25,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 10:06:25,406 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:25,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [347773130] [2022-04-08 10:06:25,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [347773130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:25,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:25,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:06:25,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359126952] [2022-04-08 10:06:25,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:25,406 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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 39 [2022-04-08 10:06:25,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:25,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:06:25,424 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-08 10:06:25,425 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:06:25,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:25,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:06:25,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1027, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:06:25,425 INFO L87 Difference]: Start difference. First operand 147 states and 190 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:06:27,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:27,217 INFO L93 Difference]: Finished difference Result 178 states and 221 transitions. [2022-04-08 10:06:27,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:06:27,217 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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 39 [2022-04-08 10:06:27,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:27,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:06:27,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 70 transitions. [2022-04-08 10:06:27,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:06:27,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 70 transitions. [2022-04-08 10:06:27,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 70 transitions. [2022-04-08 10:06:27,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:27,274 INFO L225 Difference]: With dead ends: 178 [2022-04-08 10:06:27,274 INFO L226 Difference]: Without dead ends: 161 [2022-04-08 10:06:27,275 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=631, Invalid=2561, Unknown=0, NotChecked=0, Total=3192 [2022-04-08 10:06:27,275 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:27,275 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 92 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:06:27,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-08 10:06:27,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2022-04-08 10:06:27,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:27,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:27,723 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:27,723 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:27,724 INFO L93 Difference]: Finished difference Result 161 states and 204 transitions. [2022-04-08 10:06:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 204 transitions. [2022-04-08 10:06:27,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:27,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:27,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-08 10:06:27,725 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-08 10:06:27,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:27,726 INFO L93 Difference]: Finished difference Result 161 states and 204 transitions. [2022-04-08 10:06:27,726 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 204 transitions. [2022-04-08 10:06:27,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:27,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:27,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:27,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:27,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:27,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2022-04-08 10:06:27,728 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 39 [2022-04-08 10:06:27,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:27,728 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 191 transitions. [2022-04-08 10:06:27,728 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:06:27,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 191 transitions. [2022-04-08 10:06:28,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:28,093 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 191 transitions. [2022-04-08 10:06:28,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:06:28,093 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:28,093 INFO L499 BasicCegarLoop]: trace histogram [22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:28,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2022-04-08 10:06:28,294 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2022-04-08 10:06:28,294 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:28,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:28,294 INFO L85 PathProgramCache]: Analyzing trace with hash 269298095, now seen corresponding path program 141 times [2022-04-08 10:06:28,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:28,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1762789646] [2022-04-08 10:06:28,296 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:28,296 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:28,296 INFO L85 PathProgramCache]: Analyzing trace with hash 269298095, now seen corresponding path program 142 times [2022-04-08 10:06:28,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:28,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642696904] [2022-04-08 10:06:28,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:28,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:28,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:28,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {66324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {66294#true} is VALID [2022-04-08 10:06:28,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {66294#true} assume true; {66294#true} is VALID [2022-04-08 10:06:28,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66294#true} {66294#true} #61#return; {66294#true} is VALID [2022-04-08 10:06:28,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {66294#true} call ULTIMATE.init(); {66324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:28,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {66324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {66294#true} is VALID [2022-04-08 10:06:28,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {66294#true} assume true; {66294#true} is VALID [2022-04-08 10:06:28,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66294#true} {66294#true} #61#return; {66294#true} is VALID [2022-04-08 10:06:28,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {66294#true} call #t~ret11 := main(); {66294#true} is VALID [2022-04-08 10:06:28,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {66294#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {66299#(= main_~y~0 0)} is VALID [2022-04-08 10:06:28,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {66299#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66300#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:28,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {66300#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66301#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:28,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {66301#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66302#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:28,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {66302#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66303#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:28,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {66303#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66304#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:28,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {66304#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66305#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:28,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {66305#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66306#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:28,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {66306#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66307#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:28,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {66307#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66308#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:28,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {66308#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66309#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:28,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {66309#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66310#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:28,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {66310#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66311#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:28,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {66311#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66312#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:06:28,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {66312#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66313#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:06:28,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {66313#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66314#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:06:28,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {66314#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66315#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:06:28,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {66315#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66316#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:06:28,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {66316#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66317#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:06:28,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {66317#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66318#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:06:28,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {66318#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66319#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:06:28,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {66319#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66320#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:06:28,749 INFO L290 TraceCheckUtils]: 27: Hoare triple {66320#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66321#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:06:28,749 INFO L290 TraceCheckUtils]: 28: Hoare triple {66321#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {66321#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:06:28,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {66321#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {66322#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-08 10:06:28,750 INFO L290 TraceCheckUtils]: 30: Hoare triple {66322#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66323#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} is VALID [2022-04-08 10:06:28,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {66323#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {66295#false} is VALID [2022-04-08 10:06:28,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {66295#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {66295#false} is VALID [2022-04-08 10:06:28,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {66295#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {66295#false} is VALID [2022-04-08 10:06:28,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {66295#false} assume !(~y~0 % 4294967296 > 0); {66295#false} is VALID [2022-04-08 10:06:28,750 INFO L272 TraceCheckUtils]: 35: Hoare triple {66295#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {66295#false} is VALID [2022-04-08 10:06:28,751 INFO L290 TraceCheckUtils]: 36: Hoare triple {66295#false} ~cond := #in~cond; {66295#false} is VALID [2022-04-08 10:06:28,751 INFO L290 TraceCheckUtils]: 37: Hoare triple {66295#false} assume 0 == ~cond; {66295#false} is VALID [2022-04-08 10:06:28,751 INFO L290 TraceCheckUtils]: 38: Hoare triple {66295#false} assume !false; {66295#false} is VALID [2022-04-08 10:06:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:06:28,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:28,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642696904] [2022-04-08 10:06:28,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642696904] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:28,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079804744] [2022-04-08 10:06:28,751 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:06:28,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:28,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:28,752 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:06:28,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-04-08 10:06:28,797 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:06:28,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:28,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-08 10:06:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:28,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:29,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {66294#true} call ULTIMATE.init(); {66294#true} is VALID [2022-04-08 10:06:29,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {66294#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {66294#true} is VALID [2022-04-08 10:06:29,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {66294#true} assume true; {66294#true} is VALID [2022-04-08 10:06:29,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66294#true} {66294#true} #61#return; {66294#true} is VALID [2022-04-08 10:06:29,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {66294#true} call #t~ret11 := main(); {66294#true} is VALID [2022-04-08 10:06:29,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {66294#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {66299#(= main_~y~0 0)} is VALID [2022-04-08 10:06:29,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {66299#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66300#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:29,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {66300#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66301#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:29,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {66301#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66302#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:29,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {66302#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66303#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:29,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {66303#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66304#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:29,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {66304#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66305#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:29,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {66305#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66306#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:29,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {66306#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66307#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:29,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {66307#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66308#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:29,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {66308#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66309#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:29,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {66309#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66310#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:29,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {66310#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66311#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:29,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {66311#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66312#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:06:29,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {66312#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66313#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:06:29,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {66313#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66314#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:06:29,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {66314#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66315#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:06:29,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {66315#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66316#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:06:29,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {66316#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66317#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:06:29,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {66317#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66318#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:06:29,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {66318#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66319#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:06:29,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {66319#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66320#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:06:29,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {66320#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66321#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:06:29,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {66321#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {66321#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:06:29,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {66321#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {66322#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-08 10:06:29,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {66322#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66418#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-08 10:06:29,175 INFO L290 TraceCheckUtils]: 31: Hoare triple {66418#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {66295#false} is VALID [2022-04-08 10:06:29,175 INFO L290 TraceCheckUtils]: 32: Hoare triple {66295#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {66295#false} is VALID [2022-04-08 10:06:29,175 INFO L290 TraceCheckUtils]: 33: Hoare triple {66295#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {66295#false} is VALID [2022-04-08 10:06:29,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {66295#false} assume !(~y~0 % 4294967296 > 0); {66295#false} is VALID [2022-04-08 10:06:29,175 INFO L272 TraceCheckUtils]: 35: Hoare triple {66295#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {66295#false} is VALID [2022-04-08 10:06:29,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {66295#false} ~cond := #in~cond; {66295#false} is VALID [2022-04-08 10:06:29,175 INFO L290 TraceCheckUtils]: 37: Hoare triple {66295#false} assume 0 == ~cond; {66295#false} is VALID [2022-04-08 10:06:29,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {66295#false} assume !false; {66295#false} is VALID [2022-04-08 10:06:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:06:29,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:30,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {66295#false} assume !false; {66295#false} is VALID [2022-04-08 10:06:30,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {66295#false} assume 0 == ~cond; {66295#false} is VALID [2022-04-08 10:06:30,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {66295#false} ~cond := #in~cond; {66295#false} is VALID [2022-04-08 10:06:30,134 INFO L272 TraceCheckUtils]: 35: Hoare triple {66295#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {66295#false} is VALID [2022-04-08 10:06:30,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {66295#false} assume !(~y~0 % 4294967296 > 0); {66295#false} is VALID [2022-04-08 10:06:30,134 INFO L290 TraceCheckUtils]: 33: Hoare triple {66295#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {66295#false} is VALID [2022-04-08 10:06:30,134 INFO L290 TraceCheckUtils]: 32: Hoare triple {66295#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {66295#false} is VALID [2022-04-08 10:06:30,135 INFO L290 TraceCheckUtils]: 31: Hoare triple {66464#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {66295#false} is VALID [2022-04-08 10:06:30,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {66468#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66464#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:30,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {66472#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {66468#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:30,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {66472#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {66472#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:30,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {66479#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66472#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:30,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {66483#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66479#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:30,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {66487#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66483#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:30,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {66491#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66487#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:30,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {66495#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66491#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:30,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {66499#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66495#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:30,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {66503#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66499#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:30,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {66507#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66503#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:06:30,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {66511#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66507#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:30,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {66515#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66511#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:06:30,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {66519#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66515#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:06:30,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {66523#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66519#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:06:30,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {66527#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66523#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:06:30,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {66531#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66527#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:06:30,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {66535#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66531#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:06:30,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {66539#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66535#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:06:30,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {66543#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66539#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:06:30,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {66547#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66543#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:06:30,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {66551#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66547#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:06:30,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {66555#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66551#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:06:30,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {66559#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66555#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:30,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {66563#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66559#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:06:30,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {66294#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {66563#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:06:30,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {66294#true} call #t~ret11 := main(); {66294#true} is VALID [2022-04-08 10:06:30,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66294#true} {66294#true} #61#return; {66294#true} is VALID [2022-04-08 10:06:30,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {66294#true} assume true; {66294#true} is VALID [2022-04-08 10:06:30,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {66294#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {66294#true} is VALID [2022-04-08 10:06:30,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {66294#true} call ULTIMATE.init(); {66294#true} is VALID [2022-04-08 10:06:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:06:30,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079804744] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:30,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:30,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-08 10:06:30,151 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:30,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1762789646] [2022-04-08 10:06:30,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1762789646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:30,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:30,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-08 10:06:30,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166050812] [2022-04-08 10:06:30,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:30,151 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-08 10:06:30,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:30,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:30,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:30,174 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-08 10:06:30,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:30,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-08 10:06:30,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=2222, Unknown=0, NotChecked=0, Total=2862 [2022-04-08 10:06:30,175 INFO L87 Difference]: Start difference. First operand 148 states and 191 transitions. Second operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:34,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:34,658 INFO L93 Difference]: Finished difference Result 234 states and 337 transitions. [2022-04-08 10:06:34,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 10:06:34,658 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-08 10:06:34,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:34,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 152 transitions. [2022-04-08 10:06:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 152 transitions. [2022-04-08 10:06:34,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 152 transitions. [2022-04-08 10:06:34,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:34,787 INFO L225 Difference]: With dead ends: 234 [2022-04-08 10:06:34,787 INFO L226 Difference]: Without dead ends: 226 [2022-04-08 10:06:34,788 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1354, Invalid=4966, Unknown=0, NotChecked=0, Total=6320 [2022-04-08 10:06:34,788 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 123 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 2530 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 2629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:34,788 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 172 Invalid, 2629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2530 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-08 10:06:34,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-04-08 10:06:35,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 154. [2022-04-08 10:06:35,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:35,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 154 states, 149 states have (on average 1.308724832214765) internal successors, (195), 149 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:35,264 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 154 states, 149 states have (on average 1.308724832214765) internal successors, (195), 149 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:35,264 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 154 states, 149 states have (on average 1.308724832214765) internal successors, (195), 149 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:35,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:35,266 INFO L93 Difference]: Finished difference Result 226 states and 278 transitions. [2022-04-08 10:06:35,266 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 278 transitions. [2022-04-08 10:06:35,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:35,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:35,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 149 states have (on average 1.308724832214765) internal successors, (195), 149 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 226 states. [2022-04-08 10:06:35,267 INFO L87 Difference]: Start difference. First operand has 154 states, 149 states have (on average 1.308724832214765) internal successors, (195), 149 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 226 states. [2022-04-08 10:06:35,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:35,269 INFO L93 Difference]: Finished difference Result 226 states and 278 transitions. [2022-04-08 10:06:35,269 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 278 transitions. [2022-04-08 10:06:35,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:35,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:35,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:35,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:35,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.308724832214765) internal successors, (195), 149 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:35,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 199 transitions. [2022-04-08 10:06:35,271 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 199 transitions. Word has length 39 [2022-04-08 10:06:35,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:35,271 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 199 transitions. [2022-04-08 10:06:35,271 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:35,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 154 states and 199 transitions. [2022-04-08 10:06:35,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:35,653 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 199 transitions. [2022-04-08 10:06:35,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:06:35,654 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:35,654 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:35,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2022-04-08 10:06:35,854 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:35,854 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:35,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:35,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1413810305, now seen corresponding path program 143 times [2022-04-08 10:06:35,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:35,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1245422994] [2022-04-08 10:06:35,858 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:35,858 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:35,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1413810305, now seen corresponding path program 144 times [2022-04-08 10:06:35,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:35,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253520015] [2022-04-08 10:06:35,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:35,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:36,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:36,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {67888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67864#true} is VALID [2022-04-08 10:06:36,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {67864#true} assume true; {67864#true} is VALID [2022-04-08 10:06:36,157 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67864#true} {67864#true} #61#return; {67864#true} is VALID [2022-04-08 10:06:36,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {67864#true} call ULTIMATE.init(); {67888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:36,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {67888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67864#true} is VALID [2022-04-08 10:06:36,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {67864#true} assume true; {67864#true} is VALID [2022-04-08 10:06:36,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67864#true} {67864#true} #61#return; {67864#true} is VALID [2022-04-08 10:06:36,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {67864#true} call #t~ret11 := main(); {67864#true} is VALID [2022-04-08 10:06:36,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {67864#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67869#(= main_~y~0 0)} is VALID [2022-04-08 10:06:36,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {67869#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67870#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:36,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {67870#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67871#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:36,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {67871#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67872#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:36,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {67872#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67873#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:36,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {67873#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67874#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:36,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {67874#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67875#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:36,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {67875#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67876#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:36,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {67876#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67877#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:36,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {67877#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67878#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:36,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {67878#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {67878#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:36,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {67878#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {67879#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:06:36,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {67879#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67880#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:06:36,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {67880#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67881#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:06:36,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {67881#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67882#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:06:36,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {67882#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67883#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:06:36,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {67883#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67884#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:06:36,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {67884#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67885#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:06:36,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {67885#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67886#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:36,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {67886#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67887#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:36,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {67887#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {67865#false} is VALID [2022-04-08 10:06:36,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-08 10:06:36,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-08 10:06:36,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-08 10:06:36,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-08 10:06:36,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-08 10:06:36,168 INFO L290 TraceCheckUtils]: 31: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-08 10:06:36,168 INFO L290 TraceCheckUtils]: 32: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-08 10:06:36,168 INFO L290 TraceCheckUtils]: 33: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-08 10:06:36,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-08 10:06:36,168 INFO L290 TraceCheckUtils]: 35: Hoare triple {67865#false} assume !(~y~0 % 4294967296 > 0); {67865#false} is VALID [2022-04-08 10:06:36,168 INFO L272 TraceCheckUtils]: 36: Hoare triple {67865#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {67865#false} is VALID [2022-04-08 10:06:36,168 INFO L290 TraceCheckUtils]: 37: Hoare triple {67865#false} ~cond := #in~cond; {67865#false} is VALID [2022-04-08 10:06:36,168 INFO L290 TraceCheckUtils]: 38: Hoare triple {67865#false} assume 0 == ~cond; {67865#false} is VALID [2022-04-08 10:06:36,168 INFO L290 TraceCheckUtils]: 39: Hoare triple {67865#false} assume !false; {67865#false} is VALID [2022-04-08 10:06:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:06:36,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:36,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253520015] [2022-04-08 10:06:36,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253520015] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:36,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286977338] [2022-04-08 10:06:36,169 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:06:36,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:36,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:36,170 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:06:36,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-04-08 10:06:36,394 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:06:36,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:36,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-08 10:06:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:36,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:36,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {67864#true} call ULTIMATE.init(); {67864#true} is VALID [2022-04-08 10:06:36,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {67864#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67864#true} is VALID [2022-04-08 10:06:36,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {67864#true} assume true; {67864#true} is VALID [2022-04-08 10:06:36,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67864#true} {67864#true} #61#return; {67864#true} is VALID [2022-04-08 10:06:36,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {67864#true} call #t~ret11 := main(); {67864#true} is VALID [2022-04-08 10:06:36,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {67864#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67869#(= main_~y~0 0)} is VALID [2022-04-08 10:06:36,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {67869#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67870#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:36,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {67870#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67871#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:36,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {67871#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67872#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:36,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {67872#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67873#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:36,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {67873#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67874#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:36,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {67874#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67875#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:36,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {67875#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67876#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:36,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {67876#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67877#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:36,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {67877#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67878#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:36,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {67878#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {67878#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:36,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {67878#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {67940#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:36,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {67940#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67944#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:06:36,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {67944#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67948#(and (= main_~y~0 (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:36,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {67948#(and (= main_~y~0 (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67952#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:36,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {67952#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67956#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:36,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {67956#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67960#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:36,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {67960#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67964#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:36,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {67964#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67968#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 3)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:36,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {67968#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 3)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67972#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 4)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:36,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {67972#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 4)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~z~0 % 4294967296 > 0); {67865#false} is VALID [2022-04-08 10:06:36,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-08 10:06:36,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-08 10:06:36,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-08 10:06:36,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-08 10:06:36,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-08 10:06:36,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-08 10:06:36,826 INFO L290 TraceCheckUtils]: 32: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-08 10:06:36,826 INFO L290 TraceCheckUtils]: 33: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-08 10:06:36,826 INFO L290 TraceCheckUtils]: 34: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-08 10:06:36,826 INFO L290 TraceCheckUtils]: 35: Hoare triple {67865#false} assume !(~y~0 % 4294967296 > 0); {67865#false} is VALID [2022-04-08 10:06:36,827 INFO L272 TraceCheckUtils]: 36: Hoare triple {67865#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {67865#false} is VALID [2022-04-08 10:06:36,827 INFO L290 TraceCheckUtils]: 37: Hoare triple {67865#false} ~cond := #in~cond; {67865#false} is VALID [2022-04-08 10:06:36,827 INFO L290 TraceCheckUtils]: 38: Hoare triple {67865#false} assume 0 == ~cond; {67865#false} is VALID [2022-04-08 10:06:36,827 INFO L290 TraceCheckUtils]: 39: Hoare triple {67865#false} assume !false; {67865#false} is VALID [2022-04-08 10:06:36,827 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:06:36,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:37,562 INFO L290 TraceCheckUtils]: 39: Hoare triple {67865#false} assume !false; {67865#false} is VALID [2022-04-08 10:06:37,562 INFO L290 TraceCheckUtils]: 38: Hoare triple {67865#false} assume 0 == ~cond; {67865#false} is VALID [2022-04-08 10:06:37,562 INFO L290 TraceCheckUtils]: 37: Hoare triple {67865#false} ~cond := #in~cond; {67865#false} is VALID [2022-04-08 10:06:37,562 INFO L272 TraceCheckUtils]: 36: Hoare triple {67865#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {67865#false} is VALID [2022-04-08 10:06:37,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {67865#false} assume !(~y~0 % 4294967296 > 0); {67865#false} is VALID [2022-04-08 10:06:37,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {68033#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-08 10:06:37,564 INFO L290 TraceCheckUtils]: 33: Hoare triple {68037#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {68033#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:06:37,565 INFO L290 TraceCheckUtils]: 32: Hoare triple {68041#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {68037#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:06:37,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {68045#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {68041#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:06:37,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {68049#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {68045#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:06:37,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {68053#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {68049#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:06:37,569 INFO L290 TraceCheckUtils]: 28: Hoare triple {68057#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {68053#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:06:37,570 INFO L290 TraceCheckUtils]: 27: Hoare triple {68061#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {68057#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:06:37,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {68065#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {68061#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:06:37,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {68069#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {68065#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:06:37,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {68073#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68069#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:06:37,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {68077#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68073#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:06:37,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {68081#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68077#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:06:37,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {68085#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68081#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:06:37,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {68089#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68085#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:06:37,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {68093#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68089#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:06:37,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {68097#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68093#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:06:37,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {68101#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68097#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:06:37,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {67864#true} ~z~0 := ~y~0; {68101#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:06:37,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {67864#true} assume !(~x~0 % 4294967296 > 0); {67864#true} is VALID [2022-04-08 10:06:37,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {67864#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67864#true} is VALID [2022-04-08 10:06:37,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {67864#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67864#true} is VALID [2022-04-08 10:06:37,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {67864#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67864#true} is VALID [2022-04-08 10:06:37,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {67864#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67864#true} is VALID [2022-04-08 10:06:37,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {67864#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67864#true} is VALID [2022-04-08 10:06:37,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {67864#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67864#true} is VALID [2022-04-08 10:06:37,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {67864#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67864#true} is VALID [2022-04-08 10:06:37,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {67864#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67864#true} is VALID [2022-04-08 10:06:37,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {67864#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67864#true} is VALID [2022-04-08 10:06:37,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {67864#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67864#true} is VALID [2022-04-08 10:06:37,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {67864#true} call #t~ret11 := main(); {67864#true} is VALID [2022-04-08 10:06:37,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67864#true} {67864#true} #61#return; {67864#true} is VALID [2022-04-08 10:06:37,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {67864#true} assume true; {67864#true} is VALID [2022-04-08 10:06:37,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {67864#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67864#true} is VALID [2022-04-08 10:06:37,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {67864#true} call ULTIMATE.init(); {67864#true} is VALID [2022-04-08 10:06:37,581 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:06:37,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286977338] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:37,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:37,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 49 [2022-04-08 10:06:37,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:37,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1245422994] [2022-04-08 10:06:37,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1245422994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:37,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:37,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:06:37,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368909421] [2022-04-08 10:06:37,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:37,582 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:06:37,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:37,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:37,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:37,609 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:06:37,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:37,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:06:37,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2057, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 10:06:37,610 INFO L87 Difference]: Start difference. First operand 154 states and 199 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:39,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:39,294 INFO L93 Difference]: Finished difference Result 181 states and 226 transitions. [2022-04-08 10:06:39,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 10:06:39,294 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:06:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2022-04-08 10:06:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2022-04-08 10:06:39,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 58 transitions. [2022-04-08 10:06:39,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:39,342 INFO L225 Difference]: With dead ends: 181 [2022-04-08 10:06:39,342 INFO L226 Difference]: Without dead ends: 166 [2022-04-08 10:06:39,342 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=497, Invalid=4059, Unknown=0, NotChecked=0, Total=4556 [2022-04-08 10:06:39,343 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:39,343 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 73 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:06:39,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-08 10:06:39,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 155. [2022-04-08 10:06:39,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:39,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 155 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 150 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:39,810 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 155 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 150 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:39,810 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 155 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 150 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:39,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:39,812 INFO L93 Difference]: Finished difference Result 166 states and 211 transitions. [2022-04-08 10:06:39,812 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 211 transitions. [2022-04-08 10:06:39,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:39,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:39,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 150 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 166 states. [2022-04-08 10:06:39,813 INFO L87 Difference]: Start difference. First operand has 155 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 150 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 166 states. [2022-04-08 10:06:39,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:39,814 INFO L93 Difference]: Finished difference Result 166 states and 211 transitions. [2022-04-08 10:06:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 211 transitions. [2022-04-08 10:06:39,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:39,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:39,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:39,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:39,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 150 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 200 transitions. [2022-04-08 10:06:39,816 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 200 transitions. Word has length 40 [2022-04-08 10:06:39,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:39,816 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 200 transitions. [2022-04-08 10:06:39,816 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:39,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 200 transitions. [2022-04-08 10:06:40,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 200 transitions. [2022-04-08 10:06:40,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:06:40,201 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:40,201 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:40,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2022-04-08 10:06:40,403 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:40,403 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:40,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:40,404 INFO L85 PathProgramCache]: Analyzing trace with hash -44794227, now seen corresponding path program 145 times [2022-04-08 10:06:40,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:40,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [674895057] [2022-04-08 10:06:40,406 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:40,406 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:40,406 INFO L85 PathProgramCache]: Analyzing trace with hash -44794227, now seen corresponding path program 146 times [2022-04-08 10:06:40,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:40,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007267821] [2022-04-08 10:06:40,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:40,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:40,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:40,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {69220#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {69197#true} is VALID [2022-04-08 10:06:40,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {69197#true} assume true; {69197#true} is VALID [2022-04-08 10:06:40,715 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69197#true} {69197#true} #61#return; {69197#true} is VALID [2022-04-08 10:06:40,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {69197#true} call ULTIMATE.init(); {69220#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:40,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {69220#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {69197#true} is VALID [2022-04-08 10:06:40,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {69197#true} assume true; {69197#true} is VALID [2022-04-08 10:06:40,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69197#true} {69197#true} #61#return; {69197#true} is VALID [2022-04-08 10:06:40,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {69197#true} call #t~ret11 := main(); {69197#true} is VALID [2022-04-08 10:06:40,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {69197#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69202#(= main_~y~0 0)} is VALID [2022-04-08 10:06:40,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {69202#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69203#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:40,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {69203#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69204#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:40,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {69204#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69205#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:40,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {69205#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69206#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:40,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {69206#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69207#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:40,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {69207#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69208#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:40,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {69208#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69209#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:40,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {69209#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69210#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:40,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {69210#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69211#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:40,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {69211#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69212#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:40,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {69212#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {69212#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:40,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {69212#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {69213#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:06:40,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {69213#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69214#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:06:40,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {69214#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69215#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:06:40,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {69215#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69216#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:06:40,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {69216#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69217#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:06:40,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {69217#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69218#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:06:40,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {69218#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69219#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:40,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {69219#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {69198#false} is VALID [2022-04-08 10:06:40,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:40,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:40,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:40,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:40,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:40,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:40,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:40,726 INFO L290 TraceCheckUtils]: 32: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:40,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:40,726 INFO L290 TraceCheckUtils]: 34: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:40,726 INFO L290 TraceCheckUtils]: 35: Hoare triple {69198#false} assume !(~y~0 % 4294967296 > 0); {69198#false} is VALID [2022-04-08 10:06:40,726 INFO L272 TraceCheckUtils]: 36: Hoare triple {69198#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {69198#false} is VALID [2022-04-08 10:06:40,726 INFO L290 TraceCheckUtils]: 37: Hoare triple {69198#false} ~cond := #in~cond; {69198#false} is VALID [2022-04-08 10:06:40,726 INFO L290 TraceCheckUtils]: 38: Hoare triple {69198#false} assume 0 == ~cond; {69198#false} is VALID [2022-04-08 10:06:40,726 INFO L290 TraceCheckUtils]: 39: Hoare triple {69198#false} assume !false; {69198#false} is VALID [2022-04-08 10:06:40,726 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:06:40,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:40,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007267821] [2022-04-08 10:06:40,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007267821] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:40,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043779168] [2022-04-08 10:06:40,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:40,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:40,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:40,728 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:06:40,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-04-08 10:06:40,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:40,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:40,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 10:06:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:40,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:41,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {69197#true} call ULTIMATE.init(); {69197#true} is VALID [2022-04-08 10:06:41,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {69197#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {69197#true} is VALID [2022-04-08 10:06:41,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {69197#true} assume true; {69197#true} is VALID [2022-04-08 10:06:41,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69197#true} {69197#true} #61#return; {69197#true} is VALID [2022-04-08 10:06:41,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {69197#true} call #t~ret11 := main(); {69197#true} is VALID [2022-04-08 10:06:41,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {69197#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69202#(= main_~y~0 0)} is VALID [2022-04-08 10:06:41,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {69202#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69203#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:41,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {69203#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69204#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:41,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {69204#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69205#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:41,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {69205#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69206#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:41,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {69206#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69207#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:41,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {69207#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69208#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:41,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {69208#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69209#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:41,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {69209#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69210#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:41,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {69210#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69211#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:41,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {69211#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69212#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:41,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {69212#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {69212#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:41,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {69212#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {69213#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:06:41,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {69213#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69214#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:06:41,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {69214#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69215#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:06:41,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {69215#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69216#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:06:41,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {69216#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69217#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:06:41,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {69217#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69218#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:06:41,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {69218#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69293#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:06:41,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {69293#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {69198#false} is VALID [2022-04-08 10:06:41,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:41,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:41,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:41,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:41,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:41,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:41,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:41,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:41,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:41,153 INFO L290 TraceCheckUtils]: 34: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:41,153 INFO L290 TraceCheckUtils]: 35: Hoare triple {69198#false} assume !(~y~0 % 4294967296 > 0); {69198#false} is VALID [2022-04-08 10:06:41,153 INFO L272 TraceCheckUtils]: 36: Hoare triple {69198#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {69198#false} is VALID [2022-04-08 10:06:41,153 INFO L290 TraceCheckUtils]: 37: Hoare triple {69198#false} ~cond := #in~cond; {69198#false} is VALID [2022-04-08 10:06:41,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {69198#false} assume 0 == ~cond; {69198#false} is VALID [2022-04-08 10:06:41,153 INFO L290 TraceCheckUtils]: 39: Hoare triple {69198#false} assume !false; {69198#false} is VALID [2022-04-08 10:06:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:06:41,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:41,702 INFO L290 TraceCheckUtils]: 39: Hoare triple {69198#false} assume !false; {69198#false} is VALID [2022-04-08 10:06:41,702 INFO L290 TraceCheckUtils]: 38: Hoare triple {69198#false} assume 0 == ~cond; {69198#false} is VALID [2022-04-08 10:06:41,702 INFO L290 TraceCheckUtils]: 37: Hoare triple {69198#false} ~cond := #in~cond; {69198#false} is VALID [2022-04-08 10:06:41,702 INFO L272 TraceCheckUtils]: 36: Hoare triple {69198#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {69198#false} is VALID [2022-04-08 10:06:41,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {69198#false} assume !(~y~0 % 4294967296 > 0); {69198#false} is VALID [2022-04-08 10:06:41,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:41,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:41,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:41,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:41,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:41,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:41,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:41,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:41,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:41,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-08 10:06:41,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {69387#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {69198#false} is VALID [2022-04-08 10:06:41,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {69391#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69387#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:41,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {69395#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69391#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:41,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {69399#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69395#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:41,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {69403#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69399#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:41,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {69407#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69403#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:06:41,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {69411#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69407#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:06:41,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {69415#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {69411#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:06:41,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {69415#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {69415#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:41,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {69422#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69415#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:41,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {69426#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69422#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:41,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {69430#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69426#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:41,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {69434#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69430#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:41,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {69438#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69434#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:41,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {69442#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69438#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:41,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {69446#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69442#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:41,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {69450#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69446#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:41,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {69454#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69450#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:41,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {69458#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69454#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:41,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {69197#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69458#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:41,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {69197#true} call #t~ret11 := main(); {69197#true} is VALID [2022-04-08 10:06:41,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69197#true} {69197#true} #61#return; {69197#true} is VALID [2022-04-08 10:06:41,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {69197#true} assume true; {69197#true} is VALID [2022-04-08 10:06:41,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {69197#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {69197#true} is VALID [2022-04-08 10:06:41,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {69197#true} call ULTIMATE.init(); {69197#true} is VALID [2022-04-08 10:06:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:06:41,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043779168] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:41,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:41,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-08 10:06:41,715 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:41,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [674895057] [2022-04-08 10:06:41,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [674895057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:41,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:41,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:06:41,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432476548] [2022-04-08 10:06:41,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:41,716 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:06:41,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:41,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:41,737 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-08 10:06:41,737 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:06:41,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:41,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:06:41,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1312, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:06:41,738 INFO L87 Difference]: Start difference. First operand 155 states and 200 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:43,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:43,842 INFO L93 Difference]: Finished difference Result 184 states and 229 transitions. [2022-04-08 10:06:43,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 10:06:43,842 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:06:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 68 transitions. [2022-04-08 10:06:43,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 68 transitions. [2022-04-08 10:06:43,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 68 transitions. [2022-04-08 10:06:43,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:43,897 INFO L225 Difference]: With dead ends: 184 [2022-04-08 10:06:43,897 INFO L226 Difference]: Without dead ends: 168 [2022-04-08 10:06:43,898 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=730, Invalid=3302, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 10:06:43,898 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:43,898 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 105 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:06:43,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-04-08 10:06:44,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 156. [2022-04-08 10:06:44,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:44,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:44,385 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:44,385 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:44,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:44,386 INFO L93 Difference]: Finished difference Result 168 states and 213 transitions. [2022-04-08 10:06:44,386 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2022-04-08 10:06:44,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:44,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:44,387 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 168 states. [2022-04-08 10:06:44,387 INFO L87 Difference]: Start difference. First operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 168 states. [2022-04-08 10:06:44,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:44,388 INFO L93 Difference]: Finished difference Result 168 states and 213 transitions. [2022-04-08 10:06:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2022-04-08 10:06:44,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:44,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:44,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:44,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:44,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:44,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 201 transitions. [2022-04-08 10:06:44,390 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 201 transitions. Word has length 40 [2022-04-08 10:06:44,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:44,390 INFO L478 AbstractCegarLoop]: Abstraction has 156 states and 201 transitions. [2022-04-08 10:06:44,390 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:44,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 156 states and 201 transitions. [2022-04-08 10:06:44,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 201 transitions. [2022-04-08 10:06:44,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:06:44,781 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:44,781 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:44,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-04-08 10:06:44,981 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2022-04-08 10:06:44,981 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:44,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:44,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1351548287, now seen corresponding path program 147 times [2022-04-08 10:06:44,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:44,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [159819395] [2022-04-08 10:06:44,983 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:44,984 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:44,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1351548287, now seen corresponding path program 148 times [2022-04-08 10:06:44,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:44,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567723906] [2022-04-08 10:06:44,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:44,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:45,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:45,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {70565#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {70543#true} is VALID [2022-04-08 10:06:45,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {70543#true} assume true; {70543#true} is VALID [2022-04-08 10:06:45,243 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70543#true} {70543#true} #61#return; {70543#true} is VALID [2022-04-08 10:06:45,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {70543#true} call ULTIMATE.init(); {70565#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:45,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {70565#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {70543#true} is VALID [2022-04-08 10:06:45,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {70543#true} assume true; {70543#true} is VALID [2022-04-08 10:06:45,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70543#true} {70543#true} #61#return; {70543#true} is VALID [2022-04-08 10:06:45,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {70543#true} call #t~ret11 := main(); {70543#true} is VALID [2022-04-08 10:06:45,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {70543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70548#(= main_~y~0 0)} is VALID [2022-04-08 10:06:45,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {70548#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70549#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:45,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {70549#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70550#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:45,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {70550#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70551#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:45,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {70551#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70552#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:45,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {70552#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70553#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:45,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {70553#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70554#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:45,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {70554#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70555#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:45,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {70555#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70556#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:45,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {70556#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70557#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:45,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {70557#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70558#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:45,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {70558#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70559#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:45,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {70559#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {70559#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:45,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {70559#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {70560#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:06:45,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {70560#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70561#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:06:45,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {70561#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70562#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:06:45,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {70562#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70563#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:06:45,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {70563#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70564#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:45,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {70564#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {70544#false} is VALID [2022-04-08 10:06:45,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,253 INFO L290 TraceCheckUtils]: 32: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,253 INFO L290 TraceCheckUtils]: 33: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,253 INFO L290 TraceCheckUtils]: 35: Hoare triple {70544#false} assume !(~y~0 % 4294967296 > 0); {70544#false} is VALID [2022-04-08 10:06:45,253 INFO L272 TraceCheckUtils]: 36: Hoare triple {70544#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {70544#false} is VALID [2022-04-08 10:06:45,253 INFO L290 TraceCheckUtils]: 37: Hoare triple {70544#false} ~cond := #in~cond; {70544#false} is VALID [2022-04-08 10:06:45,254 INFO L290 TraceCheckUtils]: 38: Hoare triple {70544#false} assume 0 == ~cond; {70544#false} is VALID [2022-04-08 10:06:45,254 INFO L290 TraceCheckUtils]: 39: Hoare triple {70544#false} assume !false; {70544#false} is VALID [2022-04-08 10:06:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:06:45,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:45,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567723906] [2022-04-08 10:06:45,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567723906] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:45,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433815834] [2022-04-08 10:06:45,254 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:06:45,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:45,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:45,255 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:06:45,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-04-08 10:06:45,300 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:06:45,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:45,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 10:06:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:45,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:45,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {70543#true} call ULTIMATE.init(); {70543#true} is VALID [2022-04-08 10:06:45,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {70543#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {70543#true} is VALID [2022-04-08 10:06:45,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {70543#true} assume true; {70543#true} is VALID [2022-04-08 10:06:45,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70543#true} {70543#true} #61#return; {70543#true} is VALID [2022-04-08 10:06:45,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {70543#true} call #t~ret11 := main(); {70543#true} is VALID [2022-04-08 10:06:45,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {70543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70548#(= main_~y~0 0)} is VALID [2022-04-08 10:06:45,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {70548#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70549#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:45,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {70549#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70550#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:45,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {70550#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70551#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:45,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {70551#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70552#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:45,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {70552#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70553#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:45,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {70553#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70554#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:45,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {70554#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70555#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:45,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {70555#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70556#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:45,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {70556#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70557#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:45,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {70557#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70558#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:45,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {70558#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70559#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:45,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {70559#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {70559#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:45,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {70559#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {70560#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:06:45,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {70560#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70561#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:06:45,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {70561#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70562#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:06:45,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {70562#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70563#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:06:45,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {70563#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70635#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:06:45,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {70635#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {70544#false} is VALID [2022-04-08 10:06:45,619 INFO L290 TraceCheckUtils]: 24: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:45,620 INFO L290 TraceCheckUtils]: 35: Hoare triple {70544#false} assume !(~y~0 % 4294967296 > 0); {70544#false} is VALID [2022-04-08 10:06:45,620 INFO L272 TraceCheckUtils]: 36: Hoare triple {70544#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {70544#false} is VALID [2022-04-08 10:06:45,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {70544#false} ~cond := #in~cond; {70544#false} is VALID [2022-04-08 10:06:45,620 INFO L290 TraceCheckUtils]: 38: Hoare triple {70544#false} assume 0 == ~cond; {70544#false} is VALID [2022-04-08 10:06:45,620 INFO L290 TraceCheckUtils]: 39: Hoare triple {70544#false} assume !false; {70544#false} is VALID [2022-04-08 10:06:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:06:45,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:46,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {70544#false} assume !false; {70544#false} is VALID [2022-04-08 10:06:46,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {70544#false} assume 0 == ~cond; {70544#false} is VALID [2022-04-08 10:06:46,135 INFO L290 TraceCheckUtils]: 37: Hoare triple {70544#false} ~cond := #in~cond; {70544#false} is VALID [2022-04-08 10:06:46,135 INFO L272 TraceCheckUtils]: 36: Hoare triple {70544#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {70544#false} is VALID [2022-04-08 10:06:46,135 INFO L290 TraceCheckUtils]: 35: Hoare triple {70544#false} assume !(~y~0 % 4294967296 > 0); {70544#false} is VALID [2022-04-08 10:06:46,135 INFO L290 TraceCheckUtils]: 34: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:46,135 INFO L290 TraceCheckUtils]: 33: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:46,135 INFO L290 TraceCheckUtils]: 32: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:46,135 INFO L290 TraceCheckUtils]: 31: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:46,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:46,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:46,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:46,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:46,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:46,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:46,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-08 10:06:46,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {70735#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {70544#false} is VALID [2022-04-08 10:06:46,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {70739#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70735#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:46,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {70743#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70739#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:46,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {70747#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70743#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:46,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {70751#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70747#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:46,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {70755#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {70751#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:06:46,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {70755#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {70755#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:46,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {70762#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70755#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:46,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {70766#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70762#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:46,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {70770#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70766#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:46,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {70774#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70770#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:46,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {70778#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70774#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:46,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {70782#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70778#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:46,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {70786#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70782#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:46,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {70790#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70786#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:46,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {70794#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70790#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:46,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {70798#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70794#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:46,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {70802#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70798#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:06:46,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {70543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70802#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:46,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {70543#true} call #t~ret11 := main(); {70543#true} is VALID [2022-04-08 10:06:46,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70543#true} {70543#true} #61#return; {70543#true} is VALID [2022-04-08 10:06:46,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {70543#true} assume true; {70543#true} is VALID [2022-04-08 10:06:46,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {70543#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {70543#true} is VALID [2022-04-08 10:06:46,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {70543#true} call ULTIMATE.init(); {70543#true} is VALID [2022-04-08 10:06:46,156 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:06:46,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433815834] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:46,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:46,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-08 10:06:46,157 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:46,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [159819395] [2022-04-08 10:06:46,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [159819395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:46,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:46,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:06:46,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194986086] [2022-04-08 10:06:46,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:46,157 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:06:46,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:46,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:46,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:46,179 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:06:46,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:46,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:06:46,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1159, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:06:46,180 INFO L87 Difference]: Start difference. First operand 156 states and 201 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:48,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:48,330 INFO L93 Difference]: Finished difference Result 187 states and 232 transitions. [2022-04-08 10:06:48,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 10:06:48,330 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:06:48,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 73 transitions. [2022-04-08 10:06:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 73 transitions. [2022-04-08 10:06:48,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 73 transitions. [2022-04-08 10:06:48,398 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-08 10:06:48,400 INFO L225 Difference]: With dead ends: 187 [2022-04-08 10:06:48,400 INFO L226 Difference]: Without dead ends: 170 [2022-04-08 10:06:48,401 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=728, Invalid=3054, Unknown=0, NotChecked=0, Total=3782 [2022-04-08 10:06:48,401 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:48,401 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 107 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:06:48,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-04-08 10:06:48,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2022-04-08 10:06:48,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:48,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 157 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 152 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:48,939 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 157 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 152 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:48,939 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 157 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 152 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:48,941 INFO L93 Difference]: Finished difference Result 170 states and 215 transitions. [2022-04-08 10:06:48,941 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 215 transitions. [2022-04-08 10:06:48,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:48,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:48,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 152 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 170 states. [2022-04-08 10:06:48,941 INFO L87 Difference]: Start difference. First operand has 157 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 152 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 170 states. [2022-04-08 10:06:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:48,943 INFO L93 Difference]: Finished difference Result 170 states and 215 transitions. [2022-04-08 10:06:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 215 transitions. [2022-04-08 10:06:48,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:48,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:48,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:48,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:48,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 152 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:48,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 202 transitions. [2022-04-08 10:06:48,945 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 202 transitions. Word has length 40 [2022-04-08 10:06:48,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:48,945 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 202 transitions. [2022-04-08 10:06:48,945 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:48,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 202 transitions. [2022-04-08 10:06:49,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:49,339 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 202 transitions. [2022-04-08 10:06:49,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:06:49,339 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:49,339 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:49,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2022-04-08 10:06:49,539 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2022-04-08 10:06:49,540 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:49,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:49,540 INFO L85 PathProgramCache]: Analyzing trace with hash -605310835, now seen corresponding path program 149 times [2022-04-08 10:06:49,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:49,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1739957062] [2022-04-08 10:06:49,542 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:49,542 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:49,542 INFO L85 PathProgramCache]: Analyzing trace with hash -605310835, now seen corresponding path program 150 times [2022-04-08 10:06:49,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:49,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718831354] [2022-04-08 10:06:49,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:49,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:49,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:49,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {71920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {71899#true} is VALID [2022-04-08 10:06:49,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {71899#true} assume true; {71899#true} is VALID [2022-04-08 10:06:49,785 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {71899#true} {71899#true} #61#return; {71899#true} is VALID [2022-04-08 10:06:49,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {71899#true} call ULTIMATE.init(); {71920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:49,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {71920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {71899#true} is VALID [2022-04-08 10:06:49,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {71899#true} assume true; {71899#true} is VALID [2022-04-08 10:06:49,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71899#true} {71899#true} #61#return; {71899#true} is VALID [2022-04-08 10:06:49,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {71899#true} call #t~ret11 := main(); {71899#true} is VALID [2022-04-08 10:06:49,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {71899#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {71904#(= main_~y~0 0)} is VALID [2022-04-08 10:06:49,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {71904#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71905#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:49,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {71905#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71906#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:49,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {71906#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:49,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {71907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71908#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:49,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {71908#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71909#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:49,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {71909#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71910#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:49,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {71910#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71911#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:49,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {71911#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71912#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:49,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {71912#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71913#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:49,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {71913#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71914#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:49,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {71914#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71915#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:49,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {71915#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71916#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:49,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {71916#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {71916#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:49,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {71916#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {71917#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:06:49,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {71917#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71918#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:06:49,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {71918#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71919#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:49,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {71919#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {71900#false} is VALID [2022-04-08 10:06:49,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:49,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:49,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:49,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:49,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:49,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:49,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:49,795 INFO L290 TraceCheckUtils]: 30: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:49,795 INFO L290 TraceCheckUtils]: 31: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:49,795 INFO L290 TraceCheckUtils]: 32: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:49,795 INFO L290 TraceCheckUtils]: 33: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:49,795 INFO L290 TraceCheckUtils]: 34: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:49,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {71900#false} assume !(~y~0 % 4294967296 > 0); {71900#false} is VALID [2022-04-08 10:06:49,795 INFO L272 TraceCheckUtils]: 36: Hoare triple {71900#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {71900#false} is VALID [2022-04-08 10:06:49,795 INFO L290 TraceCheckUtils]: 37: Hoare triple {71900#false} ~cond := #in~cond; {71900#false} is VALID [2022-04-08 10:06:49,796 INFO L290 TraceCheckUtils]: 38: Hoare triple {71900#false} assume 0 == ~cond; {71900#false} is VALID [2022-04-08 10:06:49,796 INFO L290 TraceCheckUtils]: 39: Hoare triple {71900#false} assume !false; {71900#false} is VALID [2022-04-08 10:06:49,796 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:06:49,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:49,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718831354] [2022-04-08 10:06:49,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718831354] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:49,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434313456] [2022-04-08 10:06:49,796 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:06:49,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:49,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:49,797 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:06:49,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-04-08 10:06:50,013 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:06:50,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:50,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:06:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:50,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:50,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {71899#true} call ULTIMATE.init(); {71899#true} is VALID [2022-04-08 10:06:50,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {71899#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {71899#true} is VALID [2022-04-08 10:06:50,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {71899#true} assume true; {71899#true} is VALID [2022-04-08 10:06:50,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71899#true} {71899#true} #61#return; {71899#true} is VALID [2022-04-08 10:06:50,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {71899#true} call #t~ret11 := main(); {71899#true} is VALID [2022-04-08 10:06:50,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {71899#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {71904#(= main_~y~0 0)} is VALID [2022-04-08 10:06:50,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {71904#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71905#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:50,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {71905#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71906#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:50,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {71906#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:50,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {71907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71908#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:50,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {71908#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71909#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:50,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {71909#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71910#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:50,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {71910#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71911#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:50,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {71911#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71912#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:50,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {71912#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71913#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:50,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {71913#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71914#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:50,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {71914#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71915#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:50,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {71915#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71916#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:50,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {71916#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {71916#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:50,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {71916#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {71917#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:06:50,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {71917#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71918#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:06:50,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {71918#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71987#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:06:50,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {71987#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {71900#false} is VALID [2022-04-08 10:06:50,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {71900#false} assume !(~y~0 % 4294967296 > 0); {71900#false} is VALID [2022-04-08 10:06:50,327 INFO L272 TraceCheckUtils]: 36: Hoare triple {71900#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {71900#false} is VALID [2022-04-08 10:06:50,327 INFO L290 TraceCheckUtils]: 37: Hoare triple {71900#false} ~cond := #in~cond; {71900#false} is VALID [2022-04-08 10:06:50,327 INFO L290 TraceCheckUtils]: 38: Hoare triple {71900#false} assume 0 == ~cond; {71900#false} is VALID [2022-04-08 10:06:50,327 INFO L290 TraceCheckUtils]: 39: Hoare triple {71900#false} assume !false; {71900#false} is VALID [2022-04-08 10:06:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:06:50,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:50,788 INFO L290 TraceCheckUtils]: 39: Hoare triple {71900#false} assume !false; {71900#false} is VALID [2022-04-08 10:06:50,789 INFO L290 TraceCheckUtils]: 38: Hoare triple {71900#false} assume 0 == ~cond; {71900#false} is VALID [2022-04-08 10:06:50,789 INFO L290 TraceCheckUtils]: 37: Hoare triple {71900#false} ~cond := #in~cond; {71900#false} is VALID [2022-04-08 10:06:50,789 INFO L272 TraceCheckUtils]: 36: Hoare triple {71900#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {71900#false} is VALID [2022-04-08 10:06:50,789 INFO L290 TraceCheckUtils]: 35: Hoare triple {71900#false} assume !(~y~0 % 4294967296 > 0); {71900#false} is VALID [2022-04-08 10:06:50,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,789 INFO L290 TraceCheckUtils]: 30: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,789 INFO L290 TraceCheckUtils]: 27: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-08 10:06:50,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {72093#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {71900#false} is VALID [2022-04-08 10:06:50,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {72097#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72093#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:50,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {72101#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72097#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:50,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {72105#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {72101#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:50,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {72105#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {72105#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:50,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {72112#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72105#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:50,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {72116#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72112#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:50,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {72120#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72116#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:50,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {72124#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72120#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:50,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {72128#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72124#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:50,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {72132#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72128#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:50,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {72136#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72132#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:50,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {72140#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72136#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:50,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {72144#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72140#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:06:50,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {72148#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72144#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:50,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {72152#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72148#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:06:50,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {72156#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72152#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:06:50,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {71899#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72156#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:06:50,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {71899#true} call #t~ret11 := main(); {71899#true} is VALID [2022-04-08 10:06:50,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71899#true} {71899#true} #61#return; {71899#true} is VALID [2022-04-08 10:06:50,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {71899#true} assume true; {71899#true} is VALID [2022-04-08 10:06:50,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {71899#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {71899#true} is VALID [2022-04-08 10:06:50,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {71899#true} call ULTIMATE.init(); {71899#true} is VALID [2022-04-08 10:06:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:06:50,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434313456] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:50,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:50,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 10:06:50,800 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:50,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1739957062] [2022-04-08 10:06:50,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1739957062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:50,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:50,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:06:50,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769856209] [2022-04-08 10:06:50,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:50,801 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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 40 [2022-04-08 10:06:50,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:50,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:06:50,820 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-08 10:06:50,820 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:06:50,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:50,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:06:50,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:06:50,821 INFO L87 Difference]: Start difference. First operand 157 states and 202 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:06:52,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:52,781 INFO L93 Difference]: Finished difference Result 190 states and 235 transitions. [2022-04-08 10:06:52,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 10:06:52,781 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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 40 [2022-04-08 10:06:52,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:52,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:06:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 73 transitions. [2022-04-08 10:06:52,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:06:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 73 transitions. [2022-04-08 10:06:52,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 73 transitions. [2022-04-08 10:06:52,839 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-08 10:06:52,840 INFO L225 Difference]: With dead ends: 190 [2022-04-08 10:06:52,840 INFO L226 Difference]: Without dead ends: 172 [2022-04-08 10:06:52,841 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=606, Invalid=2364, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 10:06:52,841 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:52,841 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 103 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:06:52,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-08 10:06:53,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 158. [2022-04-08 10:06:53,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:53,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 158 states, 153 states have (on average 1.3006535947712419) internal successors, (199), 153 states have internal predecessors, (199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:53,345 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 158 states, 153 states have (on average 1.3006535947712419) internal successors, (199), 153 states have internal predecessors, (199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:53,345 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 158 states, 153 states have (on average 1.3006535947712419) internal successors, (199), 153 states have internal predecessors, (199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:53,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:53,347 INFO L93 Difference]: Finished difference Result 172 states and 217 transitions. [2022-04-08 10:06:53,347 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 217 transitions. [2022-04-08 10:06:53,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:53,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:53,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 153 states have (on average 1.3006535947712419) internal successors, (199), 153 states have internal predecessors, (199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 172 states. [2022-04-08 10:06:53,347 INFO L87 Difference]: Start difference. First operand has 158 states, 153 states have (on average 1.3006535947712419) internal successors, (199), 153 states have internal predecessors, (199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 172 states. [2022-04-08 10:06:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:53,350 INFO L93 Difference]: Finished difference Result 172 states and 217 transitions. [2022-04-08 10:06:53,350 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 217 transitions. [2022-04-08 10:06:53,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:53,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:53,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:53,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.3006535947712419) internal successors, (199), 153 states have internal predecessors, (199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:53,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 203 transitions. [2022-04-08 10:06:53,352 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 203 transitions. Word has length 40 [2022-04-08 10:06:53,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:53,353 INFO L478 AbstractCegarLoop]: Abstraction has 158 states and 203 transitions. [2022-04-08 10:06:53,353 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-08 10:06:53,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 158 states and 203 transitions. [2022-04-08 10:06:53,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:53,753 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 203 transitions. [2022-04-08 10:06:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:06:53,753 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:53,753 INFO L499 BasicCegarLoop]: trace histogram [23, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:53,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2022-04-08 10:06:53,953 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:53,954 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:53,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:53,954 INFO L85 PathProgramCache]: Analyzing trace with hash -785244818, now seen corresponding path program 151 times [2022-04-08 10:06:53,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:53,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1076715905] [2022-04-08 10:06:53,956 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:53,956 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:53,956 INFO L85 PathProgramCache]: Analyzing trace with hash -785244818, now seen corresponding path program 152 times [2022-04-08 10:06:53,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:53,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671187944] [2022-04-08 10:06:53,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:53,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:54,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:54,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {73286#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73255#true} is VALID [2022-04-08 10:06:54,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {73255#true} assume true; {73255#true} is VALID [2022-04-08 10:06:54,418 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73255#true} {73255#true} #61#return; {73255#true} is VALID [2022-04-08 10:06:54,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {73255#true} call ULTIMATE.init(); {73286#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:54,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {73286#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73255#true} is VALID [2022-04-08 10:06:54,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {73255#true} assume true; {73255#true} is VALID [2022-04-08 10:06:54,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73255#true} {73255#true} #61#return; {73255#true} is VALID [2022-04-08 10:06:54,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {73255#true} call #t~ret11 := main(); {73255#true} is VALID [2022-04-08 10:06:54,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {73255#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73260#(= main_~y~0 0)} is VALID [2022-04-08 10:06:54,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {73260#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73261#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:54,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {73261#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73262#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:54,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {73262#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73263#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:54,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {73263#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73264#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:54,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {73264#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73265#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:54,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {73265#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73266#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:54,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {73266#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73267#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:54,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {73267#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73268#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:54,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {73268#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73269#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:54,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {73269#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73270#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:54,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {73270#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73271#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:54,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {73271#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73272#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:54,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {73272#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73273#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:06:54,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {73273#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73274#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:06:54,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {73274#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73275#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:06:54,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {73275#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73276#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:06:54,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {73276#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73277#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:06:54,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {73277#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73278#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:06:54,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {73278#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73279#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:06:54,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {73279#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73280#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:06:54,430 INFO L290 TraceCheckUtils]: 26: Hoare triple {73280#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73281#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:06:54,430 INFO L290 TraceCheckUtils]: 27: Hoare triple {73281#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73282#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:06:54,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {73282#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73283#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:06:54,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {73283#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {73283#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:06:54,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {73283#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {73284#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-08 10:06:54,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {73284#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73285#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:54,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {73285#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {73256#false} is VALID [2022-04-08 10:06:54,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {73256#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {73256#false} is VALID [2022-04-08 10:06:54,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {73256#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {73256#false} is VALID [2022-04-08 10:06:54,433 INFO L290 TraceCheckUtils]: 35: Hoare triple {73256#false} assume !(~y~0 % 4294967296 > 0); {73256#false} is VALID [2022-04-08 10:06:54,433 INFO L272 TraceCheckUtils]: 36: Hoare triple {73256#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {73256#false} is VALID [2022-04-08 10:06:54,433 INFO L290 TraceCheckUtils]: 37: Hoare triple {73256#false} ~cond := #in~cond; {73256#false} is VALID [2022-04-08 10:06:54,433 INFO L290 TraceCheckUtils]: 38: Hoare triple {73256#false} assume 0 == ~cond; {73256#false} is VALID [2022-04-08 10:06:54,433 INFO L290 TraceCheckUtils]: 39: Hoare triple {73256#false} assume !false; {73256#false} is VALID [2022-04-08 10:06:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:06:54,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:54,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671187944] [2022-04-08 10:06:54,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671187944] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:54,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097129559] [2022-04-08 10:06:54,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:54,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:54,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:54,434 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:06:54,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-04-08 10:06:54,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:54,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:54,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-08 10:06:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:54,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:54,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {73255#true} call ULTIMATE.init(); {73255#true} is VALID [2022-04-08 10:06:54,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {73255#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73255#true} is VALID [2022-04-08 10:06:54,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {73255#true} assume true; {73255#true} is VALID [2022-04-08 10:06:54,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73255#true} {73255#true} #61#return; {73255#true} is VALID [2022-04-08 10:06:54,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {73255#true} call #t~ret11 := main(); {73255#true} is VALID [2022-04-08 10:06:54,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {73255#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73260#(= main_~y~0 0)} is VALID [2022-04-08 10:06:54,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {73260#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73261#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:54,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {73261#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73262#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:54,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {73262#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73263#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:54,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {73263#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73264#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:54,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {73264#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73265#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:54,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {73265#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73266#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:54,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {73266#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73267#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:54,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {73267#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73268#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:54,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {73268#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73269#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:54,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {73269#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73270#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:54,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {73270#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73271#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:54,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {73271#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73272#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:54,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {73272#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73273#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:06:54,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {73273#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73274#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:06:54,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {73274#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73275#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:06:54,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {73275#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73276#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:06:54,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {73276#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73277#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:06:54,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {73277#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73278#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:06:54,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {73278#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73279#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:06:54,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {73279#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73280#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:06:54,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {73280#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73281#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:06:54,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {73281#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73282#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:06:54,880 INFO L290 TraceCheckUtils]: 28: Hoare triple {73282#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73283#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:06:54,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {73283#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {73283#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:06:54,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {73283#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {73284#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-08 10:06:54,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {73284#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73383#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-08 10:06:54,881 INFO L290 TraceCheckUtils]: 32: Hoare triple {73383#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~z~0 % 4294967296 > 0); {73256#false} is VALID [2022-04-08 10:06:54,882 INFO L290 TraceCheckUtils]: 33: Hoare triple {73256#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {73256#false} is VALID [2022-04-08 10:06:54,882 INFO L290 TraceCheckUtils]: 34: Hoare triple {73256#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {73256#false} is VALID [2022-04-08 10:06:54,882 INFO L290 TraceCheckUtils]: 35: Hoare triple {73256#false} assume !(~y~0 % 4294967296 > 0); {73256#false} is VALID [2022-04-08 10:06:54,882 INFO L272 TraceCheckUtils]: 36: Hoare triple {73256#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {73256#false} is VALID [2022-04-08 10:06:54,882 INFO L290 TraceCheckUtils]: 37: Hoare triple {73256#false} ~cond := #in~cond; {73256#false} is VALID [2022-04-08 10:06:54,882 INFO L290 TraceCheckUtils]: 38: Hoare triple {73256#false} assume 0 == ~cond; {73256#false} is VALID [2022-04-08 10:06:54,882 INFO L290 TraceCheckUtils]: 39: Hoare triple {73256#false} assume !false; {73256#false} is VALID [2022-04-08 10:06:54,882 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:06:54,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:55,930 INFO L290 TraceCheckUtils]: 39: Hoare triple {73256#false} assume !false; {73256#false} is VALID [2022-04-08 10:06:55,930 INFO L290 TraceCheckUtils]: 38: Hoare triple {73256#false} assume 0 == ~cond; {73256#false} is VALID [2022-04-08 10:06:55,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {73256#false} ~cond := #in~cond; {73256#false} is VALID [2022-04-08 10:06:55,930 INFO L272 TraceCheckUtils]: 36: Hoare triple {73256#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {73256#false} is VALID [2022-04-08 10:06:55,930 INFO L290 TraceCheckUtils]: 35: Hoare triple {73256#false} assume !(~y~0 % 4294967296 > 0); {73256#false} is VALID [2022-04-08 10:06:55,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {73256#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {73256#false} is VALID [2022-04-08 10:06:55,931 INFO L290 TraceCheckUtils]: 33: Hoare triple {73256#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {73256#false} is VALID [2022-04-08 10:06:55,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {73429#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {73256#false} is VALID [2022-04-08 10:06:55,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {73433#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73429#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:55,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {73437#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {73433#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:55,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {73437#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {73437#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:55,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {73444#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73437#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:55,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {73448#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73444#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:55,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {73452#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73448#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:55,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {73456#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73452#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:55,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {73460#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73456#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:55,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {73464#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73460#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:55,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {73468#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73464#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:55,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {73472#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73468#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:06:55,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {73476#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73472#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:55,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {73480#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73476#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:06:55,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {73484#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73480#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:06:55,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {73488#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73484#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:06:55,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {73492#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73488#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:06:55,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {73496#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73492#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:06:55,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {73500#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73496#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:06:55,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {73504#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73500#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:06:55,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {73508#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73504#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:06:55,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {73512#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73508#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:06:55,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {73516#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73512#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:06:55,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {73520#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73516#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:06:55,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {73524#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73520#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:55,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {73528#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73524#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:06:55,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {73532#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73528#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:06:55,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {73255#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73532#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-08 10:06:55,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {73255#true} call #t~ret11 := main(); {73255#true} is VALID [2022-04-08 10:06:55,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73255#true} {73255#true} #61#return; {73255#true} is VALID [2022-04-08 10:06:55,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {73255#true} assume true; {73255#true} is VALID [2022-04-08 10:06:55,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {73255#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73255#true} is VALID [2022-04-08 10:06:55,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {73255#true} call ULTIMATE.init(); {73255#true} is VALID [2022-04-08 10:06:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:06:55,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097129559] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:55,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:55,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-08 10:06:55,953 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:55,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1076715905] [2022-04-08 10:06:55,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1076715905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:55,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:55,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-08 10:06:55,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754347691] [2022-04-08 10:06:55,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:55,954 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:06:55,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:55,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:55,983 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-08 10:06:55,983 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-08 10:06:55,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:55,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-08 10:06:55,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=691, Invalid=2389, Unknown=0, NotChecked=0, Total=3080 [2022-04-08 10:06:55,984 INFO L87 Difference]: Start difference. First operand 158 states and 203 transitions. Second operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:01,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:01,046 INFO L93 Difference]: Finished difference Result 245 states and 351 transitions. [2022-04-08 10:07:01,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-08 10:07:01,047 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:07:01,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 159 transitions. [2022-04-08 10:07:01,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 159 transitions. [2022-04-08 10:07:01,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 159 transitions. [2022-04-08 10:07:01,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:01,177 INFO L225 Difference]: With dead ends: 245 [2022-04-08 10:07:01,177 INFO L226 Difference]: Without dead ends: 237 [2022-04-08 10:07:01,178 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1459, Invalid=5347, Unknown=0, NotChecked=0, Total=6806 [2022-04-08 10:07:01,178 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 131 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2894 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 2997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 2894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:01,178 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 185 Invalid, 2997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 2894 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 10:07:01,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-08 10:07:01,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 164. [2022-04-08 10:07:01,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:01,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 164 states, 159 states have (on average 1.3018867924528301) internal successors, (207), 159 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:01,696 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 164 states, 159 states have (on average 1.3018867924528301) internal successors, (207), 159 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:01,696 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 164 states, 159 states have (on average 1.3018867924528301) internal successors, (207), 159 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:01,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:01,698 INFO L93 Difference]: Finished difference Result 237 states and 291 transitions. [2022-04-08 10:07:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 291 transitions. [2022-04-08 10:07:01,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:01,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:01,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 159 states have (on average 1.3018867924528301) internal successors, (207), 159 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 237 states. [2022-04-08 10:07:01,699 INFO L87 Difference]: Start difference. First operand has 164 states, 159 states have (on average 1.3018867924528301) internal successors, (207), 159 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 237 states. [2022-04-08 10:07:01,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:01,701 INFO L93 Difference]: Finished difference Result 237 states and 291 transitions. [2022-04-08 10:07:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 291 transitions. [2022-04-08 10:07:01,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:01,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:01,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:01,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 159 states have (on average 1.3018867924528301) internal successors, (207), 159 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:01,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 211 transitions. [2022-04-08 10:07:01,703 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 211 transitions. Word has length 40 [2022-04-08 10:07:01,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:01,703 INFO L478 AbstractCegarLoop]: Abstraction has 164 states and 211 transitions. [2022-04-08 10:07:01,704 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:01,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 211 transitions. [2022-04-08 10:07:02,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:02,119 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 211 transitions. [2022-04-08 10:07:02,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 10:07:02,119 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:02,119 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:02,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0 [2022-04-08 10:07:02,319 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:02,320 INFO L403 AbstractCegarLoop]: === Iteration 82 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:02,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:02,320 INFO L85 PathProgramCache]: Analyzing trace with hash 11643199, now seen corresponding path program 153 times [2022-04-08 10:07:02,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:02,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [548510548] [2022-04-08 10:07:02,322 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:02,322 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:02,322 INFO L85 PathProgramCache]: Analyzing trace with hash 11643199, now seen corresponding path program 154 times [2022-04-08 10:07:02,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:02,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603691187] [2022-04-08 10:07:02,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:02,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:02,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:02,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {74916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {74899#true} is VALID [2022-04-08 10:07:02,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {74899#true} assume true; {74899#true} is VALID [2022-04-08 10:07:02,529 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74899#true} {74899#true} #61#return; {74899#true} is VALID [2022-04-08 10:07:02,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {74899#true} call ULTIMATE.init(); {74916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:02,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {74916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {74899#true} is VALID [2022-04-08 10:07:02,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {74899#true} assume true; {74899#true} is VALID [2022-04-08 10:07:02,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74899#true} {74899#true} #61#return; {74899#true} is VALID [2022-04-08 10:07:02,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {74899#true} call #t~ret11 := main(); {74899#true} is VALID [2022-04-08 10:07:02,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {74899#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {74899#true} is VALID [2022-04-08 10:07:02,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:02,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:02,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:02,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:02,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:02,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:02,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:02,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:02,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:02,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {74899#true} assume !(~x~0 % 4294967296 > 0); {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:02,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:02,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74905#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:02,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {74905#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74906#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {74906#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74907#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {74907#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74908#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {74908#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74909#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:02,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {74909#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74910#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {74910#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:07:02,538 INFO L290 TraceCheckUtils]: 26: Hoare triple {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:07:02,538 INFO L290 TraceCheckUtils]: 27: Hoare triple {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,539 INFO L290 TraceCheckUtils]: 28: Hoare triple {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74910#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {74910#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74909#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:02,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {74909#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74908#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {74908#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74907#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {74907#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74906#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,543 INFO L290 TraceCheckUtils]: 34: Hoare triple {74906#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74905#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:02,544 INFO L290 TraceCheckUtils]: 35: Hoare triple {74905#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:02,544 INFO L290 TraceCheckUtils]: 36: Hoare triple {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:02,545 INFO L272 TraceCheckUtils]: 37: Hoare triple {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {74914#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:07:02,545 INFO L290 TraceCheckUtils]: 38: Hoare triple {74914#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {74915#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:07:02,545 INFO L290 TraceCheckUtils]: 39: Hoare triple {74915#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {74900#false} is VALID [2022-04-08 10:07:02,545 INFO L290 TraceCheckUtils]: 40: Hoare triple {74900#false} assume !false; {74900#false} is VALID [2022-04-08 10:07:02,546 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:07:02,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:02,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603691187] [2022-04-08 10:07:02,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603691187] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:02,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612467538] [2022-04-08 10:07:02,546 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:02,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:02,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:02,548 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:02,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-04-08 10:07:02,603 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:02,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:02,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 10:07:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:02,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:02,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {74899#true} call ULTIMATE.init(); {74899#true} is VALID [2022-04-08 10:07:02,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {74899#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {74899#true} is VALID [2022-04-08 10:07:02,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {74899#true} assume true; {74899#true} is VALID [2022-04-08 10:07:02,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74899#true} {74899#true} #61#return; {74899#true} is VALID [2022-04-08 10:07:02,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {74899#true} call #t~ret11 := main(); {74899#true} is VALID [2022-04-08 10:07:02,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {74899#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {74899#true} is VALID [2022-04-08 10:07:02,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:02,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:02,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:02,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:02,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:02,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:02,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:02,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:02,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:02,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {74899#true} assume !(~x~0 % 4294967296 > 0); {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:02,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:02,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74905#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:02,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {74905#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74906#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {74906#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74907#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {74907#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74908#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {74908#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74909#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:02,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {74909#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74910#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,885 INFO L290 TraceCheckUtils]: 23: Hoare triple {74910#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:07:02,887 INFO L290 TraceCheckUtils]: 26: Hoare triple {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:07:02,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74910#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {74910#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74909#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:02,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {74909#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74908#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {74908#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74907#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {74907#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74906#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:02,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {74906#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74905#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:02,893 INFO L290 TraceCheckUtils]: 35: Hoare triple {74905#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:02,893 INFO L290 TraceCheckUtils]: 36: Hoare triple {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:02,894 INFO L272 TraceCheckUtils]: 37: Hoare triple {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {75031#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:07:02,894 INFO L290 TraceCheckUtils]: 38: Hoare triple {75031#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {75035#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:07:02,895 INFO L290 TraceCheckUtils]: 39: Hoare triple {75035#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {74900#false} is VALID [2022-04-08 10:07:02,895 INFO L290 TraceCheckUtils]: 40: Hoare triple {74900#false} assume !false; {74900#false} is VALID [2022-04-08 10:07:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:07:02,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:03,185 INFO L290 TraceCheckUtils]: 40: Hoare triple {74900#false} assume !false; {74900#false} is VALID [2022-04-08 10:07:03,185 INFO L290 TraceCheckUtils]: 39: Hoare triple {75035#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {74900#false} is VALID [2022-04-08 10:07:03,185 INFO L290 TraceCheckUtils]: 38: Hoare triple {75031#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {75035#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:07:03,186 INFO L272 TraceCheckUtils]: 37: Hoare triple {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {75031#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:07:03,186 INFO L290 TraceCheckUtils]: 36: Hoare triple {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:03,187 INFO L290 TraceCheckUtils]: 35: Hoare triple {74905#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:03,188 INFO L290 TraceCheckUtils]: 34: Hoare triple {74906#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74905#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:03,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {74907#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74906#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:03,189 INFO L290 TraceCheckUtils]: 32: Hoare triple {74908#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74907#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:03,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {74909#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74908#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:03,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {74910#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74909#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:03,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74910#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:03,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:03,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:03,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:07:03,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:07:03,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:03,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {74910#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:03,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {74909#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74910#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:03,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {74908#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74909#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:03,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {74907#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74908#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:03,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {74906#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74907#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:03,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {74905#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74906#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:03,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74905#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:03,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:03,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {74899#true} assume !(~x~0 % 4294967296 > 0); {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:03,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:03,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:03,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:03,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:03,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:03,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:03,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:03,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:03,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {74899#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74899#true} is VALID [2022-04-08 10:07:03,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {74899#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {74899#true} is VALID [2022-04-08 10:07:03,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {74899#true} call #t~ret11 := main(); {74899#true} is VALID [2022-04-08 10:07:03,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74899#true} {74899#true} #61#return; {74899#true} is VALID [2022-04-08 10:07:03,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {74899#true} assume true; {74899#true} is VALID [2022-04-08 10:07:03,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {74899#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {74899#true} is VALID [2022-04-08 10:07:03,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {74899#true} call ULTIMATE.init(); {74899#true} is VALID [2022-04-08 10:07:03,201 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:07:03,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612467538] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:03,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:03,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 17 [2022-04-08 10:07:03,201 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:03,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [548510548] [2022-04-08 10:07:03,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [548510548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:03,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:03,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:07:03,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566543609] [2022-04-08 10:07:03,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:03,202 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) 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 41 [2022-04-08 10:07:03,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:03,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.9333333333333333) 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-08 10:07:03,230 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-08 10:07:03,230 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:07:03,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:03,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:07:03,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2022-04-08 10:07:03,230 INFO L87 Difference]: Start difference. First operand 164 states and 211 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) 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-08 10:07:06,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:06,902 INFO L93 Difference]: Finished difference Result 485 states and 645 transitions. [2022-04-08 10:07:06,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:07:06,902 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) 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 41 [2022-04-08 10:07:06,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:06,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) 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-08 10:07:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 67 transitions. [2022-04-08 10:07:06,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) 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-08 10:07:06,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 67 transitions. [2022-04-08 10:07:06,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 67 transitions. [2022-04-08 10:07:06,963 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-08 10:07:06,972 INFO L225 Difference]: With dead ends: 485 [2022-04-08 10:07:06,972 INFO L226 Difference]: Without dead ends: 470 [2022-04-08 10:07:06,973 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2022-04-08 10:07:06,973 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 38 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:06,973 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 100 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:07:06,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-04-08 10:07:07,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 168. [2022-04-08 10:07:07,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:07,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 470 states. Second operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:07,508 INFO L74 IsIncluded]: Start isIncluded. First operand 470 states. Second operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:07,508 INFO L87 Difference]: Start difference. First operand 470 states. Second operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:07,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:07,516 INFO L93 Difference]: Finished difference Result 470 states and 629 transitions. [2022-04-08 10:07:07,516 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 629 transitions. [2022-04-08 10:07:07,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:07,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:07,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 470 states. [2022-04-08 10:07:07,517 INFO L87 Difference]: Start difference. First operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 470 states. [2022-04-08 10:07:07,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:07,525 INFO L93 Difference]: Finished difference Result 470 states and 629 transitions. [2022-04-08 10:07:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 629 transitions. [2022-04-08 10:07:07,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:07,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:07,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:07,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 217 transitions. [2022-04-08 10:07:07,527 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 217 transitions. Word has length 41 [2022-04-08 10:07:07,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:07,527 INFO L478 AbstractCegarLoop]: Abstraction has 168 states and 217 transitions. [2022-04-08 10:07:07,527 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) 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-08 10:07:07,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 168 states and 217 transitions. [2022-04-08 10:07:07,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:07,997 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 217 transitions. [2022-04-08 10:07:07,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 10:07:07,997 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:07,997 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:08,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:08,198 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2022-04-08 10:07:08,198 INFO L403 AbstractCegarLoop]: === Iteration 83 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:08,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:08,198 INFO L85 PathProgramCache]: Analyzing trace with hash -600496849, now seen corresponding path program 155 times [2022-04-08 10:07:08,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:08,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [18049902] [2022-04-08 10:07:08,204 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:08,204 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:08,204 INFO L85 PathProgramCache]: Analyzing trace with hash -600496849, now seen corresponding path program 156 times [2022-04-08 10:07:08,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:08,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292928674] [2022-04-08 10:07:08,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:08,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:08,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:08,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {77458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {77434#true} is VALID [2022-04-08 10:07:08,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {77434#true} assume true; {77434#true} is VALID [2022-04-08 10:07:08,500 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77434#true} {77434#true} #61#return; {77434#true} is VALID [2022-04-08 10:07:08,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {77434#true} call ULTIMATE.init(); {77458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:08,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {77458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {77434#true} is VALID [2022-04-08 10:07:08,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {77434#true} assume true; {77434#true} is VALID [2022-04-08 10:07:08,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77434#true} {77434#true} #61#return; {77434#true} is VALID [2022-04-08 10:07:08,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {77434#true} call #t~ret11 := main(); {77434#true} is VALID [2022-04-08 10:07:08,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {77434#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {77439#(= main_~y~0 0)} is VALID [2022-04-08 10:07:08,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {77439#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77440#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:08,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {77440#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77441#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:08,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {77441#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77442#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:08,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {77442#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77443#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:08,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {77443#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77444#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:08,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {77444#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77445#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:08,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {77445#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77446#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:08,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {77446#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77447#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:08,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {77447#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77448#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:08,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {77448#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:08,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {77449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {77449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:08,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {77449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {77450#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:08,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {77450#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77451#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:08,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {77451#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77452#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:08,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {77452#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77453#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:08,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {77453#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77454#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:08,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {77454#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77455#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:07:08,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {77455#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77456#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:08,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {77456#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77457#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:08,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {77457#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {77435#false} is VALID [2022-04-08 10:07:08,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:08,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:08,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:08,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:08,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:08,511 INFO L290 TraceCheckUtils]: 31: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:08,511 INFO L290 TraceCheckUtils]: 32: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:08,511 INFO L290 TraceCheckUtils]: 33: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:08,511 INFO L290 TraceCheckUtils]: 34: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:08,511 INFO L290 TraceCheckUtils]: 35: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:08,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {77435#false} assume !(~y~0 % 4294967296 > 0); {77435#false} is VALID [2022-04-08 10:07:08,511 INFO L272 TraceCheckUtils]: 37: Hoare triple {77435#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {77435#false} is VALID [2022-04-08 10:07:08,511 INFO L290 TraceCheckUtils]: 38: Hoare triple {77435#false} ~cond := #in~cond; {77435#false} is VALID [2022-04-08 10:07:08,511 INFO L290 TraceCheckUtils]: 39: Hoare triple {77435#false} assume 0 == ~cond; {77435#false} is VALID [2022-04-08 10:07:08,511 INFO L290 TraceCheckUtils]: 40: Hoare triple {77435#false} assume !false; {77435#false} is VALID [2022-04-08 10:07:08,512 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:07:08,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:08,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292928674] [2022-04-08 10:07:08,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292928674] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:08,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129286475] [2022-04-08 10:07:08,512 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:08,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:08,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:08,513 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:08,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-04-08 10:07:08,653 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:07:08,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:08,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-08 10:07:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:08,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:09,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {77434#true} call ULTIMATE.init(); {77434#true} is VALID [2022-04-08 10:07:09,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {77434#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {77434#true} is VALID [2022-04-08 10:07:09,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {77434#true} assume true; {77434#true} is VALID [2022-04-08 10:07:09,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77434#true} {77434#true} #61#return; {77434#true} is VALID [2022-04-08 10:07:09,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {77434#true} call #t~ret11 := main(); {77434#true} is VALID [2022-04-08 10:07:09,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {77434#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {77439#(= main_~y~0 0)} is VALID [2022-04-08 10:07:09,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {77439#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77440#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:09,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {77440#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77441#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:09,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {77441#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77442#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:09,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {77442#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77443#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:09,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {77443#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77444#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:09,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {77444#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77445#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:09,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {77445#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77446#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:09,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {77446#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77447#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:09,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {77447#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77448#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:09,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {77448#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:09,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {77449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {77449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:09,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {77449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {77513#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:09,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {77513#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77517#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:07:09,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {77517#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77521#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:09,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {77521#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77525#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-08 10:07:09,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {77525#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77529#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:09,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {77529#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77533#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} is VALID [2022-04-08 10:07:09,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {77533#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77537#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:09,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {77537#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77541#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))))} is VALID [2022-04-08 10:07:09,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {77541#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))))} assume !(~z~0 % 4294967296 > 0); {77435#false} is VALID [2022-04-08 10:07:09,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:09,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:09,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:09,051 INFO L290 TraceCheckUtils]: 29: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:09,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:09,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:09,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:09,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:09,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:09,052 INFO L290 TraceCheckUtils]: 35: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:09,052 INFO L290 TraceCheckUtils]: 36: Hoare triple {77435#false} assume !(~y~0 % 4294967296 > 0); {77435#false} is VALID [2022-04-08 10:07:09,052 INFO L272 TraceCheckUtils]: 37: Hoare triple {77435#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {77435#false} is VALID [2022-04-08 10:07:09,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {77435#false} ~cond := #in~cond; {77435#false} is VALID [2022-04-08 10:07:09,052 INFO L290 TraceCheckUtils]: 39: Hoare triple {77435#false} assume 0 == ~cond; {77435#false} is VALID [2022-04-08 10:07:09,052 INFO L290 TraceCheckUtils]: 40: Hoare triple {77435#false} assume !false; {77435#false} is VALID [2022-04-08 10:07:09,052 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:07:09,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:09,638 INFO L290 TraceCheckUtils]: 40: Hoare triple {77435#false} assume !false; {77435#false} is VALID [2022-04-08 10:07:09,639 INFO L290 TraceCheckUtils]: 39: Hoare triple {77435#false} assume 0 == ~cond; {77435#false} is VALID [2022-04-08 10:07:09,639 INFO L290 TraceCheckUtils]: 38: Hoare triple {77435#false} ~cond := #in~cond; {77435#false} is VALID [2022-04-08 10:07:09,639 INFO L272 TraceCheckUtils]: 37: Hoare triple {77435#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {77435#false} is VALID [2022-04-08 10:07:09,639 INFO L290 TraceCheckUtils]: 36: Hoare triple {77435#false} assume !(~y~0 % 4294967296 > 0); {77435#false} is VALID [2022-04-08 10:07:09,639 INFO L290 TraceCheckUtils]: 35: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:09,639 INFO L290 TraceCheckUtils]: 34: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:09,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {77611#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-08 10:07:09,640 INFO L290 TraceCheckUtils]: 32: Hoare triple {77615#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77611#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:07:09,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {77619#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77615#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:07:09,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {77623#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77619#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:07:09,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {77627#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77623#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:07:09,643 INFO L290 TraceCheckUtils]: 28: Hoare triple {77631#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77627#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:07:09,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {77635#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77631#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:07:09,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {77639#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77635#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:07:09,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {77643#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {77639#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:07:09,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {77647#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77643#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:07:09,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {77651#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77647#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:07:09,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {77655#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77651#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:07:09,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {77659#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77655#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:07:09,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {77663#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77659#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:07:09,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {77667#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77663#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:07:09,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {77671#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77667#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:07:09,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {77434#true} ~z~0 := ~y~0; {77671#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:07:09,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {77434#true} assume !(~x~0 % 4294967296 > 0); {77434#true} is VALID [2022-04-08 10:07:09,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {77434#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77434#true} is VALID [2022-04-08 10:07:09,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {77434#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77434#true} is VALID [2022-04-08 10:07:09,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {77434#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77434#true} is VALID [2022-04-08 10:07:09,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {77434#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77434#true} is VALID [2022-04-08 10:07:09,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {77434#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77434#true} is VALID [2022-04-08 10:07:09,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {77434#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77434#true} is VALID [2022-04-08 10:07:09,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {77434#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77434#true} is VALID [2022-04-08 10:07:09,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {77434#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77434#true} is VALID [2022-04-08 10:07:09,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {77434#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77434#true} is VALID [2022-04-08 10:07:09,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {77434#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77434#true} is VALID [2022-04-08 10:07:09,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {77434#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {77434#true} is VALID [2022-04-08 10:07:09,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {77434#true} call #t~ret11 := main(); {77434#true} is VALID [2022-04-08 10:07:09,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77434#true} {77434#true} #61#return; {77434#true} is VALID [2022-04-08 10:07:09,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {77434#true} assume true; {77434#true} is VALID [2022-04-08 10:07:09,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {77434#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {77434#true} is VALID [2022-04-08 10:07:09,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {77434#true} call ULTIMATE.init(); {77434#true} is VALID [2022-04-08 10:07:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-08 10:07:09,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129286475] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:09,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:09,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 18] total 46 [2022-04-08 10:07:09,653 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:09,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [18049902] [2022-04-08 10:07:09,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [18049902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:09,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:09,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:07:09,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572523035] [2022-04-08 10:07:09,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:09,653 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 10:07:09,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:09,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:09,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:09,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:07:09,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:09,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:07:09,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1813, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:07:09,675 INFO L87 Difference]: Start difference. First operand 168 states and 217 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:11,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:11,988 INFO L93 Difference]: Finished difference Result 197 states and 246 transitions. [2022-04-08 10:07:11,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 10:07:11,988 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 10:07:11,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:11,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 70 transitions. [2022-04-08 10:07:11,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:11,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 70 transitions. [2022-04-08 10:07:11,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 70 transitions. [2022-04-08 10:07:12,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:12,045 INFO L225 Difference]: With dead ends: 197 [2022-04-08 10:07:12,045 INFO L226 Difference]: Without dead ends: 181 [2022-04-08 10:07:12,046 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=542, Invalid=4570, Unknown=0, NotChecked=0, Total=5112 [2022-04-08 10:07:12,047 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:12,047 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 95 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:07:12,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-04-08 10:07:12,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 169. [2022-04-08 10:07:12,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:12,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:12,599 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:12,599 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:12,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:12,601 INFO L93 Difference]: Finished difference Result 181 states and 230 transitions. [2022-04-08 10:07:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 230 transitions. [2022-04-08 10:07:12,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:12,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:12,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 181 states. [2022-04-08 10:07:12,601 INFO L87 Difference]: Start difference. First operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 181 states. [2022-04-08 10:07:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:12,603 INFO L93 Difference]: Finished difference Result 181 states and 230 transitions. [2022-04-08 10:07:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 230 transitions. [2022-04-08 10:07:12,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:12,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:12,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:12,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 218 transitions. [2022-04-08 10:07:12,605 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 218 transitions. Word has length 41 [2022-04-08 10:07:12,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:12,605 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 218 transitions. [2022-04-08 10:07:12,605 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:12,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 218 transitions. [2022-04-08 10:07:13,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:13,075 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 218 transitions. [2022-04-08 10:07:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 10:07:13,075 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:13,075 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:13,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Ended with exit code 0 [2022-04-08 10:07:13,276 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:13,276 INFO L403 AbstractCegarLoop]: === Iteration 84 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:13,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:13,276 INFO L85 PathProgramCache]: Analyzing trace with hash 870484735, now seen corresponding path program 157 times [2022-04-08 10:07:13,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:13,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [391590726] [2022-04-08 10:07:13,278 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:13,278 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:13,278 INFO L85 PathProgramCache]: Analyzing trace with hash 870484735, now seen corresponding path program 158 times [2022-04-08 10:07:13,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:13,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785611025] [2022-04-08 10:07:13,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:13,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:13,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:13,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {78897#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {78874#true} is VALID [2022-04-08 10:07:13,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {78874#true} assume true; {78874#true} is VALID [2022-04-08 10:07:13,560 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78874#true} {78874#true} #61#return; {78874#true} is VALID [2022-04-08 10:07:13,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {78874#true} call ULTIMATE.init(); {78897#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:13,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {78897#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {78874#true} is VALID [2022-04-08 10:07:13,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {78874#true} assume true; {78874#true} is VALID [2022-04-08 10:07:13,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78874#true} {78874#true} #61#return; {78874#true} is VALID [2022-04-08 10:07:13,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {78874#true} call #t~ret11 := main(); {78874#true} is VALID [2022-04-08 10:07:13,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {78874#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78879#(= main_~y~0 0)} is VALID [2022-04-08 10:07:13,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {78879#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78880#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:13,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {78880#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78881#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:13,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {78881#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78882#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:13,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {78882#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78883#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:13,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {78883#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78884#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:13,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {78884#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78885#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:13,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {78885#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78886#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:13,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {78886#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78887#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:13,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {78887#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78888#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:13,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {78888#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78889#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:13,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {78889#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:13,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {78890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {78890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:13,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {78890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {78891#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:13,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {78891#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78892#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:13,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {78892#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78893#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:13,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {78893#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78894#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:13,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {78894#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78895#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:13,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {78895#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78896#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:13,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {78896#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {78875#false} is VALID [2022-04-08 10:07:13,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,570 INFO L290 TraceCheckUtils]: 27: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,570 INFO L290 TraceCheckUtils]: 28: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,571 INFO L290 TraceCheckUtils]: 30: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,571 INFO L290 TraceCheckUtils]: 34: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,571 INFO L290 TraceCheckUtils]: 35: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,571 INFO L290 TraceCheckUtils]: 36: Hoare triple {78875#false} assume !(~y~0 % 4294967296 > 0); {78875#false} is VALID [2022-04-08 10:07:13,571 INFO L272 TraceCheckUtils]: 37: Hoare triple {78875#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {78875#false} is VALID [2022-04-08 10:07:13,571 INFO L290 TraceCheckUtils]: 38: Hoare triple {78875#false} ~cond := #in~cond; {78875#false} is VALID [2022-04-08 10:07:13,571 INFO L290 TraceCheckUtils]: 39: Hoare triple {78875#false} assume 0 == ~cond; {78875#false} is VALID [2022-04-08 10:07:13,571 INFO L290 TraceCheckUtils]: 40: Hoare triple {78875#false} assume !false; {78875#false} is VALID [2022-04-08 10:07:13,571 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:07:13,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:13,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785611025] [2022-04-08 10:07:13,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785611025] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:13,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293719876] [2022-04-08 10:07:13,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:13,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:13,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:13,572 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:13,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-04-08 10:07:13,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:13,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:13,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 10:07:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:13,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:13,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {78874#true} call ULTIMATE.init(); {78874#true} is VALID [2022-04-08 10:07:13,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {78874#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {78874#true} is VALID [2022-04-08 10:07:13,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {78874#true} assume true; {78874#true} is VALID [2022-04-08 10:07:13,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78874#true} {78874#true} #61#return; {78874#true} is VALID [2022-04-08 10:07:13,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {78874#true} call #t~ret11 := main(); {78874#true} is VALID [2022-04-08 10:07:13,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {78874#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78879#(= main_~y~0 0)} is VALID [2022-04-08 10:07:13,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {78879#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78880#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:13,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {78880#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78881#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:13,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {78881#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78882#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:13,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {78882#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78883#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:13,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {78883#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78884#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:13,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {78884#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78885#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:13,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {78885#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78886#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:13,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {78886#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78887#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:13,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {78887#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78888#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:13,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {78888#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78889#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:13,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {78889#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:13,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {78890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {78890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:13,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {78890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {78891#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:13,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {78891#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78892#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:13,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {78892#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78893#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:13,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {78893#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78894#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:13,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {78894#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78895#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:13,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {78895#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78970#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:13,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {78970#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {78875#false} is VALID [2022-04-08 10:07:13,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,928 INFO L290 TraceCheckUtils]: 28: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:13,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {78875#false} assume !(~y~0 % 4294967296 > 0); {78875#false} is VALID [2022-04-08 10:07:13,929 INFO L272 TraceCheckUtils]: 37: Hoare triple {78875#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {78875#false} is VALID [2022-04-08 10:07:13,929 INFO L290 TraceCheckUtils]: 38: Hoare triple {78875#false} ~cond := #in~cond; {78875#false} is VALID [2022-04-08 10:07:13,929 INFO L290 TraceCheckUtils]: 39: Hoare triple {78875#false} assume 0 == ~cond; {78875#false} is VALID [2022-04-08 10:07:13,929 INFO L290 TraceCheckUtils]: 40: Hoare triple {78875#false} assume !false; {78875#false} is VALID [2022-04-08 10:07:13,929 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:07:13,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:14,473 INFO L290 TraceCheckUtils]: 40: Hoare triple {78875#false} assume !false; {78875#false} is VALID [2022-04-08 10:07:14,473 INFO L290 TraceCheckUtils]: 39: Hoare triple {78875#false} assume 0 == ~cond; {78875#false} is VALID [2022-04-08 10:07:14,473 INFO L290 TraceCheckUtils]: 38: Hoare triple {78875#false} ~cond := #in~cond; {78875#false} is VALID [2022-04-08 10:07:14,473 INFO L272 TraceCheckUtils]: 37: Hoare triple {78875#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {78875#false} is VALID [2022-04-08 10:07:14,473 INFO L290 TraceCheckUtils]: 36: Hoare triple {78875#false} assume !(~y~0 % 4294967296 > 0); {78875#false} is VALID [2022-04-08 10:07:14,473 INFO L290 TraceCheckUtils]: 35: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:14,473 INFO L290 TraceCheckUtils]: 34: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:14,473 INFO L290 TraceCheckUtils]: 33: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:14,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:14,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:14,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:14,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:14,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:14,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:14,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:14,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-08 10:07:14,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {79070#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {78875#false} is VALID [2022-04-08 10:07:14,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {79074#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79070#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:14,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {79078#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79074#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:14,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {79082#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79078#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:14,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {79086#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79082#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:14,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {79090#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79086#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:14,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {79094#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {79090#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:14,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {79094#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {79094#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:14,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {79101#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79094#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:14,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {79105#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79101#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:14,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {79109#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79105#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:14,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {79113#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79109#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:14,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {79117#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79113#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:14,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {79121#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79117#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:14,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {79125#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79121#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:14,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {79129#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79125#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:14,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {79133#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79129#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:14,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {79137#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79133#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:14,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {79141#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79137#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:14,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {78874#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {79141#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:14,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {78874#true} call #t~ret11 := main(); {78874#true} is VALID [2022-04-08 10:07:14,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78874#true} {78874#true} #61#return; {78874#true} is VALID [2022-04-08 10:07:14,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {78874#true} assume true; {78874#true} is VALID [2022-04-08 10:07:14,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {78874#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {78874#true} is VALID [2022-04-08 10:07:14,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {78874#true} call ULTIMATE.init(); {78874#true} is VALID [2022-04-08 10:07:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:07:14,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293719876] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:14,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:14,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-08 10:07:14,486 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:14,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [391590726] [2022-04-08 10:07:14,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [391590726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:14,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:14,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:07:14,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669588072] [2022-04-08 10:07:14,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:14,486 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 10:07:14,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:14,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:14,506 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-08 10:07:14,506 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:07:14,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:14,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:07:14,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:07:14,507 INFO L87 Difference]: Start difference. First operand 169 states and 218 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:16,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:16,929 INFO L93 Difference]: Finished difference Result 200 states and 249 transitions. [2022-04-08 10:07:16,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-08 10:07:16,930 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 10:07:16,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 76 transitions. [2022-04-08 10:07:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 76 transitions. [2022-04-08 10:07:16,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 76 transitions. [2022-04-08 10:07:16,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:16,992 INFO L225 Difference]: With dead ends: 200 [2022-04-08 10:07:16,992 INFO L226 Difference]: Without dead ends: 183 [2022-04-08 10:07:16,993 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=833, Invalid=3589, Unknown=0, NotChecked=0, Total=4422 [2022-04-08 10:07:16,993 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:16,993 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 112 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:07:16,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-04-08 10:07:17,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2022-04-08 10:07:17,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:17,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 170 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:17,542 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 170 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:17,542 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 170 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:17,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:17,543 INFO L93 Difference]: Finished difference Result 183 states and 232 transitions. [2022-04-08 10:07:17,543 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 232 transitions. [2022-04-08 10:07:17,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:17,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:17,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 183 states. [2022-04-08 10:07:17,544 INFO L87 Difference]: Start difference. First operand has 170 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 183 states. [2022-04-08 10:07:17,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:17,546 INFO L93 Difference]: Finished difference Result 183 states and 232 transitions. [2022-04-08 10:07:17,546 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 232 transitions. [2022-04-08 10:07:17,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:17,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:17,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:17,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:17,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 219 transitions. [2022-04-08 10:07:17,548 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 219 transitions. Word has length 41 [2022-04-08 10:07:17,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:17,548 INFO L478 AbstractCegarLoop]: Abstraction has 170 states and 219 transitions. [2022-04-08 10:07:17,548 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:17,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 170 states and 219 transitions. [2022-04-08 10:07:18,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:18,026 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 219 transitions. [2022-04-08 10:07:18,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 10:07:18,026 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:18,026 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:18,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Ended with exit code 0 [2022-04-08 10:07:18,227 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:18,227 INFO L403 AbstractCegarLoop]: === Iteration 85 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:18,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:18,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1132790639, now seen corresponding path program 159 times [2022-04-08 10:07:18,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:18,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [170065016] [2022-04-08 10:07:18,229 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:18,229 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:18,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1132790639, now seen corresponding path program 160 times [2022-04-08 10:07:18,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:18,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410964104] [2022-04-08 10:07:18,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:18,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:18,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:18,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {80344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80322#true} is VALID [2022-04-08 10:07:18,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {80322#true} assume true; {80322#true} is VALID [2022-04-08 10:07:18,504 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80322#true} {80322#true} #61#return; {80322#true} is VALID [2022-04-08 10:07:18,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {80322#true} call ULTIMATE.init(); {80344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:18,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {80344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80322#true} is VALID [2022-04-08 10:07:18,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {80322#true} assume true; {80322#true} is VALID [2022-04-08 10:07:18,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80322#true} {80322#true} #61#return; {80322#true} is VALID [2022-04-08 10:07:18,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {80322#true} call #t~ret11 := main(); {80322#true} is VALID [2022-04-08 10:07:18,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {80322#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80327#(= main_~y~0 0)} is VALID [2022-04-08 10:07:18,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {80327#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:18,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {80328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:18,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {80329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:18,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {80330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:18,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {80331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:18,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {80332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:18,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {80333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:18,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {80334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:18,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {80335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:18,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {80336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80337#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:18,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {80337#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80338#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:18,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {80338#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:18,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {80339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {80339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:18,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {80339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {80340#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:07:18,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {80340#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80341#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:18,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {80341#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80342#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:18,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {80342#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80343#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:18,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {80343#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {80323#false} is VALID [2022-04-08 10:07:18,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,514 INFO L290 TraceCheckUtils]: 28: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,514 INFO L290 TraceCheckUtils]: 29: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,514 INFO L290 TraceCheckUtils]: 30: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,514 INFO L290 TraceCheckUtils]: 31: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,514 INFO L290 TraceCheckUtils]: 33: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,514 INFO L290 TraceCheckUtils]: 35: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {80323#false} assume !(~y~0 % 4294967296 > 0); {80323#false} is VALID [2022-04-08 10:07:18,514 INFO L272 TraceCheckUtils]: 37: Hoare triple {80323#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {80323#false} is VALID [2022-04-08 10:07:18,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {80323#false} ~cond := #in~cond; {80323#false} is VALID [2022-04-08 10:07:18,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {80323#false} assume 0 == ~cond; {80323#false} is VALID [2022-04-08 10:07:18,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {80323#false} assume !false; {80323#false} is VALID [2022-04-08 10:07:18,515 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:07:18,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:18,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410964104] [2022-04-08 10:07:18,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410964104] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:18,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643584351] [2022-04-08 10:07:18,515 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:18,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:18,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:18,516 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:18,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-04-08 10:07:18,584 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:18,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:18,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 10:07:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:18,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:18,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {80322#true} call ULTIMATE.init(); {80322#true} is VALID [2022-04-08 10:07:18,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {80322#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80322#true} is VALID [2022-04-08 10:07:18,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {80322#true} assume true; {80322#true} is VALID [2022-04-08 10:07:18,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80322#true} {80322#true} #61#return; {80322#true} is VALID [2022-04-08 10:07:18,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {80322#true} call #t~ret11 := main(); {80322#true} is VALID [2022-04-08 10:07:18,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {80322#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80327#(= main_~y~0 0)} is VALID [2022-04-08 10:07:18,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {80327#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:18,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {80328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:18,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {80329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:18,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {80330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:18,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {80331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:18,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {80332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:18,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {80333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:18,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {80334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:18,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {80335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:18,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {80336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80337#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:18,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {80337#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80338#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:18,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {80338#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:18,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {80339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {80339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:18,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {80339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {80340#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:07:18,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {80340#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80341#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:18,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {80341#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80342#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:18,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {80342#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80414#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:18,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {80414#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {80323#false} is VALID [2022-04-08 10:07:18,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,891 INFO L290 TraceCheckUtils]: 34: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,891 INFO L290 TraceCheckUtils]: 35: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:18,891 INFO L290 TraceCheckUtils]: 36: Hoare triple {80323#false} assume !(~y~0 % 4294967296 > 0); {80323#false} is VALID [2022-04-08 10:07:18,891 INFO L272 TraceCheckUtils]: 37: Hoare triple {80323#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {80323#false} is VALID [2022-04-08 10:07:18,891 INFO L290 TraceCheckUtils]: 38: Hoare triple {80323#false} ~cond := #in~cond; {80323#false} is VALID [2022-04-08 10:07:18,891 INFO L290 TraceCheckUtils]: 39: Hoare triple {80323#false} assume 0 == ~cond; {80323#false} is VALID [2022-04-08 10:07:18,891 INFO L290 TraceCheckUtils]: 40: Hoare triple {80323#false} assume !false; {80323#false} is VALID [2022-04-08 10:07:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:07:18,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:19,386 INFO L290 TraceCheckUtils]: 40: Hoare triple {80323#false} assume !false; {80323#false} is VALID [2022-04-08 10:07:19,387 INFO L290 TraceCheckUtils]: 39: Hoare triple {80323#false} assume 0 == ~cond; {80323#false} is VALID [2022-04-08 10:07:19,387 INFO L290 TraceCheckUtils]: 38: Hoare triple {80323#false} ~cond := #in~cond; {80323#false} is VALID [2022-04-08 10:07:19,387 INFO L272 TraceCheckUtils]: 37: Hoare triple {80323#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {80323#false} is VALID [2022-04-08 10:07:19,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {80323#false} assume !(~y~0 % 4294967296 > 0); {80323#false} is VALID [2022-04-08 10:07:19,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:19,387 INFO L290 TraceCheckUtils]: 34: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:19,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:19,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:19,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:19,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:19,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:19,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:19,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:19,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:19,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:19,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-08 10:07:19,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {80520#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {80323#false} is VALID [2022-04-08 10:07:19,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {80524#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80520#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:19,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {80528#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80524#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:19,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {80532#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80528#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:19,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {80536#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {80532#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:19,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {80536#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {80536#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:19,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {80543#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80536#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:19,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {80547#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80543#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:19,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {80551#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80547#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:19,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {80555#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80551#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:19,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {80559#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80555#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:19,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {80563#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80559#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:19,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {80567#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80563#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:19,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {80571#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80567#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:19,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {80575#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80571#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:19,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {80579#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80575#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:19,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {80583#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80579#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:19,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {80587#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80583#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:07:19,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {80322#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80587#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:07:19,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {80322#true} call #t~ret11 := main(); {80322#true} is VALID [2022-04-08 10:07:19,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80322#true} {80322#true} #61#return; {80322#true} is VALID [2022-04-08 10:07:19,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {80322#true} assume true; {80322#true} is VALID [2022-04-08 10:07:19,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {80322#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80322#true} is VALID [2022-04-08 10:07:19,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {80322#true} call ULTIMATE.init(); {80322#true} is VALID [2022-04-08 10:07:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:07:19,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643584351] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:19,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:19,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-08 10:07:19,399 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:19,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [170065016] [2022-04-08 10:07:19,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [170065016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:19,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:19,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:07:19,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481268944] [2022-04-08 10:07:19,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:19,400 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 10:07:19,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:19,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:19,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:19,419 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:07:19,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:19,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:07:19,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1144, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:07:19,419 INFO L87 Difference]: Start difference. First operand 170 states and 219 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:21,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:21,508 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2022-04-08 10:07:21,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 10:07:21,508 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 10:07:21,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 77 transitions. [2022-04-08 10:07:21,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 77 transitions. [2022-04-08 10:07:21,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 77 transitions. [2022-04-08 10:07:21,574 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-08 10:07:21,576 INFO L225 Difference]: With dead ends: 203 [2022-04-08 10:07:21,576 INFO L226 Difference]: Without dead ends: 185 [2022-04-08 10:07:21,576 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=721, Invalid=2939, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 10:07:21,577 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:21,577 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 94 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:07:21,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-08 10:07:22,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 171. [2022-04-08 10:07:22,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:22,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 171 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:22,136 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 171 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:22,136 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 171 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:22,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:22,138 INFO L93 Difference]: Finished difference Result 185 states and 234 transitions. [2022-04-08 10:07:22,138 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 234 transitions. [2022-04-08 10:07:22,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:22,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:22,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 185 states. [2022-04-08 10:07:22,139 INFO L87 Difference]: Start difference. First operand has 171 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 185 states. [2022-04-08 10:07:22,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:22,140 INFO L93 Difference]: Finished difference Result 185 states and 234 transitions. [2022-04-08 10:07:22,140 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 234 transitions. [2022-04-08 10:07:22,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:22,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:22,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:22,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:22,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:22,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 220 transitions. [2022-04-08 10:07:22,142 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 220 transitions. Word has length 41 [2022-04-08 10:07:22,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:22,143 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 220 transitions. [2022-04-08 10:07:22,143 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:22,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 220 transitions. [2022-04-08 10:07:22,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 220 transitions. [2022-04-08 10:07:22,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 10:07:22,627 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:22,627 INFO L499 BasicCegarLoop]: trace histogram [24, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:22,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:22,831 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable84 [2022-04-08 10:07:22,831 INFO L403 AbstractCegarLoop]: === Iteration 86 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:22,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:22,832 INFO L85 PathProgramCache]: Analyzing trace with hash 883663247, now seen corresponding path program 161 times [2022-04-08 10:07:22,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:22,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1622123074] [2022-04-08 10:07:22,834 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:22,834 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:22,834 INFO L85 PathProgramCache]: Analyzing trace with hash 883663247, now seen corresponding path program 162 times [2022-04-08 10:07:22,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:22,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554337599] [2022-04-08 10:07:22,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:22,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:23,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:23,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {81804#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {81772#true} is VALID [2022-04-08 10:07:23,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {81772#true} assume true; {81772#true} is VALID [2022-04-08 10:07:23,319 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81772#true} {81772#true} #61#return; {81772#true} is VALID [2022-04-08 10:07:23,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {81772#true} call ULTIMATE.init(); {81804#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:23,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {81804#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {81772#true} is VALID [2022-04-08 10:07:23,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {81772#true} assume true; {81772#true} is VALID [2022-04-08 10:07:23,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81772#true} {81772#true} #61#return; {81772#true} is VALID [2022-04-08 10:07:23,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {81772#true} call #t~ret11 := main(); {81772#true} is VALID [2022-04-08 10:07:23,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {81772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81777#(= main_~y~0 0)} is VALID [2022-04-08 10:07:23,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {81777#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81778#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:23,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {81778#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81779#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:23,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {81779#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81780#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:23,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {81780#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81781#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:23,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {81781#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81782#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:23,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {81782#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:23,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {81783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81784#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:23,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {81784#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81785#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:23,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {81785#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81786#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:23,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {81786#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81787#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:23,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {81787#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81788#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:23,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {81788#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81789#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:23,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {81789#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81790#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:23,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {81790#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81791#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:07:23,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {81791#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81792#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:07:23,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {81792#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81793#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:07:23,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {81793#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81794#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:07:23,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {81794#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81795#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:07:23,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {81795#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81796#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:07:23,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {81796#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81797#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:07:23,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {81797#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81798#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:07:23,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {81798#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81799#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:07:23,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {81799#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81800#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:07:23,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {81800#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81801#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:07:23,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {81801#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !(~x~0 % 4294967296 > 0); {81801#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:07:23,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {81801#(and (<= 24 main_~y~0) (<= main_~y~0 24))} ~z~0 := ~y~0; {81802#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-08 10:07:23,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {81802#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81803#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} is VALID [2022-04-08 10:07:23,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {81803#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {81773#false} is VALID [2022-04-08 10:07:23,334 INFO L290 TraceCheckUtils]: 34: Hoare triple {81773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {81773#false} is VALID [2022-04-08 10:07:23,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {81773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {81773#false} is VALID [2022-04-08 10:07:23,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {81773#false} assume !(~y~0 % 4294967296 > 0); {81773#false} is VALID [2022-04-08 10:07:23,334 INFO L272 TraceCheckUtils]: 37: Hoare triple {81773#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {81773#false} is VALID [2022-04-08 10:07:23,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {81773#false} ~cond := #in~cond; {81773#false} is VALID [2022-04-08 10:07:23,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {81773#false} assume 0 == ~cond; {81773#false} is VALID [2022-04-08 10:07:23,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {81773#false} assume !false; {81773#false} is VALID [2022-04-08 10:07:23,334 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:07:23,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:23,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554337599] [2022-04-08 10:07:23,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554337599] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:23,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244655273] [2022-04-08 10:07:23,335 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:23,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:23,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:23,336 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:23,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-04-08 10:07:23,373 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:07:23,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:23,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 10:07:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:23,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:23,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {81772#true} call ULTIMATE.init(); {81772#true} is VALID [2022-04-08 10:07:23,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {81772#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {81772#true} is VALID [2022-04-08 10:07:23,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {81772#true} assume true; {81772#true} is VALID [2022-04-08 10:07:23,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81772#true} {81772#true} #61#return; {81772#true} is VALID [2022-04-08 10:07:23,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {81772#true} call #t~ret11 := main(); {81772#true} is VALID [2022-04-08 10:07:23,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {81772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81772#true} is VALID [2022-04-08 10:07:23,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {81772#true} assume !(~x~0 % 4294967296 > 0); {81772#true} is VALID [2022-04-08 10:07:23,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {81772#true} ~z~0 := ~y~0; {81901#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:07:23,552 INFO L290 TraceCheckUtils]: 32: Hoare triple {81901#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81905#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:07:23,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {81905#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {81909#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:07:23,554 INFO L290 TraceCheckUtils]: 34: Hoare triple {81909#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {81913#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:07:23,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {81913#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {81773#false} is VALID [2022-04-08 10:07:23,554 INFO L290 TraceCheckUtils]: 36: Hoare triple {81773#false} assume !(~y~0 % 4294967296 > 0); {81773#false} is VALID [2022-04-08 10:07:23,554 INFO L272 TraceCheckUtils]: 37: Hoare triple {81773#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {81773#false} is VALID [2022-04-08 10:07:23,554 INFO L290 TraceCheckUtils]: 38: Hoare triple {81773#false} ~cond := #in~cond; {81773#false} is VALID [2022-04-08 10:07:23,555 INFO L290 TraceCheckUtils]: 39: Hoare triple {81773#false} assume 0 == ~cond; {81773#false} is VALID [2022-04-08 10:07:23,555 INFO L290 TraceCheckUtils]: 40: Hoare triple {81773#false} assume !false; {81773#false} is VALID [2022-04-08 10:07:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-04-08 10:07:23,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:23,706 INFO L290 TraceCheckUtils]: 40: Hoare triple {81773#false} assume !false; {81773#false} is VALID [2022-04-08 10:07:23,706 INFO L290 TraceCheckUtils]: 39: Hoare triple {81773#false} assume 0 == ~cond; {81773#false} is VALID [2022-04-08 10:07:23,706 INFO L290 TraceCheckUtils]: 38: Hoare triple {81773#false} ~cond := #in~cond; {81773#false} is VALID [2022-04-08 10:07:23,706 INFO L272 TraceCheckUtils]: 37: Hoare triple {81773#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {81773#false} is VALID [2022-04-08 10:07:23,706 INFO L290 TraceCheckUtils]: 36: Hoare triple {81773#false} assume !(~y~0 % 4294967296 > 0); {81773#false} is VALID [2022-04-08 10:07:23,706 INFO L290 TraceCheckUtils]: 35: Hoare triple {81913#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {81773#false} is VALID [2022-04-08 10:07:23,707 INFO L290 TraceCheckUtils]: 34: Hoare triple {81909#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {81913#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:07:23,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {81953#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {81909#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:07:23,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {81957#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81953#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:07:23,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {81772#true} ~z~0 := ~y~0; {81957#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:07:23,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {81772#true} assume !(~x~0 % 4294967296 > 0); {81772#true} is VALID [2022-04-08 10:07:23,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {81772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81772#true} is VALID [2022-04-08 10:07:23,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {81772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81772#true} is VALID [2022-04-08 10:07:23,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {81772#true} call #t~ret11 := main(); {81772#true} is VALID [2022-04-08 10:07:23,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81772#true} {81772#true} #61#return; {81772#true} is VALID [2022-04-08 10:07:23,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {81772#true} assume true; {81772#true} is VALID [2022-04-08 10:07:23,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {81772#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {81772#true} is VALID [2022-04-08 10:07:23,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {81772#true} call ULTIMATE.init(); {81772#true} is VALID [2022-04-08 10:07:23,711 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-04-08 10:07:23,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244655273] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:23,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:23,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 6, 6] total 36 [2022-04-08 10:07:23,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:23,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1622123074] [2022-04-08 10:07:23,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1622123074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:23,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:23,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-08 10:07:23,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548012866] [2022-04-08 10:07:23,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:23,712 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 10:07:23,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:23,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:23,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:23,737 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-08 10:07:23,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:23,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-08 10:07:23,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1178, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:07:23,738 INFO L87 Difference]: Start difference. First operand 171 states and 220 transitions. Second operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:29,280 INFO L93 Difference]: Finished difference Result 270 states and 390 transitions. [2022-04-08 10:07:29,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 10:07:29,280 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 10:07:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:29,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 166 transitions. [2022-04-08 10:07:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 166 transitions. [2022-04-08 10:07:29,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 166 transitions. [2022-04-08 10:07:29,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:29,420 INFO L225 Difference]: With dead ends: 270 [2022-04-08 10:07:29,420 INFO L226 Difference]: Without dead ends: 262 [2022-04-08 10:07:29,420 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=213, Invalid=3819, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 10:07:29,420 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 139 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3166 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:29,420 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 193 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 3166 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 10:07:29,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-04-08 10:07:30,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 177. [2022-04-08 10:07:30,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:30,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:30,004 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:30,004 INFO L87 Difference]: Start difference. First operand 262 states. Second operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:30,011 INFO L93 Difference]: Finished difference Result 262 states and 321 transitions. [2022-04-08 10:07:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 321 transitions. [2022-04-08 10:07:30,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:30,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:30,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 262 states. [2022-04-08 10:07:30,012 INFO L87 Difference]: Start difference. First operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 262 states. [2022-04-08 10:07:30,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:30,014 INFO L93 Difference]: Finished difference Result 262 states and 321 transitions. [2022-04-08 10:07:30,015 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 321 transitions. [2022-04-08 10:07:30,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:30,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:30,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:30,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 228 transitions. [2022-04-08 10:07:30,017 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 228 transitions. Word has length 41 [2022-04-08 10:07:30,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:30,017 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 228 transitions. [2022-04-08 10:07:30,017 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:30,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 228 transitions. [2022-04-08 10:07:30,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:30,539 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 228 transitions. [2022-04-08 10:07:30,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 10:07:30,540 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:30,540 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:30,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2022-04-08 10:07:30,740 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:30,740 INFO L403 AbstractCegarLoop]: === Iteration 87 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:30,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:30,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1251028863, now seen corresponding path program 163 times [2022-04-08 10:07:30,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:30,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1839061339] [2022-04-08 10:07:30,743 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:30,743 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:30,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1251028863, now seen corresponding path program 164 times [2022-04-08 10:07:30,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:30,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834317144] [2022-04-08 10:07:30,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:30,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:31,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:31,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {83555#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {83530#true} is VALID [2022-04-08 10:07:31,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {83530#true} assume true; {83530#true} is VALID [2022-04-08 10:07:31,062 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83530#true} {83530#true} #61#return; {83530#true} is VALID [2022-04-08 10:07:31,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {83530#true} call ULTIMATE.init(); {83555#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:31,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {83555#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {83530#true} is VALID [2022-04-08 10:07:31,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {83530#true} assume true; {83530#true} is VALID [2022-04-08 10:07:31,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83530#true} {83530#true} #61#return; {83530#true} is VALID [2022-04-08 10:07:31,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {83530#true} call #t~ret11 := main(); {83530#true} is VALID [2022-04-08 10:07:31,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {83530#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83535#(= main_~y~0 0)} is VALID [2022-04-08 10:07:31,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {83535#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83536#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:31,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {83536#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83537#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:31,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {83537#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83538#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:31,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {83538#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83539#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:31,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {83539#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83540#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:31,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {83540#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83541#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:31,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {83541#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83542#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:31,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {83542#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83543#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:31,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {83543#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:31,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {83544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {83544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:31,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {83544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {83545#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:31,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {83545#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83546#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:31,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {83546#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83547#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:31,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {83547#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83548#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:31,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {83548#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83549#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:07:31,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {83549#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83550#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:31,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {83550#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83551#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:07:31,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {83551#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83552#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:31,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {83552#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83553#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:31,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {83553#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83554#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:07:31,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {83554#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83531#false} is VALID [2022-04-08 10:07:31,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {83531#false} assume !(~z~0 % 4294967296 > 0); {83531#false} is VALID [2022-04-08 10:07:31,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-08 10:07:31,073 INFO L290 TraceCheckUtils]: 29: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-08 10:07:31,073 INFO L290 TraceCheckUtils]: 30: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-08 10:07:31,073 INFO L290 TraceCheckUtils]: 31: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-08 10:07:31,073 INFO L290 TraceCheckUtils]: 32: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-08 10:07:31,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-08 10:07:31,073 INFO L290 TraceCheckUtils]: 34: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-08 10:07:31,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-08 10:07:31,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-08 10:07:31,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {83531#false} assume !(~y~0 % 4294967296 > 0); {83531#false} is VALID [2022-04-08 10:07:31,074 INFO L272 TraceCheckUtils]: 38: Hoare triple {83531#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {83531#false} is VALID [2022-04-08 10:07:31,074 INFO L290 TraceCheckUtils]: 39: Hoare triple {83531#false} ~cond := #in~cond; {83531#false} is VALID [2022-04-08 10:07:31,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {83531#false} assume 0 == ~cond; {83531#false} is VALID [2022-04-08 10:07:31,074 INFO L290 TraceCheckUtils]: 41: Hoare triple {83531#false} assume !false; {83531#false} is VALID [2022-04-08 10:07:31,074 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:07:31,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:31,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834317144] [2022-04-08 10:07:31,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834317144] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:31,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786843646] [2022-04-08 10:07:31,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:31,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:31,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:31,076 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:31,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-04-08 10:07:31,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:31,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:31,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-08 10:07:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:31,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:31,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {83530#true} call ULTIMATE.init(); {83530#true} is VALID [2022-04-08 10:07:31,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {83530#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {83530#true} is VALID [2022-04-08 10:07:31,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {83530#true} assume true; {83530#true} is VALID [2022-04-08 10:07:31,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83530#true} {83530#true} #61#return; {83530#true} is VALID [2022-04-08 10:07:31,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {83530#true} call #t~ret11 := main(); {83530#true} is VALID [2022-04-08 10:07:31,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {83530#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83535#(= main_~y~0 0)} is VALID [2022-04-08 10:07:31,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {83535#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83536#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:31,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {83536#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83537#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:31,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {83537#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83538#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:31,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {83538#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83539#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:31,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {83539#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83540#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:31,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {83540#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83541#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:31,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {83541#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83542#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:31,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {83542#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83543#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:31,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {83543#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:31,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {83544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {83544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:31,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {83544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {83607#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:31,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {83607#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83611#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:07:31,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {83611#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83615#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:31,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {83615#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83619#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:31,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {83619#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83623#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:31,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {83623#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83627#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:31,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {83627#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83631#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:31,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {83631#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83635#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 3)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:31,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {83635#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 3)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83639#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 4)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:31,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {83639#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 4)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83643#(and (= (+ 5 main_~z~0) (+ main_~y~0 (- 4))) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:31,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {83643#(and (= (+ 5 main_~z~0) (+ main_~y~0 (- 4))) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83531#false} is VALID [2022-04-08 10:07:31,608 INFO L290 TraceCheckUtils]: 27: Hoare triple {83531#false} assume !(~z~0 % 4294967296 > 0); {83531#false} is VALID [2022-04-08 10:07:31,608 INFO L290 TraceCheckUtils]: 28: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-08 10:07:31,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-08 10:07:31,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-08 10:07:31,608 INFO L290 TraceCheckUtils]: 31: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-08 10:07:31,609 INFO L290 TraceCheckUtils]: 32: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-08 10:07:31,609 INFO L290 TraceCheckUtils]: 33: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-08 10:07:31,609 INFO L290 TraceCheckUtils]: 34: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-08 10:07:31,609 INFO L290 TraceCheckUtils]: 35: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-08 10:07:31,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-08 10:07:31,609 INFO L290 TraceCheckUtils]: 37: Hoare triple {83531#false} assume !(~y~0 % 4294967296 > 0); {83531#false} is VALID [2022-04-08 10:07:31,609 INFO L272 TraceCheckUtils]: 38: Hoare triple {83531#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {83531#false} is VALID [2022-04-08 10:07:31,609 INFO L290 TraceCheckUtils]: 39: Hoare triple {83531#false} ~cond := #in~cond; {83531#false} is VALID [2022-04-08 10:07:31,609 INFO L290 TraceCheckUtils]: 40: Hoare triple {83531#false} assume 0 == ~cond; {83531#false} is VALID [2022-04-08 10:07:31,609 INFO L290 TraceCheckUtils]: 41: Hoare triple {83531#false} assume !false; {83531#false} is VALID [2022-04-08 10:07:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:07:31,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:32,373 INFO L290 TraceCheckUtils]: 41: Hoare triple {83531#false} assume !false; {83531#false} is VALID [2022-04-08 10:07:32,374 INFO L290 TraceCheckUtils]: 40: Hoare triple {83531#false} assume 0 == ~cond; {83531#false} is VALID [2022-04-08 10:07:32,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {83531#false} ~cond := #in~cond; {83531#false} is VALID [2022-04-08 10:07:32,374 INFO L272 TraceCheckUtils]: 38: Hoare triple {83531#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {83531#false} is VALID [2022-04-08 10:07:32,374 INFO L290 TraceCheckUtils]: 37: Hoare triple {83704#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {83531#false} is VALID [2022-04-08 10:07:32,375 INFO L290 TraceCheckUtils]: 36: Hoare triple {83708#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83704#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:32,375 INFO L290 TraceCheckUtils]: 35: Hoare triple {83712#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83708#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:32,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {83716#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83712#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:32,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {83720#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83716#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:32,377 INFO L290 TraceCheckUtils]: 32: Hoare triple {83724#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83720#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:32,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {83728#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83724#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:32,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {83732#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83728#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:32,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {83736#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83732#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:07:32,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {83740#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83736#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:32,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {83740#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !(~z~0 % 4294967296 > 0); {83740#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:07:32,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {83747#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83740#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:07:32,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {83751#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83747#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-08 10:07:32,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {83755#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83751#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:07:32,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {83759#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83755#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:07:32,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {83763#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83759#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-08 10:07:32,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {83767#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83763#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:07:32,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {83771#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83767#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:07:32,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {83775#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83771#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:07:32,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {83779#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83775#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-08 10:07:32,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {83783#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83779#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:07:32,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {83530#true} ~z~0 := ~y~0; {83783#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))))} is VALID [2022-04-08 10:07:32,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {83530#true} assume !(~x~0 % 4294967296 > 0); {83530#true} is VALID [2022-04-08 10:07:32,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {83530#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83530#true} is VALID [2022-04-08 10:07:32,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {83530#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83530#true} is VALID [2022-04-08 10:07:32,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {83530#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83530#true} is VALID [2022-04-08 10:07:32,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {83530#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83530#true} is VALID [2022-04-08 10:07:32,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {83530#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83530#true} is VALID [2022-04-08 10:07:32,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {83530#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83530#true} is VALID [2022-04-08 10:07:32,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {83530#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83530#true} is VALID [2022-04-08 10:07:32,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {83530#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83530#true} is VALID [2022-04-08 10:07:32,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {83530#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83530#true} is VALID [2022-04-08 10:07:32,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {83530#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83530#true} is VALID [2022-04-08 10:07:32,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {83530#true} call #t~ret11 := main(); {83530#true} is VALID [2022-04-08 10:07:32,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83530#true} {83530#true} #61#return; {83530#true} is VALID [2022-04-08 10:07:32,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {83530#true} assume true; {83530#true} is VALID [2022-04-08 10:07:32,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {83530#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {83530#true} is VALID [2022-04-08 10:07:32,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {83530#true} call ULTIMATE.init(); {83530#true} is VALID [2022-04-08 10:07:32,398 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:07:32,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786843646] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:32,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:32,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 53 [2022-04-08 10:07:32,399 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:32,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1839061339] [2022-04-08 10:07:32,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1839061339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:32,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:32,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:07:32,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102204989] [2022-04-08 10:07:32,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:32,400 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 10:07:32,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:32,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:32,429 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-08 10:07:32,429 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:07:32,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:32,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:07:32,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=2333, Unknown=0, NotChecked=0, Total=2756 [2022-04-08 10:07:32,430 INFO L87 Difference]: Start difference. First operand 177 states and 228 transitions. Second operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:34,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:34,241 INFO L93 Difference]: Finished difference Result 192 states and 242 transitions. [2022-04-08 10:07:34,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:07:34,241 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 10:07:34,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:34,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 47 transitions. [2022-04-08 10:07:34,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 47 transitions. [2022-04-08 10:07:34,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 47 transitions. [2022-04-08 10:07:34,277 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-08 10:07:34,279 INFO L225 Difference]: With dead ends: 192 [2022-04-08 10:07:34,279 INFO L226 Difference]: Without dead ends: 165 [2022-04-08 10:07:34,280 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=813, Invalid=4443, Unknown=0, NotChecked=0, Total=5256 [2022-04-08 10:07:34,280 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:34,280 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 116 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:07:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-08 10:07:34,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-04-08 10:07:34,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:34,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 165 states, 160 states have (on average 1.3125) internal successors, (210), 160 states have internal predecessors, (210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:34,808 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 165 states, 160 states have (on average 1.3125) internal successors, (210), 160 states have internal predecessors, (210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:34,808 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 165 states, 160 states have (on average 1.3125) internal successors, (210), 160 states have internal predecessors, (210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:34,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:34,810 INFO L93 Difference]: Finished difference Result 165 states and 214 transitions. [2022-04-08 10:07:34,810 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 214 transitions. [2022-04-08 10:07:34,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:34,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:34,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 160 states have (on average 1.3125) internal successors, (210), 160 states have internal predecessors, (210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-08 10:07:34,810 INFO L87 Difference]: Start difference. First operand has 165 states, 160 states have (on average 1.3125) internal successors, (210), 160 states have internal predecessors, (210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-08 10:07:34,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:34,811 INFO L93 Difference]: Finished difference Result 165 states and 214 transitions. [2022-04-08 10:07:34,812 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 214 transitions. [2022-04-08 10:07:34,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:34,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:34,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:34,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:34,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 160 states have (on average 1.3125) internal successors, (210), 160 states have internal predecessors, (210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 214 transitions. [2022-04-08 10:07:34,814 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 214 transitions. Word has length 42 [2022-04-08 10:07:34,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:34,814 INFO L478 AbstractCegarLoop]: Abstraction has 165 states and 214 transitions. [2022-04-08 10:07:34,814 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:34,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 165 states and 214 transitions. [2022-04-08 10:07:35,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:35,318 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 214 transitions. [2022-04-08 10:07:35,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 10:07:35,319 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:35,319 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:35,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Ended with exit code 0 [2022-04-08 10:07:35,519 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:35,519 INFO L403 AbstractCegarLoop]: === Iteration 88 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:35,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:35,520 INFO L85 PathProgramCache]: Analyzing trace with hash -647408947, now seen corresponding path program 165 times [2022-04-08 10:07:35,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:35,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [283980504] [2022-04-08 10:07:35,522 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:35,522 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:35,523 INFO L85 PathProgramCache]: Analyzing trace with hash -647408947, now seen corresponding path program 166 times [2022-04-08 10:07:35,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:35,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983720701] [2022-04-08 10:07:35,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:35,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:35,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:35,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {84946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {84921#true} is VALID [2022-04-08 10:07:35,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {84921#true} assume true; {84921#true} is VALID [2022-04-08 10:07:35,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {84921#true} {84921#true} #61#return; {84921#true} is VALID [2022-04-08 10:07:35,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {84921#true} call ULTIMATE.init(); {84946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:35,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {84946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {84921#true} is VALID [2022-04-08 10:07:35,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {84921#true} assume true; {84921#true} is VALID [2022-04-08 10:07:35,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84921#true} {84921#true} #61#return; {84921#true} is VALID [2022-04-08 10:07:35,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {84921#true} call #t~ret11 := main(); {84921#true} is VALID [2022-04-08 10:07:35,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {84921#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {84926#(= main_~y~0 0)} is VALID [2022-04-08 10:07:35,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {84926#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84927#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:35,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {84927#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84928#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:35,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {84928#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84929#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:35,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {84929#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84930#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:35,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {84930#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84931#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:35,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {84931#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84932#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:35,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {84932#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84933#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:35,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {84933#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84934#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:35,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {84934#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84935#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:35,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {84935#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:35,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {84936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {84936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:35,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {84936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {84937#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:35,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {84937#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84938#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:35,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {84938#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84939#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:35,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {84939#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84940#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:35,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {84940#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84941#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:35,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {84941#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84942#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:07:35,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {84942#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84943#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:35,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {84943#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84944#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:07:35,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {84944#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84945#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:35,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {84945#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {84922#false} is VALID [2022-04-08 10:07:35,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:35,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:35,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:35,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:35,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:35,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:35,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:35,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:35,849 INFO L290 TraceCheckUtils]: 35: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:35,849 INFO L290 TraceCheckUtils]: 36: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:35,849 INFO L290 TraceCheckUtils]: 37: Hoare triple {84922#false} assume !(~y~0 % 4294967296 > 0); {84922#false} is VALID [2022-04-08 10:07:35,849 INFO L272 TraceCheckUtils]: 38: Hoare triple {84922#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {84922#false} is VALID [2022-04-08 10:07:35,849 INFO L290 TraceCheckUtils]: 39: Hoare triple {84922#false} ~cond := #in~cond; {84922#false} is VALID [2022-04-08 10:07:35,849 INFO L290 TraceCheckUtils]: 40: Hoare triple {84922#false} assume 0 == ~cond; {84922#false} is VALID [2022-04-08 10:07:35,849 INFO L290 TraceCheckUtils]: 41: Hoare triple {84922#false} assume !false; {84922#false} is VALID [2022-04-08 10:07:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:07:35,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:35,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983720701] [2022-04-08 10:07:35,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983720701] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:35,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648325146] [2022-04-08 10:07:35,850 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:35,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:35,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:35,851 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:35,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-04-08 10:07:35,900 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:35,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:35,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 58 conjunts are in the unsatisfiable core [2022-04-08 10:07:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:35,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:36,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {84921#true} call ULTIMATE.init(); {84921#true} is VALID [2022-04-08 10:07:36,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {84921#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {84921#true} is VALID [2022-04-08 10:07:36,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {84921#true} assume true; {84921#true} is VALID [2022-04-08 10:07:36,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84921#true} {84921#true} #61#return; {84921#true} is VALID [2022-04-08 10:07:36,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {84921#true} call #t~ret11 := main(); {84921#true} is VALID [2022-04-08 10:07:36,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {84921#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {84926#(= main_~y~0 0)} is VALID [2022-04-08 10:07:36,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {84926#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84927#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:36,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {84927#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84928#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:36,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {84928#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84929#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:36,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {84929#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84930#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:36,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {84930#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84931#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:36,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {84931#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84932#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:36,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {84932#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84933#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:36,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {84933#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84934#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:36,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {84934#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84935#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:36,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {84935#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:36,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {84936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {84936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:36,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {84936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {85001#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:36,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {85001#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85005#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:07:36,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {85005#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85009#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:07:36,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {85009#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85013#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:36,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {85013#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85017#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:36,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {85017#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85021#(and (<= main_~y~0 10) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:36,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {85021#(and (<= main_~y~0 10) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85025#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:36,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {85025#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85029#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))))} is VALID [2022-04-08 10:07:36,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {85029#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85033#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))))} is VALID [2022-04-08 10:07:36,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {85033#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))))} assume !(~z~0 % 4294967296 > 0); {84922#false} is VALID [2022-04-08 10:07:36,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:36,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:36,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:36,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:36,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:36,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:36,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:36,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:36,374 INFO L290 TraceCheckUtils]: 35: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:36,374 INFO L290 TraceCheckUtils]: 36: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:36,374 INFO L290 TraceCheckUtils]: 37: Hoare triple {84922#false} assume !(~y~0 % 4294967296 > 0); {84922#false} is VALID [2022-04-08 10:07:36,374 INFO L272 TraceCheckUtils]: 38: Hoare triple {84922#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {84922#false} is VALID [2022-04-08 10:07:36,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {84922#false} ~cond := #in~cond; {84922#false} is VALID [2022-04-08 10:07:36,374 INFO L290 TraceCheckUtils]: 40: Hoare triple {84922#false} assume 0 == ~cond; {84922#false} is VALID [2022-04-08 10:07:36,375 INFO L290 TraceCheckUtils]: 41: Hoare triple {84922#false} assume !false; {84922#false} is VALID [2022-04-08 10:07:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:07:36,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:37,079 INFO L290 TraceCheckUtils]: 41: Hoare triple {84922#false} assume !false; {84922#false} is VALID [2022-04-08 10:07:37,079 INFO L290 TraceCheckUtils]: 40: Hoare triple {84922#false} assume 0 == ~cond; {84922#false} is VALID [2022-04-08 10:07:37,079 INFO L290 TraceCheckUtils]: 39: Hoare triple {84922#false} ~cond := #in~cond; {84922#false} is VALID [2022-04-08 10:07:37,079 INFO L272 TraceCheckUtils]: 38: Hoare triple {84922#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {84922#false} is VALID [2022-04-08 10:07:37,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {84922#false} assume !(~y~0 % 4294967296 > 0); {84922#false} is VALID [2022-04-08 10:07:37,079 INFO L290 TraceCheckUtils]: 36: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:37,080 INFO L290 TraceCheckUtils]: 35: Hoare triple {85100#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-08 10:07:37,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {85104#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {85100#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:07:37,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {85108#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {85104#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:07:37,082 INFO L290 TraceCheckUtils]: 32: Hoare triple {85112#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {85108#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:07:37,083 INFO L290 TraceCheckUtils]: 31: Hoare triple {85116#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {85112#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:07:37,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {85120#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {85116#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:07:37,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {85124#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {85120#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:07:37,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {85128#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {85124#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:07:37,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {85132#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {85128#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:07:37,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {85136#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {85132#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:07:37,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {85140#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85136#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:07:37,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {85144#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85140#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:07:37,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {85148#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85144#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:07:37,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {85152#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85148#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:07:37,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {85156#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85152#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:07:37,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {85160#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85156#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:07:37,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {85164#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85160#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:07:37,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {85168#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85164#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:07:37,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {84921#true} ~z~0 := ~y~0; {85168#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:07:37,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {84921#true} assume !(~x~0 % 4294967296 > 0); {84921#true} is VALID [2022-04-08 10:07:37,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {84921#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84921#true} is VALID [2022-04-08 10:07:37,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {84921#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84921#true} is VALID [2022-04-08 10:07:37,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {84921#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84921#true} is VALID [2022-04-08 10:07:37,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {84921#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84921#true} is VALID [2022-04-08 10:07:37,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {84921#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84921#true} is VALID [2022-04-08 10:07:37,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {84921#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84921#true} is VALID [2022-04-08 10:07:37,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {84921#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84921#true} is VALID [2022-04-08 10:07:37,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {84921#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84921#true} is VALID [2022-04-08 10:07:37,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {84921#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84921#true} is VALID [2022-04-08 10:07:37,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {84921#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84921#true} is VALID [2022-04-08 10:07:37,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {84921#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {84921#true} is VALID [2022-04-08 10:07:37,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {84921#true} call #t~ret11 := main(); {84921#true} is VALID [2022-04-08 10:07:37,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84921#true} {84921#true} #61#return; {84921#true} is VALID [2022-04-08 10:07:37,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {84921#true} assume true; {84921#true} is VALID [2022-04-08 10:07:37,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {84921#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {84921#true} is VALID [2022-04-08 10:07:37,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {84921#true} call ULTIMATE.init(); {84921#true} is VALID [2022-04-08 10:07:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-08 10:07:37,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648325146] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:37,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:37,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 20] total 50 [2022-04-08 10:07:37,095 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:37,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [283980504] [2022-04-08 10:07:37,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [283980504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:37,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:37,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:07:37,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543108919] [2022-04-08 10:07:37,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:37,096 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 10:07:37,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:37,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:37,118 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-08 10:07:37,118 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:07:37,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:37,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:07:37,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=2150, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:07:37,119 INFO L87 Difference]: Start difference. First operand 165 states and 214 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:39,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:39,285 INFO L93 Difference]: Finished difference Result 194 states and 243 transitions. [2022-04-08 10:07:39,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:07:39,286 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 10:07:39,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:39,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2022-04-08 10:07:39,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:39,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2022-04-08 10:07:39,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 60 transitions. [2022-04-08 10:07:39,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:39,336 INFO L225 Difference]: With dead ends: 194 [2022-04-08 10:07:39,336 INFO L226 Difference]: Without dead ends: 178 [2022-04-08 10:07:39,336 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=508, Invalid=4322, Unknown=0, NotChecked=0, Total=4830 [2022-04-08 10:07:39,336 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:39,336 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 103 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:07:39,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-04-08 10:07:39,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2022-04-08 10:07:39,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:39,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 166 states, 161 states have (on average 1.31055900621118) internal successors, (211), 161 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:39,868 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 166 states, 161 states have (on average 1.31055900621118) internal successors, (211), 161 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:39,868 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 166 states, 161 states have (on average 1.31055900621118) internal successors, (211), 161 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:39,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:39,870 INFO L93 Difference]: Finished difference Result 178 states and 227 transitions. [2022-04-08 10:07:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 227 transitions. [2022-04-08 10:07:39,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:39,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:39,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.31055900621118) internal successors, (211), 161 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 178 states. [2022-04-08 10:07:39,870 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.31055900621118) internal successors, (211), 161 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 178 states. [2022-04-08 10:07:39,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:39,872 INFO L93 Difference]: Finished difference Result 178 states and 227 transitions. [2022-04-08 10:07:39,872 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 227 transitions. [2022-04-08 10:07:39,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:39,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:39,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:39,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:39,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.31055900621118) internal successors, (211), 161 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:39,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 215 transitions. [2022-04-08 10:07:39,874 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 215 transitions. Word has length 42 [2022-04-08 10:07:39,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:39,874 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 215 transitions. [2022-04-08 10:07:39,874 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:39,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 215 transitions. [2022-04-08 10:07:40,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:40,331 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 215 transitions. [2022-04-08 10:07:40,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 10:07:40,331 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:40,331 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:40,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:40,532 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2022-04-08 10:07:40,532 INFO L403 AbstractCegarLoop]: === Iteration 89 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:40,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:40,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1157583489, now seen corresponding path program 167 times [2022-04-08 10:07:40,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:40,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [331941366] [2022-04-08 10:07:40,535 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:40,535 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:40,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1157583489, now seen corresponding path program 168 times [2022-04-08 10:07:40,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:40,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342214973] [2022-04-08 10:07:40,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:40,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:40,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:40,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {86365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {86341#true} is VALID [2022-04-08 10:07:40,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {86341#true} assume true; {86341#true} is VALID [2022-04-08 10:07:40,825 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86341#true} {86341#true} #61#return; {86341#true} is VALID [2022-04-08 10:07:40,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {86341#true} call ULTIMATE.init(); {86365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:40,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {86365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {86341#true} is VALID [2022-04-08 10:07:40,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {86341#true} assume true; {86341#true} is VALID [2022-04-08 10:07:40,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86341#true} {86341#true} #61#return; {86341#true} is VALID [2022-04-08 10:07:40,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {86341#true} call #t~ret11 := main(); {86341#true} is VALID [2022-04-08 10:07:40,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {86341#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {86346#(= main_~y~0 0)} is VALID [2022-04-08 10:07:40,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {86346#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86347#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:40,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {86347#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86348#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:40,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {86348#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86349#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:40,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {86349#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86350#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:40,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {86350#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86351#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:40,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {86351#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86352#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:40,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {86352#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86353#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:40,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {86353#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86354#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:40,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {86354#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86355#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:40,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {86355#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86356#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:40,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {86356#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86357#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:40,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {86357#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {86357#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:40,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {86357#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {86358#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:40,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {86358#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86359#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:40,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {86359#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86360#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:40,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {86360#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86361#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:40,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {86361#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86362#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:40,834 INFO L290 TraceCheckUtils]: 23: Hoare triple {86362#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86363#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:40,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {86363#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86364#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:40,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {86364#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {86342#false} is VALID [2022-04-08 10:07:40,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:40,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:40,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:40,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:40,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:40,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:40,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:40,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:40,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:40,836 INFO L290 TraceCheckUtils]: 35: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:40,836 INFO L290 TraceCheckUtils]: 36: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:40,836 INFO L290 TraceCheckUtils]: 37: Hoare triple {86342#false} assume !(~y~0 % 4294967296 > 0); {86342#false} is VALID [2022-04-08 10:07:40,836 INFO L272 TraceCheckUtils]: 38: Hoare triple {86342#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {86342#false} is VALID [2022-04-08 10:07:40,836 INFO L290 TraceCheckUtils]: 39: Hoare triple {86342#false} ~cond := #in~cond; {86342#false} is VALID [2022-04-08 10:07:40,836 INFO L290 TraceCheckUtils]: 40: Hoare triple {86342#false} assume 0 == ~cond; {86342#false} is VALID [2022-04-08 10:07:40,836 INFO L290 TraceCheckUtils]: 41: Hoare triple {86342#false} assume !false; {86342#false} is VALID [2022-04-08 10:07:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:07:40,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:40,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342214973] [2022-04-08 10:07:40,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342214973] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:40,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790836422] [2022-04-08 10:07:40,837 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:40,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:40,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:40,838 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:40,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-04-08 10:07:41,108 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:07:41,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:41,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 10:07:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:41,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:41,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {86341#true} call ULTIMATE.init(); {86341#true} is VALID [2022-04-08 10:07:41,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {86341#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {86341#true} is VALID [2022-04-08 10:07:41,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {86341#true} assume true; {86341#true} is VALID [2022-04-08 10:07:41,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86341#true} {86341#true} #61#return; {86341#true} is VALID [2022-04-08 10:07:41,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {86341#true} call #t~ret11 := main(); {86341#true} is VALID [2022-04-08 10:07:41,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {86341#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {86346#(= main_~y~0 0)} is VALID [2022-04-08 10:07:41,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {86346#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86347#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:41,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {86347#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86348#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:41,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {86348#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86349#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:41,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {86349#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86350#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:41,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {86350#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86351#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:41,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {86351#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86352#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:41,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {86352#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86353#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:41,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {86353#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86354#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:41,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {86354#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86355#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:41,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {86355#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86356#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:41,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {86356#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86357#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:41,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {86357#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {86357#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:41,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {86357#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {86358#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:41,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {86358#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86359#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:41,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {86359#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86360#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:41,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {86360#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86361#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:41,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {86361#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86362#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:41,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {86362#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86363#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:41,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {86363#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86441#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:07:41,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {86441#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {86342#false} is VALID [2022-04-08 10:07:41,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:41,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:41,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:41,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:41,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:41,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:41,436 INFO L290 TraceCheckUtils]: 32: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:41,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:41,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:41,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:41,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:41,436 INFO L290 TraceCheckUtils]: 37: Hoare triple {86342#false} assume !(~y~0 % 4294967296 > 0); {86342#false} is VALID [2022-04-08 10:07:41,436 INFO L272 TraceCheckUtils]: 38: Hoare triple {86342#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {86342#false} is VALID [2022-04-08 10:07:41,436 INFO L290 TraceCheckUtils]: 39: Hoare triple {86342#false} ~cond := #in~cond; {86342#false} is VALID [2022-04-08 10:07:41,436 INFO L290 TraceCheckUtils]: 40: Hoare triple {86342#false} assume 0 == ~cond; {86342#false} is VALID [2022-04-08 10:07:41,436 INFO L290 TraceCheckUtils]: 41: Hoare triple {86342#false} assume !false; {86342#false} is VALID [2022-04-08 10:07:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:07:41,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:42,023 INFO L290 TraceCheckUtils]: 41: Hoare triple {86342#false} assume !false; {86342#false} is VALID [2022-04-08 10:07:42,023 INFO L290 TraceCheckUtils]: 40: Hoare triple {86342#false} assume 0 == ~cond; {86342#false} is VALID [2022-04-08 10:07:42,023 INFO L290 TraceCheckUtils]: 39: Hoare triple {86342#false} ~cond := #in~cond; {86342#false} is VALID [2022-04-08 10:07:42,024 INFO L272 TraceCheckUtils]: 38: Hoare triple {86342#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {86342#false} is VALID [2022-04-08 10:07:42,024 INFO L290 TraceCheckUtils]: 37: Hoare triple {86342#false} assume !(~y~0 % 4294967296 > 0); {86342#false} is VALID [2022-04-08 10:07:42,024 INFO L290 TraceCheckUtils]: 36: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:42,024 INFO L290 TraceCheckUtils]: 35: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:42,024 INFO L290 TraceCheckUtils]: 34: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:42,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:42,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:42,024 INFO L290 TraceCheckUtils]: 31: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:42,024 INFO L290 TraceCheckUtils]: 30: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:42,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:42,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:42,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:42,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-08 10:07:42,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {86541#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {86342#false} is VALID [2022-04-08 10:07:42,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {86545#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86541#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:42,026 INFO L290 TraceCheckUtils]: 23: Hoare triple {86549#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86545#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:42,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {86553#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86549#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:42,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {86557#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86553#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:42,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {86561#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86557#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:42,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {86565#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86561#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:42,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {86569#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {86565#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:42,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {86569#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {86569#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:42,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {86576#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86569#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:42,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {86580#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86576#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:42,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {86584#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86580#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:42,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {86588#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86584#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:42,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {86592#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86588#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:42,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {86596#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86592#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:42,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {86600#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86596#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:42,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {86604#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86600#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:42,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {86608#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86604#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:42,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {86612#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86608#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:42,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {86616#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86612#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:42,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {86341#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {86616#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:42,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {86341#true} call #t~ret11 := main(); {86341#true} is VALID [2022-04-08 10:07:42,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86341#true} {86341#true} #61#return; {86341#true} is VALID [2022-04-08 10:07:42,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {86341#true} assume true; {86341#true} is VALID [2022-04-08 10:07:42,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {86341#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {86341#true} is VALID [2022-04-08 10:07:42,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {86341#true} call ULTIMATE.init(); {86341#true} is VALID [2022-04-08 10:07:42,038 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:07:42,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790836422] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:42,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:42,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-08 10:07:42,039 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:42,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [331941366] [2022-04-08 10:07:42,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [331941366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:42,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:42,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:07:42,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550797864] [2022-04-08 10:07:42,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:42,039 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 10:07:42,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:42,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:42,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:42,060 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:07:42,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:42,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:07:42,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1445, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:07:42,061 INFO L87 Difference]: Start difference. First operand 166 states and 215 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:44,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:44,458 INFO L93 Difference]: Finished difference Result 197 states and 246 transitions. [2022-04-08 10:07:44,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 10:07:44,458 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 10:07:44,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:44,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 70 transitions. [2022-04-08 10:07:44,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:44,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 70 transitions. [2022-04-08 10:07:44,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 70 transitions. [2022-04-08 10:07:44,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:44,520 INFO L225 Difference]: With dead ends: 197 [2022-04-08 10:07:44,520 INFO L226 Difference]: Without dead ends: 180 [2022-04-08 10:07:44,521 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=803, Invalid=3619, Unknown=0, NotChecked=0, Total=4422 [2022-04-08 10:07:44,521 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:44,521 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 115 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:07:44,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-08 10:07:45,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2022-04-08 10:07:45,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:45,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 167 states, 162 states have (on average 1.308641975308642) internal successors, (212), 162 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:45,052 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 167 states, 162 states have (on average 1.308641975308642) internal successors, (212), 162 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:45,052 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 167 states, 162 states have (on average 1.308641975308642) internal successors, (212), 162 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:45,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:45,054 INFO L93 Difference]: Finished difference Result 180 states and 229 transitions. [2022-04-08 10:07:45,054 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 229 transitions. [2022-04-08 10:07:45,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:45,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:45,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 162 states have (on average 1.308641975308642) internal successors, (212), 162 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-08 10:07:45,054 INFO L87 Difference]: Start difference. First operand has 167 states, 162 states have (on average 1.308641975308642) internal successors, (212), 162 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-08 10:07:45,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:45,056 INFO L93 Difference]: Finished difference Result 180 states and 229 transitions. [2022-04-08 10:07:45,056 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 229 transitions. [2022-04-08 10:07:45,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:45,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:45,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:45,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.308641975308642) internal successors, (212), 162 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:45,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 216 transitions. [2022-04-08 10:07:45,058 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 216 transitions. Word has length 42 [2022-04-08 10:07:45,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:45,058 INFO L478 AbstractCegarLoop]: Abstraction has 167 states and 216 transitions. [2022-04-08 10:07:45,058 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:45,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 216 transitions. [2022-04-08 10:07:45,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:45,563 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 216 transitions. [2022-04-08 10:07:45,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 10:07:45,563 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:45,563 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:45,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:45,763 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:45,764 INFO L403 AbstractCegarLoop]: === Iteration 90 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:45,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:45,764 INFO L85 PathProgramCache]: Analyzing trace with hash -820638515, now seen corresponding path program 169 times [2022-04-08 10:07:45,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:45,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2014383235] [2022-04-08 10:07:45,766 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:45,766 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:45,766 INFO L85 PathProgramCache]: Analyzing trace with hash -820638515, now seen corresponding path program 170 times [2022-04-08 10:07:45,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:45,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251324725] [2022-04-08 10:07:45,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:45,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:46,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:46,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {87798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {87775#true} is VALID [2022-04-08 10:07:46,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {87775#true} assume true; {87775#true} is VALID [2022-04-08 10:07:46,036 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87775#true} {87775#true} #61#return; {87775#true} is VALID [2022-04-08 10:07:46,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {87775#true} call ULTIMATE.init(); {87798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:46,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {87798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {87775#true} is VALID [2022-04-08 10:07:46,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {87775#true} assume true; {87775#true} is VALID [2022-04-08 10:07:46,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87775#true} {87775#true} #61#return; {87775#true} is VALID [2022-04-08 10:07:46,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {87775#true} call #t~ret11 := main(); {87775#true} is VALID [2022-04-08 10:07:46,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {87775#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87780#(= main_~y~0 0)} is VALID [2022-04-08 10:07:46,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {87780#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87781#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:46,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {87781#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87782#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:46,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {87782#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87783#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:46,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {87783#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87784#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:46,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {87784#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87785#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:46,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {87785#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87786#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:46,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {87786#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87787#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:46,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {87787#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87788#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:46,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {87788#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87789#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:46,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {87789#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87790#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:46,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {87790#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87791#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:46,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {87791#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87792#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:46,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {87792#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {87792#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:46,044 INFO L290 TraceCheckUtils]: 19: Hoare triple {87792#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {87793#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:07:46,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {87793#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87794#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:46,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {87794#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87795#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:46,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {87795#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87796#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:46,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {87796#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87797#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:46,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {87797#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {87776#false} is VALID [2022-04-08 10:07:46,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {87776#false} assume !(~y~0 % 4294967296 > 0); {87776#false} is VALID [2022-04-08 10:07:46,047 INFO L272 TraceCheckUtils]: 38: Hoare triple {87776#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {87776#false} is VALID [2022-04-08 10:07:46,047 INFO L290 TraceCheckUtils]: 39: Hoare triple {87776#false} ~cond := #in~cond; {87776#false} is VALID [2022-04-08 10:07:46,047 INFO L290 TraceCheckUtils]: 40: Hoare triple {87776#false} assume 0 == ~cond; {87776#false} is VALID [2022-04-08 10:07:46,047 INFO L290 TraceCheckUtils]: 41: Hoare triple {87776#false} assume !false; {87776#false} is VALID [2022-04-08 10:07:46,047 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:07:46,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:46,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251324725] [2022-04-08 10:07:46,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251324725] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:46,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337230383] [2022-04-08 10:07:46,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:46,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:46,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:46,048 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:46,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-04-08 10:07:46,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:46,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:46,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 10:07:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:46,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:46,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {87775#true} call ULTIMATE.init(); {87775#true} is VALID [2022-04-08 10:07:46,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {87775#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {87775#true} is VALID [2022-04-08 10:07:46,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {87775#true} assume true; {87775#true} is VALID [2022-04-08 10:07:46,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87775#true} {87775#true} #61#return; {87775#true} is VALID [2022-04-08 10:07:46,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {87775#true} call #t~ret11 := main(); {87775#true} is VALID [2022-04-08 10:07:46,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {87775#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87780#(= main_~y~0 0)} is VALID [2022-04-08 10:07:46,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {87780#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87781#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:46,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {87781#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87782#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:46,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {87782#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87783#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:46,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {87783#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87784#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:46,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {87784#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87785#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:46,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {87785#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87786#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:46,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {87786#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87787#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:46,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {87787#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87788#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:46,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {87788#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87789#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:46,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {87789#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87790#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:46,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {87790#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87791#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:46,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {87791#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87792#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:46,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {87792#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {87792#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:46,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {87792#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {87793#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:07:46,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {87793#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87794#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:46,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {87794#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87795#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:46,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {87795#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87796#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:46,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {87796#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87871#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:46,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {87871#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {87776#false} is VALID [2022-04-08 10:07:46,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,415 INFO L290 TraceCheckUtils]: 33: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,415 INFO L290 TraceCheckUtils]: 34: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,415 INFO L290 TraceCheckUtils]: 35: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,415 INFO L290 TraceCheckUtils]: 36: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,415 INFO L290 TraceCheckUtils]: 37: Hoare triple {87776#false} assume !(~y~0 % 4294967296 > 0); {87776#false} is VALID [2022-04-08 10:07:46,415 INFO L272 TraceCheckUtils]: 38: Hoare triple {87776#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {87776#false} is VALID [2022-04-08 10:07:46,415 INFO L290 TraceCheckUtils]: 39: Hoare triple {87776#false} ~cond := #in~cond; {87776#false} is VALID [2022-04-08 10:07:46,415 INFO L290 TraceCheckUtils]: 40: Hoare triple {87776#false} assume 0 == ~cond; {87776#false} is VALID [2022-04-08 10:07:46,415 INFO L290 TraceCheckUtils]: 41: Hoare triple {87776#false} assume !false; {87776#false} is VALID [2022-04-08 10:07:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:07:46,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:46,964 INFO L290 TraceCheckUtils]: 41: Hoare triple {87776#false} assume !false; {87776#false} is VALID [2022-04-08 10:07:46,964 INFO L290 TraceCheckUtils]: 40: Hoare triple {87776#false} assume 0 == ~cond; {87776#false} is VALID [2022-04-08 10:07:46,964 INFO L290 TraceCheckUtils]: 39: Hoare triple {87776#false} ~cond := #in~cond; {87776#false} is VALID [2022-04-08 10:07:46,965 INFO L272 TraceCheckUtils]: 38: Hoare triple {87776#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {87776#false} is VALID [2022-04-08 10:07:46,965 INFO L290 TraceCheckUtils]: 37: Hoare triple {87776#false} assume !(~y~0 % 4294967296 > 0); {87776#false} is VALID [2022-04-08 10:07:46,965 INFO L290 TraceCheckUtils]: 36: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,965 INFO L290 TraceCheckUtils]: 29: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-08 10:07:46,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {87977#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {87776#false} is VALID [2022-04-08 10:07:46,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {87981#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87977#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:46,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {87985#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87981#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:46,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {87989#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87985#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:46,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {87993#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87989#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:46,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {87997#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {87993#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:46,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {87997#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {87997#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:46,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {88004#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87997#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:46,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {88008#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88004#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:46,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {88012#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88008#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:46,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {88016#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88012#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:46,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {88020#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88016#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:46,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {88024#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88020#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:46,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {88028#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88024#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:46,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {88032#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88028#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:46,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {88036#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88032#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:46,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {88040#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88036#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:46,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {88044#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88040#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:46,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {88048#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88044#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:46,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {87775#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {88048#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:07:46,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {87775#true} call #t~ret11 := main(); {87775#true} is VALID [2022-04-08 10:07:46,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87775#true} {87775#true} #61#return; {87775#true} is VALID [2022-04-08 10:07:46,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {87775#true} assume true; {87775#true} is VALID [2022-04-08 10:07:46,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {87775#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {87775#true} is VALID [2022-04-08 10:07:46,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {87775#true} call ULTIMATE.init(); {87775#true} is VALID [2022-04-08 10:07:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:07:46,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337230383] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:46,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:46,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-08 10:07:46,978 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:46,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2014383235] [2022-04-08 10:07:46,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2014383235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:46,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:46,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:07:46,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121647746] [2022-04-08 10:07:46,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:46,978 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 10:07:46,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:46,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:46,999 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-08 10:07:46,999 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:07:46,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:46,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:07:46,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1284, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:07:46,999 INFO L87 Difference]: Start difference. First operand 167 states and 216 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:49,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:49,194 INFO L93 Difference]: Finished difference Result 200 states and 249 transitions. [2022-04-08 10:07:49,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 10:07:49,195 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 10:07:49,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:49,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2022-04-08 10:07:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:49,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2022-04-08 10:07:49,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 75 transitions. [2022-04-08 10:07:49,256 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-08 10:07:49,258 INFO L225 Difference]: With dead ends: 200 [2022-04-08 10:07:49,258 INFO L226 Difference]: Without dead ends: 182 [2022-04-08 10:07:49,258 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=798, Invalid=3362, Unknown=0, NotChecked=0, Total=4160 [2022-04-08 10:07:49,258 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:49,258 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 97 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:07:49,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-08 10:07:49,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 168. [2022-04-08 10:07:49,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:49,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:49,803 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:49,803 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:49,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:49,805 INFO L93 Difference]: Finished difference Result 182 states and 231 transitions. [2022-04-08 10:07:49,805 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 231 transitions. [2022-04-08 10:07:49,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:49,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:49,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 182 states. [2022-04-08 10:07:49,805 INFO L87 Difference]: Start difference. First operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 182 states. [2022-04-08 10:07:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:49,807 INFO L93 Difference]: Finished difference Result 182 states and 231 transitions. [2022-04-08 10:07:49,807 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 231 transitions. [2022-04-08 10:07:49,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:49,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:49,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:49,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:49,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:49,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 217 transitions. [2022-04-08 10:07:49,809 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 217 transitions. Word has length 42 [2022-04-08 10:07:49,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:49,809 INFO L478 AbstractCegarLoop]: Abstraction has 168 states and 217 transitions. [2022-04-08 10:07:49,809 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:49,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 168 states and 217 transitions. [2022-04-08 10:07:50,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 217 transitions. [2022-04-08 10:07:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 10:07:50,274 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:50,274 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:50,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Ended with exit code 0 [2022-04-08 10:07:50,474 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:50,475 INFO L403 AbstractCegarLoop]: === Iteration 91 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:50,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:50,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1353729153, now seen corresponding path program 171 times [2022-04-08 10:07:50,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:50,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [584163547] [2022-04-08 10:07:50,477 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:50,477 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:50,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1353729153, now seen corresponding path program 172 times [2022-04-08 10:07:50,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:50,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122595413] [2022-04-08 10:07:50,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:50,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:50,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:50,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {89241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {89219#true} is VALID [2022-04-08 10:07:50,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {89219#true} assume true; {89219#true} is VALID [2022-04-08 10:07:50,738 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89219#true} {89219#true} #61#return; {89219#true} is VALID [2022-04-08 10:07:50,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {89219#true} call ULTIMATE.init(); {89241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:50,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {89241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {89219#true} is VALID [2022-04-08 10:07:50,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {89219#true} assume true; {89219#true} is VALID [2022-04-08 10:07:50,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89219#true} {89219#true} #61#return; {89219#true} is VALID [2022-04-08 10:07:50,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {89219#true} call #t~ret11 := main(); {89219#true} is VALID [2022-04-08 10:07:50,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {89219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {89224#(= main_~y~0 0)} is VALID [2022-04-08 10:07:50,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {89224#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:50,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {89225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:50,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {89226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89227#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:50,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {89227#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89228#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:50,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {89228#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89229#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:50,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {89229#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89230#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:50,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {89230#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89231#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:50,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {89231#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:50,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {89232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89233#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:50,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {89233#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89234#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:50,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {89234#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89235#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:50,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {89235#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:50,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {89236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89237#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:50,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {89237#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {89237#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:50,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {89237#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {89238#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:07:50,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {89238#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89239#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:07:50,747 INFO L290 TraceCheckUtils]: 22: Hoare triple {89239#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89240#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:50,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {89240#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {89220#false} is VALID [2022-04-08 10:07:50,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:50,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:50,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:50,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:50,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:50,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:50,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:50,748 INFO L290 TraceCheckUtils]: 31: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:50,748 INFO L290 TraceCheckUtils]: 32: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:50,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:50,748 INFO L290 TraceCheckUtils]: 34: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:50,748 INFO L290 TraceCheckUtils]: 35: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:50,748 INFO L290 TraceCheckUtils]: 36: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:50,748 INFO L290 TraceCheckUtils]: 37: Hoare triple {89220#false} assume !(~y~0 % 4294967296 > 0); {89220#false} is VALID [2022-04-08 10:07:50,748 INFO L272 TraceCheckUtils]: 38: Hoare triple {89220#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {89220#false} is VALID [2022-04-08 10:07:50,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {89220#false} ~cond := #in~cond; {89220#false} is VALID [2022-04-08 10:07:50,748 INFO L290 TraceCheckUtils]: 40: Hoare triple {89220#false} assume 0 == ~cond; {89220#false} is VALID [2022-04-08 10:07:50,748 INFO L290 TraceCheckUtils]: 41: Hoare triple {89220#false} assume !false; {89220#false} is VALID [2022-04-08 10:07:50,748 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:07:50,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:50,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122595413] [2022-04-08 10:07:50,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122595413] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:50,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135647036] [2022-04-08 10:07:50,749 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:50,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:50,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:50,750 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:50,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-04-08 10:07:50,802 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:50,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:50,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 10:07:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:50,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:51,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {89219#true} call ULTIMATE.init(); {89219#true} is VALID [2022-04-08 10:07:51,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {89219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {89219#true} is VALID [2022-04-08 10:07:51,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {89219#true} assume true; {89219#true} is VALID [2022-04-08 10:07:51,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89219#true} {89219#true} #61#return; {89219#true} is VALID [2022-04-08 10:07:51,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {89219#true} call #t~ret11 := main(); {89219#true} is VALID [2022-04-08 10:07:51,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {89219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {89224#(= main_~y~0 0)} is VALID [2022-04-08 10:07:51,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {89224#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:51,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {89225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:51,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {89226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89227#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:51,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {89227#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89228#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:51,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {89228#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89229#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:51,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {89229#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89230#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:51,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {89230#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89231#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:51,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {89231#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:51,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {89232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89233#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:51,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {89233#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89234#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:51,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {89234#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89235#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:51,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {89235#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:51,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {89236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89237#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:51,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {89237#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {89237#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:51,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {89237#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {89238#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:07:51,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {89238#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89239#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:07:51,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {89239#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89311#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:51,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {89311#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {89220#false} is VALID [2022-04-08 10:07:51,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,135 INFO L290 TraceCheckUtils]: 31: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,135 INFO L290 TraceCheckUtils]: 32: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,135 INFO L290 TraceCheckUtils]: 33: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,136 INFO L290 TraceCheckUtils]: 34: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,136 INFO L290 TraceCheckUtils]: 35: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,136 INFO L290 TraceCheckUtils]: 36: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,136 INFO L290 TraceCheckUtils]: 37: Hoare triple {89220#false} assume !(~y~0 % 4294967296 > 0); {89220#false} is VALID [2022-04-08 10:07:51,136 INFO L272 TraceCheckUtils]: 38: Hoare triple {89220#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {89220#false} is VALID [2022-04-08 10:07:51,136 INFO L290 TraceCheckUtils]: 39: Hoare triple {89220#false} ~cond := #in~cond; {89220#false} is VALID [2022-04-08 10:07:51,136 INFO L290 TraceCheckUtils]: 40: Hoare triple {89220#false} assume 0 == ~cond; {89220#false} is VALID [2022-04-08 10:07:51,136 INFO L290 TraceCheckUtils]: 41: Hoare triple {89220#false} assume !false; {89220#false} is VALID [2022-04-08 10:07:51,136 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:07:51,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:51,649 INFO L290 TraceCheckUtils]: 41: Hoare triple {89220#false} assume !false; {89220#false} is VALID [2022-04-08 10:07:51,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {89220#false} assume 0 == ~cond; {89220#false} is VALID [2022-04-08 10:07:51,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {89220#false} ~cond := #in~cond; {89220#false} is VALID [2022-04-08 10:07:51,649 INFO L272 TraceCheckUtils]: 38: Hoare triple {89220#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {89220#false} is VALID [2022-04-08 10:07:51,649 INFO L290 TraceCheckUtils]: 37: Hoare triple {89220#false} assume !(~y~0 % 4294967296 > 0); {89220#false} is VALID [2022-04-08 10:07:51,649 INFO L290 TraceCheckUtils]: 36: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,649 INFO L290 TraceCheckUtils]: 34: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,649 INFO L290 TraceCheckUtils]: 33: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-08 10:07:51,650 INFO L290 TraceCheckUtils]: 23: Hoare triple {89423#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {89220#false} is VALID [2022-04-08 10:07:51,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {89427#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89423#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:51,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {89431#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89427#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:51,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {89435#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {89431#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:51,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {89435#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {89435#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:51,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {89442#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89435#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:51,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {89446#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89442#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:51,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {89450#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89446#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:51,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {89454#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89450#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:51,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {89458#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89454#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:51,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {89462#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89458#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:51,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {89466#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89462#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:51,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {89470#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89466#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:51,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {89474#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89470#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:51,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {89478#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89474#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:51,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {89482#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89478#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:07:51,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {89486#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89482#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:07:51,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {89490#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89486#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:07:51,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {89219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {89490#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:07:51,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {89219#true} call #t~ret11 := main(); {89219#true} is VALID [2022-04-08 10:07:51,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89219#true} {89219#true} #61#return; {89219#true} is VALID [2022-04-08 10:07:51,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {89219#true} assume true; {89219#true} is VALID [2022-04-08 10:07:51,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {89219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {89219#true} is VALID [2022-04-08 10:07:51,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {89219#true} call ULTIMATE.init(); {89219#true} is VALID [2022-04-08 10:07:51,661 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:07:51,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135647036] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:51,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:51,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-08 10:07:51,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:51,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [584163547] [2022-04-08 10:07:51,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [584163547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:51,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:51,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:07:51,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694422803] [2022-04-08 10:07:51,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:51,662 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 10:07:51,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:51,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:51,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:51,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:07:51,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:51,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:07:51,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1125, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:07:51,681 INFO L87 Difference]: Start difference. First operand 168 states and 217 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:53,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:53,731 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2022-04-08 10:07:53,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:07:53,731 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 10:07:53,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:53,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:53,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-08 10:07:53,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:53,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-08 10:07:53,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 75 transitions. [2022-04-08 10:07:53,801 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-08 10:07:53,803 INFO L225 Difference]: With dead ends: 203 [2022-04-08 10:07:53,803 INFO L226 Difference]: Without dead ends: 184 [2022-04-08 10:07:53,803 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=674, Invalid=2632, Unknown=0, NotChecked=0, Total=3306 [2022-04-08 10:07:53,804 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:53,804 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 98 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:07:53,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-04-08 10:07:54,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 169. [2022-04-08 10:07:54,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:54,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:54,354 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:54,354 INFO L87 Difference]: Start difference. First operand 184 states. Second operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:54,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:54,355 INFO L93 Difference]: Finished difference Result 184 states and 233 transitions. [2022-04-08 10:07:54,355 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 233 transitions. [2022-04-08 10:07:54,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:54,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:54,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 184 states. [2022-04-08 10:07:54,356 INFO L87 Difference]: Start difference. First operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 184 states. [2022-04-08 10:07:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:54,358 INFO L93 Difference]: Finished difference Result 184 states and 233 transitions. [2022-04-08 10:07:54,358 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 233 transitions. [2022-04-08 10:07:54,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:54,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:54,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:54,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:54,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 218 transitions. [2022-04-08 10:07:54,360 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 218 transitions. Word has length 42 [2022-04-08 10:07:54,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:54,360 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 218 transitions. [2022-04-08 10:07:54,360 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:54,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 218 transitions. [2022-04-08 10:07:54,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 218 transitions. [2022-04-08 10:07:54,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 10:07:54,830 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:54,830 INFO L499 BasicCegarLoop]: trace histogram [25, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:54,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:55,031 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:55,031 INFO L403 AbstractCegarLoop]: === Iteration 92 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:55,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:55,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1080205710, now seen corresponding path program 173 times [2022-04-08 10:07:55,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:55,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [826531784] [2022-04-08 10:07:55,036 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:55,037 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:55,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1080205710, now seen corresponding path program 174 times [2022-04-08 10:07:55,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:55,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421491776] [2022-04-08 10:07:55,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:55,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:55,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:55,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {90696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90663#true} is VALID [2022-04-08 10:07:55,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {90663#true} assume true; {90663#true} is VALID [2022-04-08 10:07:55,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90663#true} {90663#true} #61#return; {90663#true} is VALID [2022-04-08 10:07:55,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {90663#true} call ULTIMATE.init(); {90696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:55,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {90696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90663#true} is VALID [2022-04-08 10:07:55,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {90663#true} assume true; {90663#true} is VALID [2022-04-08 10:07:55,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90663#true} {90663#true} #61#return; {90663#true} is VALID [2022-04-08 10:07:55,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {90663#true} call #t~ret11 := main(); {90663#true} is VALID [2022-04-08 10:07:55,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {90663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90668#(= main_~y~0 0)} is VALID [2022-04-08 10:07:55,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {90668#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90669#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:55,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {90669#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90670#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:55,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {90670#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90671#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:55,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {90671#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90672#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:55,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {90672#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90673#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:55,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {90673#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90674#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:55,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {90674#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90675#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:55,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {90675#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90676#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:55,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {90676#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90677#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:55,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {90677#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90678#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:55,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {90678#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90679#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:55,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {90679#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90680#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:55,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {90680#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90681#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:55,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {90681#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90682#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:07:55,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {90682#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90683#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:07:55,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {90683#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90684#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:07:55,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {90684#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90685#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:07:55,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {90685#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90686#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:07:55,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {90686#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90687#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:07:55,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {90687#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90688#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:07:55,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {90688#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90689#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:07:55,568 INFO L290 TraceCheckUtils]: 27: Hoare triple {90689#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90690#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:07:55,569 INFO L290 TraceCheckUtils]: 28: Hoare triple {90690#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90691#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:07:55,569 INFO L290 TraceCheckUtils]: 29: Hoare triple {90691#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90692#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:07:55,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {90692#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90693#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:07:55,570 INFO L290 TraceCheckUtils]: 31: Hoare triple {90693#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !(~x~0 % 4294967296 > 0); {90693#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:07:55,570 INFO L290 TraceCheckUtils]: 32: Hoare triple {90693#(and (<= 25 main_~y~0) (<= main_~y~0 25))} ~z~0 := ~y~0; {90694#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-08 10:07:55,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {90694#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {90695#(and (<= (div main_~z~0 4294967296) 0) (<= 24 main_~z~0))} is VALID [2022-04-08 10:07:55,571 INFO L290 TraceCheckUtils]: 34: Hoare triple {90695#(and (<= (div main_~z~0 4294967296) 0) (<= 24 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {90664#false} is VALID [2022-04-08 10:07:55,571 INFO L290 TraceCheckUtils]: 35: Hoare triple {90664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {90664#false} is VALID [2022-04-08 10:07:55,571 INFO L290 TraceCheckUtils]: 36: Hoare triple {90664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {90664#false} is VALID [2022-04-08 10:07:55,571 INFO L290 TraceCheckUtils]: 37: Hoare triple {90664#false} assume !(~y~0 % 4294967296 > 0); {90664#false} is VALID [2022-04-08 10:07:55,571 INFO L272 TraceCheckUtils]: 38: Hoare triple {90664#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {90664#false} is VALID [2022-04-08 10:07:55,571 INFO L290 TraceCheckUtils]: 39: Hoare triple {90664#false} ~cond := #in~cond; {90664#false} is VALID [2022-04-08 10:07:55,571 INFO L290 TraceCheckUtils]: 40: Hoare triple {90664#false} assume 0 == ~cond; {90664#false} is VALID [2022-04-08 10:07:55,572 INFO L290 TraceCheckUtils]: 41: Hoare triple {90664#false} assume !false; {90664#false} is VALID [2022-04-08 10:07:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:07:55,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:55,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421491776] [2022-04-08 10:07:55,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421491776] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:55,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651229814] [2022-04-08 10:07:55,572 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:55,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:55,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:55,573 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:55,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-04-08 10:07:55,610 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:07:55,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:55,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 10:07:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:55,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:55,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {90663#true} call ULTIMATE.init(); {90663#true} is VALID [2022-04-08 10:07:55,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {90663#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90663#true} is VALID [2022-04-08 10:07:55,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {90663#true} assume true; {90663#true} is VALID [2022-04-08 10:07:55,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90663#true} {90663#true} #61#return; {90663#true} is VALID [2022-04-08 10:07:55,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {90663#true} call #t~ret11 := main(); {90663#true} is VALID [2022-04-08 10:07:55,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {90663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90663#true} is VALID [2022-04-08 10:07:55,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,851 INFO L290 TraceCheckUtils]: 26: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,851 INFO L290 TraceCheckUtils]: 27: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,851 INFO L290 TraceCheckUtils]: 28: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,851 INFO L290 TraceCheckUtils]: 29: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,851 INFO L290 TraceCheckUtils]: 30: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:55,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {90663#true} assume !(~x~0 % 4294967296 > 0); {90663#true} is VALID [2022-04-08 10:07:55,852 INFO L290 TraceCheckUtils]: 32: Hoare triple {90663#true} ~z~0 := ~y~0; {90796#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:07:55,852 INFO L290 TraceCheckUtils]: 33: Hoare triple {90796#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {90800#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:07:55,853 INFO L290 TraceCheckUtils]: 34: Hoare triple {90800#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {90804#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:07:55,853 INFO L290 TraceCheckUtils]: 35: Hoare triple {90804#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {90808#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:07:55,854 INFO L290 TraceCheckUtils]: 36: Hoare triple {90808#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {90664#false} is VALID [2022-04-08 10:07:55,854 INFO L290 TraceCheckUtils]: 37: Hoare triple {90664#false} assume !(~y~0 % 4294967296 > 0); {90664#false} is VALID [2022-04-08 10:07:55,854 INFO L272 TraceCheckUtils]: 38: Hoare triple {90664#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {90664#false} is VALID [2022-04-08 10:07:55,854 INFO L290 TraceCheckUtils]: 39: Hoare triple {90664#false} ~cond := #in~cond; {90664#false} is VALID [2022-04-08 10:07:55,854 INFO L290 TraceCheckUtils]: 40: Hoare triple {90664#false} assume 0 == ~cond; {90664#false} is VALID [2022-04-08 10:07:55,854 INFO L290 TraceCheckUtils]: 41: Hoare triple {90664#false} assume !false; {90664#false} is VALID [2022-04-08 10:07:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-04-08 10:07:55,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:56,015 INFO L290 TraceCheckUtils]: 41: Hoare triple {90664#false} assume !false; {90664#false} is VALID [2022-04-08 10:07:56,016 INFO L290 TraceCheckUtils]: 40: Hoare triple {90664#false} assume 0 == ~cond; {90664#false} is VALID [2022-04-08 10:07:56,016 INFO L290 TraceCheckUtils]: 39: Hoare triple {90664#false} ~cond := #in~cond; {90664#false} is VALID [2022-04-08 10:07:56,016 INFO L272 TraceCheckUtils]: 38: Hoare triple {90664#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {90664#false} is VALID [2022-04-08 10:07:56,016 INFO L290 TraceCheckUtils]: 37: Hoare triple {90664#false} assume !(~y~0 % 4294967296 > 0); {90664#false} is VALID [2022-04-08 10:07:56,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {90808#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {90664#false} is VALID [2022-04-08 10:07:56,017 INFO L290 TraceCheckUtils]: 35: Hoare triple {90804#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {90808#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:07:56,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {90848#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {90804#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:07:56,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {90852#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {90848#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:07:56,019 INFO L290 TraceCheckUtils]: 32: Hoare triple {90663#true} ~z~0 := ~y~0; {90852#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:07:56,019 INFO L290 TraceCheckUtils]: 31: Hoare triple {90663#true} assume !(~x~0 % 4294967296 > 0); {90663#true} is VALID [2022-04-08 10:07:56,019 INFO L290 TraceCheckUtils]: 30: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,019 INFO L290 TraceCheckUtils]: 29: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,019 INFO L290 TraceCheckUtils]: 28: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,019 INFO L290 TraceCheckUtils]: 27: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,019 INFO L290 TraceCheckUtils]: 26: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,019 INFO L290 TraceCheckUtils]: 25: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,019 INFO L290 TraceCheckUtils]: 24: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {90663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90663#true} is VALID [2022-04-08 10:07:56,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {90663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90663#true} is VALID [2022-04-08 10:07:56,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {90663#true} call #t~ret11 := main(); {90663#true} is VALID [2022-04-08 10:07:56,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90663#true} {90663#true} #61#return; {90663#true} is VALID [2022-04-08 10:07:56,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {90663#true} assume true; {90663#true} is VALID [2022-04-08 10:07:56,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {90663#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90663#true} is VALID [2022-04-08 10:07:56,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {90663#true} call ULTIMATE.init(); {90663#true} is VALID [2022-04-08 10:07:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-04-08 10:07:56,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651229814] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:56,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:56,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 6, 6] total 37 [2022-04-08 10:07:56,021 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:56,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [826531784] [2022-04-08 10:07:56,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [826531784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:56,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:56,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-08 10:07:56,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354484402] [2022-04-08 10:07:56,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:56,021 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 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 42 [2022-04-08 10:07:56,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:56,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 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-08 10:07:56,045 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-08 10:07:56,046 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-08 10:07:56,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:56,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-08 10:07:56,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1248, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 10:07:56,046 INFO L87 Difference]: Start difference. First operand 169 states and 218 transitions. Second operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 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-08 10:08:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:01,853 INFO L93 Difference]: Finished difference Result 269 states and 390 transitions. [2022-04-08 10:08:01,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 10:08:01,853 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 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 42 [2022-04-08 10:08:01,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 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-08 10:08:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 169 transitions. [2022-04-08 10:08:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 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-08 10:08:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 169 transitions. [2022-04-08 10:08:01,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 169 transitions. [2022-04-08 10:08:01,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:01,992 INFO L225 Difference]: With dead ends: 269 [2022-04-08 10:08:01,992 INFO L226 Difference]: Without dead ends: 261 [2022-04-08 10:08:01,992 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=219, Invalid=4071, Unknown=0, NotChecked=0, Total=4290 [2022-04-08 10:08:01,992 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 139 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3341 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 3452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 3341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:01,992 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 198 Invalid, 3452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 3341 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 10:08:01,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-08 10:08:02,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 175. [2022-04-08 10:08:02,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:02,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 175 states, 170 states have (on average 1.3058823529411765) internal successors, (222), 170 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:02,563 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 175 states, 170 states have (on average 1.3058823529411765) internal successors, (222), 170 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:02,563 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 175 states, 170 states have (on average 1.3058823529411765) internal successors, (222), 170 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:02,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:02,565 INFO L93 Difference]: Finished difference Result 261 states and 320 transitions. [2022-04-08 10:08:02,565 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 320 transitions. [2022-04-08 10:08:02,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:02,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:02,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 170 states have (on average 1.3058823529411765) internal successors, (222), 170 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-08 10:08:02,566 INFO L87 Difference]: Start difference. First operand has 175 states, 170 states have (on average 1.3058823529411765) internal successors, (222), 170 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-08 10:08:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:02,569 INFO L93 Difference]: Finished difference Result 261 states and 320 transitions. [2022-04-08 10:08:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 320 transitions. [2022-04-08 10:08:02,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:02,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:02,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:02,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:02,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 170 states have (on average 1.3058823529411765) internal successors, (222), 170 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 226 transitions. [2022-04-08 10:08:02,571 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 226 transitions. Word has length 42 [2022-04-08 10:08:02,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:02,571 INFO L478 AbstractCegarLoop]: Abstraction has 175 states and 226 transitions. [2022-04-08 10:08:02,571 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 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-08 10:08:02,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 175 states and 226 transitions. [2022-04-08 10:08:03,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:03,065 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 226 transitions. [2022-04-08 10:08:03,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 10:08:03,065 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:03,065 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:03,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Forceful destruction successful, exit code 0 [2022-04-08 10:08:03,265 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable91 [2022-04-08 10:08:03,266 INFO L403 AbstractCegarLoop]: === Iteration 93 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:03,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:03,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2101683985, now seen corresponding path program 175 times [2022-04-08 10:08:03,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:03,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [619750348] [2022-04-08 10:08:03,268 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:03,268 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:03,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2101683985, now seen corresponding path program 176 times [2022-04-08 10:08:03,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:03,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728226579] [2022-04-08 10:08:03,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:03,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:03,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:03,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {92448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {92422#true} is VALID [2022-04-08 10:08:03,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {92422#true} assume true; {92422#true} is VALID [2022-04-08 10:08:03,646 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {92422#true} {92422#true} #61#return; {92422#true} is VALID [2022-04-08 10:08:03,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {92422#true} call ULTIMATE.init(); {92448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:03,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {92448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {92422#true} is VALID [2022-04-08 10:08:03,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {92422#true} assume true; {92422#true} is VALID [2022-04-08 10:08:03,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92422#true} {92422#true} #61#return; {92422#true} is VALID [2022-04-08 10:08:03,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {92422#true} call #t~ret11 := main(); {92422#true} is VALID [2022-04-08 10:08:03,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {92422#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {92427#(= main_~y~0 0)} is VALID [2022-04-08 10:08:03,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {92427#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92428#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:03,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {92428#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92429#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:03,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {92429#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92430#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:03,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {92430#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92431#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:03,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {92431#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92432#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:03,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {92432#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92433#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:03,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {92433#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92434#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:03,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {92434#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92435#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:03,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {92435#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92436#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:03,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {92436#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:03,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {92437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {92437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:03,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {92437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {92438#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:08:03,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {92438#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92439#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:08:03,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {92439#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92440#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:08:03,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {92440#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92441#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:03,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {92441#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92442#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:03,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {92442#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92443#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:03,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {92443#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92444#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:08:03,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {92444#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92445#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:08:03,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {92445#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92446#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:08:03,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {92446#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92447#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:08:03,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {92447#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {92423#false} is VALID [2022-04-08 10:08:03,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-08 10:08:03,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-08 10:08:03,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-08 10:08:03,657 INFO L290 TraceCheckUtils]: 31: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-08 10:08:03,657 INFO L290 TraceCheckUtils]: 32: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-08 10:08:03,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-08 10:08:03,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-08 10:08:03,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-08 10:08:03,658 INFO L290 TraceCheckUtils]: 36: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-08 10:08:03,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-08 10:08:03,658 INFO L290 TraceCheckUtils]: 38: Hoare triple {92423#false} assume !(~y~0 % 4294967296 > 0); {92423#false} is VALID [2022-04-08 10:08:03,658 INFO L272 TraceCheckUtils]: 39: Hoare triple {92423#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {92423#false} is VALID [2022-04-08 10:08:03,658 INFO L290 TraceCheckUtils]: 40: Hoare triple {92423#false} ~cond := #in~cond; {92423#false} is VALID [2022-04-08 10:08:03,658 INFO L290 TraceCheckUtils]: 41: Hoare triple {92423#false} assume 0 == ~cond; {92423#false} is VALID [2022-04-08 10:08:03,658 INFO L290 TraceCheckUtils]: 42: Hoare triple {92423#false} assume !false; {92423#false} is VALID [2022-04-08 10:08:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:08:03,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:03,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728226579] [2022-04-08 10:08:03,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728226579] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:03,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375401446] [2022-04-08 10:08:03,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:08:03,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:03,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:03,659 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:03,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-04-08 10:08:03,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:08:03,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:03,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 62 conjunts are in the unsatisfiable core [2022-04-08 10:08:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:03,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:04,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {92422#true} call ULTIMATE.init(); {92422#true} is VALID [2022-04-08 10:08:04,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {92422#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {92422#true} is VALID [2022-04-08 10:08:04,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {92422#true} assume true; {92422#true} is VALID [2022-04-08 10:08:04,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92422#true} {92422#true} #61#return; {92422#true} is VALID [2022-04-08 10:08:04,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {92422#true} call #t~ret11 := main(); {92422#true} is VALID [2022-04-08 10:08:04,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {92422#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {92427#(= main_~y~0 0)} is VALID [2022-04-08 10:08:04,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {92427#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92428#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:04,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {92428#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92429#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:04,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {92429#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92430#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:04,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {92430#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92431#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:04,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {92431#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92432#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:04,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {92432#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92433#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:04,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {92433#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92434#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:04,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {92434#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92435#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:04,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {92435#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92436#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:04,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {92436#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:04,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {92437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {92437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:04,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {92437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {92503#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:04,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {92503#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92507#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:08:04,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {92507#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92511#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:04,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {92511#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92515#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:04,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {92515#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92519#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-08 10:08:04,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {92519#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92523#(and (<= main_~y~0 10) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:04,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {92523#(and (<= main_~y~0 10) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92527#(and (<= main_~y~0 10) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:04,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {92527#(and (<= main_~y~0 10) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92531#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)))} is VALID [2022-04-08 10:08:04,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {92531#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92535#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)))} is VALID [2022-04-08 10:08:04,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {92535#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92539#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 3)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:04,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {92539#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 3)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {92423#false} is VALID [2022-04-08 10:08:04,191 INFO L290 TraceCheckUtils]: 28: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-08 10:08:04,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-08 10:08:04,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-08 10:08:04,191 INFO L290 TraceCheckUtils]: 31: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-08 10:08:04,191 INFO L290 TraceCheckUtils]: 32: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-08 10:08:04,191 INFO L290 TraceCheckUtils]: 33: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-08 10:08:04,191 INFO L290 TraceCheckUtils]: 34: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-08 10:08:04,191 INFO L290 TraceCheckUtils]: 35: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-08 10:08:04,192 INFO L290 TraceCheckUtils]: 36: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-08 10:08:04,192 INFO L290 TraceCheckUtils]: 37: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-08 10:08:04,192 INFO L290 TraceCheckUtils]: 38: Hoare triple {92423#false} assume !(~y~0 % 4294967296 > 0); {92423#false} is VALID [2022-04-08 10:08:04,192 INFO L272 TraceCheckUtils]: 39: Hoare triple {92423#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {92423#false} is VALID [2022-04-08 10:08:04,192 INFO L290 TraceCheckUtils]: 40: Hoare triple {92423#false} ~cond := #in~cond; {92423#false} is VALID [2022-04-08 10:08:04,192 INFO L290 TraceCheckUtils]: 41: Hoare triple {92423#false} assume 0 == ~cond; {92423#false} is VALID [2022-04-08 10:08:04,192 INFO L290 TraceCheckUtils]: 42: Hoare triple {92423#false} assume !false; {92423#false} is VALID [2022-04-08 10:08:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:08:04,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:04,975 INFO L290 TraceCheckUtils]: 42: Hoare triple {92423#false} assume !false; {92423#false} is VALID [2022-04-08 10:08:04,975 INFO L290 TraceCheckUtils]: 41: Hoare triple {92423#false} assume 0 == ~cond; {92423#false} is VALID [2022-04-08 10:08:04,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {92423#false} ~cond := #in~cond; {92423#false} is VALID [2022-04-08 10:08:04,975 INFO L272 TraceCheckUtils]: 39: Hoare triple {92423#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {92423#false} is VALID [2022-04-08 10:08:04,975 INFO L290 TraceCheckUtils]: 38: Hoare triple {92423#false} assume !(~y~0 % 4294967296 > 0); {92423#false} is VALID [2022-04-08 10:08:04,975 INFO L290 TraceCheckUtils]: 37: Hoare triple {92603#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-08 10:08:04,976 INFO L290 TraceCheckUtils]: 36: Hoare triple {92607#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92603#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:08:04,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {92611#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92607#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:08:04,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {92615#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92611#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:08:04,979 INFO L290 TraceCheckUtils]: 33: Hoare triple {92619#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92615#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:08:04,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {92623#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92619#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:08:04,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {92627#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92623#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:08:04,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {92631#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92627#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:08:04,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {92635#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92631#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:08:04,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {92639#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92635#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:08:04,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {92643#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {92639#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} is VALID [2022-04-08 10:08:04,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {92647#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92643#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:08:04,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {92651#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92647#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:08:04,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {92655#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92651#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:08:04,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {92659#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92655#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:08:04,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {92663#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92659#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:08:04,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {92667#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92663#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:08:04,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {92671#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92667#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:08:04,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {92675#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92671#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:08:04,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {92679#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92675#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:08:04,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {92422#true} ~z~0 := ~y~0; {92679#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-08 10:08:04,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {92422#true} assume !(~x~0 % 4294967296 > 0); {92422#true} is VALID [2022-04-08 10:08:04,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {92422#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92422#true} is VALID [2022-04-08 10:08:04,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {92422#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92422#true} is VALID [2022-04-08 10:08:04,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {92422#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92422#true} is VALID [2022-04-08 10:08:04,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {92422#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92422#true} is VALID [2022-04-08 10:08:04,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {92422#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92422#true} is VALID [2022-04-08 10:08:04,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {92422#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92422#true} is VALID [2022-04-08 10:08:04,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {92422#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92422#true} is VALID [2022-04-08 10:08:04,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {92422#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92422#true} is VALID [2022-04-08 10:08:04,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {92422#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92422#true} is VALID [2022-04-08 10:08:04,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {92422#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92422#true} is VALID [2022-04-08 10:08:04,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {92422#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {92422#true} is VALID [2022-04-08 10:08:04,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {92422#true} call #t~ret11 := main(); {92422#true} is VALID [2022-04-08 10:08:04,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92422#true} {92422#true} #61#return; {92422#true} is VALID [2022-04-08 10:08:04,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {92422#true} assume true; {92422#true} is VALID [2022-04-08 10:08:04,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {92422#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {92422#true} is VALID [2022-04-08 10:08:04,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {92422#true} call ULTIMATE.init(); {92422#true} is VALID [2022-04-08 10:08:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:08:04,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375401446] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:04,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:04,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 22] total 54 [2022-04-08 10:08:04,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:04,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [619750348] [2022-04-08 10:08:04,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [619750348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:04,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:04,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:08:04,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532513748] [2022-04-08 10:08:04,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:04,994 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-08 10:08:04,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:04,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:05,017 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-08 10:08:05,017 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:08:05,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:05,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:08:05,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=2515, Unknown=0, NotChecked=0, Total=2862 [2022-04-08 10:08:05,017 INFO L87 Difference]: Start difference. First operand 175 states and 226 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:07,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:07,065 INFO L93 Difference]: Finished difference Result 204 states and 255 transitions. [2022-04-08 10:08:07,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:08:07,065 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-08 10:08:07,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:07,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 61 transitions. [2022-04-08 10:08:07,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 61 transitions. [2022-04-08 10:08:07,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 61 transitions. [2022-04-08 10:08:07,114 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-08 10:08:07,116 INFO L225 Difference]: With dead ends: 204 [2022-04-08 10:08:07,116 INFO L226 Difference]: Without dead ends: 188 [2022-04-08 10:08:07,116 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=581, Invalid=4969, Unknown=0, NotChecked=0, Total=5550 [2022-04-08 10:08:07,117 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:07,117 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 83 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:08:07,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-04-08 10:08:07,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 176. [2022-04-08 10:08:07,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:07,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 176 states, 171 states have (on average 1.304093567251462) internal successors, (223), 171 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:07,710 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 176 states, 171 states have (on average 1.304093567251462) internal successors, (223), 171 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:07,710 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 176 states, 171 states have (on average 1.304093567251462) internal successors, (223), 171 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:07,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:07,712 INFO L93 Difference]: Finished difference Result 188 states and 239 transitions. [2022-04-08 10:08:07,712 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 239 transitions. [2022-04-08 10:08:07,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:07,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:07,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 176 states, 171 states have (on average 1.304093567251462) internal successors, (223), 171 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 188 states. [2022-04-08 10:08:07,713 INFO L87 Difference]: Start difference. First operand has 176 states, 171 states have (on average 1.304093567251462) internal successors, (223), 171 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 188 states. [2022-04-08 10:08:07,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:07,715 INFO L93 Difference]: Finished difference Result 188 states and 239 transitions. [2022-04-08 10:08:07,715 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 239 transitions. [2022-04-08 10:08:07,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:07,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:07,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:07,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 171 states have (on average 1.304093567251462) internal successors, (223), 171 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:07,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 227 transitions. [2022-04-08 10:08:07,717 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 227 transitions. Word has length 43 [2022-04-08 10:08:07,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:07,717 INFO L478 AbstractCegarLoop]: Abstraction has 176 states and 227 transitions. [2022-04-08 10:08:07,717 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:07,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 176 states and 227 transitions. [2022-04-08 10:08:08,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:08,199 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 227 transitions. [2022-04-08 10:08:08,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 10:08:08,199 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:08,199 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:08,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Ended with exit code 0 [2022-04-08 10:08:08,399 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:08,399 INFO L403 AbstractCegarLoop]: === Iteration 94 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:08,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:08,400 INFO L85 PathProgramCache]: Analyzing trace with hash 396811007, now seen corresponding path program 177 times [2022-04-08 10:08:08,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:08,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1745084160] [2022-04-08 10:08:08,402 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:08,402 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:08,402 INFO L85 PathProgramCache]: Analyzing trace with hash 396811007, now seen corresponding path program 178 times [2022-04-08 10:08:08,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:08,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388200865] [2022-04-08 10:08:08,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:08,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:08,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:08,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {93939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {93914#true} is VALID [2022-04-08 10:08:08,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {93914#true} assume true; {93914#true} is VALID [2022-04-08 10:08:08,732 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93914#true} {93914#true} #61#return; {93914#true} is VALID [2022-04-08 10:08:08,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {93914#true} call ULTIMATE.init(); {93939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:08,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {93939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {93914#true} is VALID [2022-04-08 10:08:08,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {93914#true} assume true; {93914#true} is VALID [2022-04-08 10:08:08,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93914#true} {93914#true} #61#return; {93914#true} is VALID [2022-04-08 10:08:08,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {93914#true} call #t~ret11 := main(); {93914#true} is VALID [2022-04-08 10:08:08,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {93914#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {93919#(= main_~y~0 0)} is VALID [2022-04-08 10:08:08,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {93919#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93920#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:08,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {93920#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93921#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:08,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {93921#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93922#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:08,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {93922#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93923#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:08,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {93923#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93924#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:08,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {93924#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93925#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:08,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {93925#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93926#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:08,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {93926#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93927#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:08,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {93927#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93928#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:08,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {93928#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93929#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:08,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {93929#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93930#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:08,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {93930#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {93930#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:08,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {93930#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {93931#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:08:08,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {93931#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93932#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:08:08,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {93932#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93933#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:08:08,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {93933#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93934#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:08:08,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {93934#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93935#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:08,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {93935#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93936#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:08,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {93936#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93937#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:08,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {93937#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93938#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:08,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {93938#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {93915#false} is VALID [2022-04-08 10:08:08,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:08,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:08,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:08,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:08,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:08,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:08,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:08,743 INFO L290 TraceCheckUtils]: 34: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:08,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:08,744 INFO L290 TraceCheckUtils]: 36: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:08,744 INFO L290 TraceCheckUtils]: 37: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:08,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {93915#false} assume !(~y~0 % 4294967296 > 0); {93915#false} is VALID [2022-04-08 10:08:08,744 INFO L272 TraceCheckUtils]: 39: Hoare triple {93915#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {93915#false} is VALID [2022-04-08 10:08:08,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {93915#false} ~cond := #in~cond; {93915#false} is VALID [2022-04-08 10:08:08,744 INFO L290 TraceCheckUtils]: 41: Hoare triple {93915#false} assume 0 == ~cond; {93915#false} is VALID [2022-04-08 10:08:08,744 INFO L290 TraceCheckUtils]: 42: Hoare triple {93915#false} assume !false; {93915#false} is VALID [2022-04-08 10:08:08,744 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:08:08,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:08,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388200865] [2022-04-08 10:08:08,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388200865] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:08,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113590881] [2022-04-08 10:08:08,744 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:08:08,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:08,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:08,745 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:08,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2022-04-08 10:08:08,799 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:08:08,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:08,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 10:08:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:08,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:09,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {93914#true} call ULTIMATE.init(); {93914#true} is VALID [2022-04-08 10:08:09,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {93914#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {93914#true} is VALID [2022-04-08 10:08:09,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {93914#true} assume true; {93914#true} is VALID [2022-04-08 10:08:09,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93914#true} {93914#true} #61#return; {93914#true} is VALID [2022-04-08 10:08:09,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {93914#true} call #t~ret11 := main(); {93914#true} is VALID [2022-04-08 10:08:09,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {93914#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {93919#(= main_~y~0 0)} is VALID [2022-04-08 10:08:09,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {93919#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93920#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:09,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {93920#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93921#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:09,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {93921#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93922#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:09,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {93922#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93923#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:09,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {93923#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93924#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:09,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {93924#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93925#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:09,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {93925#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93926#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:09,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {93926#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93927#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:09,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {93927#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93928#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:09,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {93928#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93929#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:09,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {93929#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93930#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:09,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {93930#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {93930#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:09,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {93930#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {93931#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:08:09,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {93931#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93932#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:08:09,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {93932#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93933#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:08:09,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {93933#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93934#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:08:09,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {93934#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93935#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:09,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {93935#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93936#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:09,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {93936#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93937#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:09,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {93937#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94018#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:08:09,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {94018#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {93915#false} is VALID [2022-04-08 10:08:09,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,137 INFO L290 TraceCheckUtils]: 28: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,137 INFO L290 TraceCheckUtils]: 29: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,137 INFO L290 TraceCheckUtils]: 31: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,138 INFO L290 TraceCheckUtils]: 35: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,138 INFO L290 TraceCheckUtils]: 37: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,138 INFO L290 TraceCheckUtils]: 38: Hoare triple {93915#false} assume !(~y~0 % 4294967296 > 0); {93915#false} is VALID [2022-04-08 10:08:09,138 INFO L272 TraceCheckUtils]: 39: Hoare triple {93915#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {93915#false} is VALID [2022-04-08 10:08:09,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {93915#false} ~cond := #in~cond; {93915#false} is VALID [2022-04-08 10:08:09,138 INFO L290 TraceCheckUtils]: 41: Hoare triple {93915#false} assume 0 == ~cond; {93915#false} is VALID [2022-04-08 10:08:09,138 INFO L290 TraceCheckUtils]: 42: Hoare triple {93915#false} assume !false; {93915#false} is VALID [2022-04-08 10:08:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:08:09,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:09,761 INFO L290 TraceCheckUtils]: 42: Hoare triple {93915#false} assume !false; {93915#false} is VALID [2022-04-08 10:08:09,761 INFO L290 TraceCheckUtils]: 41: Hoare triple {93915#false} assume 0 == ~cond; {93915#false} is VALID [2022-04-08 10:08:09,761 INFO L290 TraceCheckUtils]: 40: Hoare triple {93915#false} ~cond := #in~cond; {93915#false} is VALID [2022-04-08 10:08:09,761 INFO L272 TraceCheckUtils]: 39: Hoare triple {93915#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {93915#false} is VALID [2022-04-08 10:08:09,761 INFO L290 TraceCheckUtils]: 38: Hoare triple {93915#false} assume !(~y~0 % 4294967296 > 0); {93915#false} is VALID [2022-04-08 10:08:09,762 INFO L290 TraceCheckUtils]: 37: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,762 INFO L290 TraceCheckUtils]: 36: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,762 INFO L290 TraceCheckUtils]: 35: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-08 10:08:09,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {94118#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {93915#false} is VALID [2022-04-08 10:08:09,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {94122#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94118#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:09,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {94126#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94122#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:09,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {94130#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94126#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:09,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {94134#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94130#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:09,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {94138#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94134#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:08:09,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {94142#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94138#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:08:09,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {94146#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94142#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:08:09,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {94150#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} ~z~0 := ~y~0; {94146#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:08:09,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {94150#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~x~0 % 4294967296 > 0); {94150#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:08:09,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {94157#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94150#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:08:09,769 INFO L290 TraceCheckUtils]: 15: Hoare triple {94161#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94157#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:09,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {94165#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94161#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:09,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {94169#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94165#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:09,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {94173#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94169#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:09,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {94177#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94173#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:09,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {94181#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94177#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:09,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {94185#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94181#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:09,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {94189#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94185#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:09,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {94193#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94189#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:09,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {94197#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94193#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:09,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {93914#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94197#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:09,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {93914#true} call #t~ret11 := main(); {93914#true} is VALID [2022-04-08 10:08:09,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93914#true} {93914#true} #61#return; {93914#true} is VALID [2022-04-08 10:08:09,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {93914#true} assume true; {93914#true} is VALID [2022-04-08 10:08:09,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {93914#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {93914#true} is VALID [2022-04-08 10:08:09,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {93914#true} call ULTIMATE.init(); {93914#true} is VALID [2022-04-08 10:08:09,775 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:08:09,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113590881] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:09,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:09,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-08 10:08:09,776 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:09,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1745084160] [2022-04-08 10:08:09,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1745084160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:09,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:09,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:08:09,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140030017] [2022-04-08 10:08:09,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:09,776 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-08 10:08:09,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:09,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:09,797 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-08 10:08:09,798 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:08:09,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:09,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:08:09,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1599, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:08:09,798 INFO L87 Difference]: Start difference. First operand 176 states and 227 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:12,268 INFO L93 Difference]: Finished difference Result 207 states and 258 transitions. [2022-04-08 10:08:12,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-08 10:08:12,268 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-08 10:08:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 72 transitions. [2022-04-08 10:08:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 72 transitions. [2022-04-08 10:08:12,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 72 transitions. [2022-04-08 10:08:12,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:12,327 INFO L225 Difference]: With dead ends: 207 [2022-04-08 10:08:12,327 INFO L226 Difference]: Without dead ends: 190 [2022-04-08 10:08:12,328 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=879, Invalid=4091, Unknown=0, NotChecked=0, Total=4970 [2022-04-08 10:08:12,328 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:12,328 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 105 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:08:12,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-04-08 10:08:12,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 177. [2022-04-08 10:08:12,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:12,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:12,921 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:12,921 INFO L87 Difference]: Start difference. First operand 190 states. Second operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:12,922 INFO L93 Difference]: Finished difference Result 190 states and 241 transitions. [2022-04-08 10:08:12,922 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 241 transitions. [2022-04-08 10:08:12,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:12,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:12,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 190 states. [2022-04-08 10:08:12,923 INFO L87 Difference]: Start difference. First operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 190 states. [2022-04-08 10:08:12,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:12,925 INFO L93 Difference]: Finished difference Result 190 states and 241 transitions. [2022-04-08 10:08:12,925 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 241 transitions. [2022-04-08 10:08:12,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:12,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:12,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:12,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:12,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:12,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 228 transitions. [2022-04-08 10:08:12,927 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 228 transitions. Word has length 43 [2022-04-08 10:08:12,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:12,927 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 228 transitions. [2022-04-08 10:08:12,927 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:12,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 228 transitions. [2022-04-08 10:08:13,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:13,421 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 228 transitions. [2022-04-08 10:08:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 10:08:13,421 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:13,421 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:13,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Ended with exit code 0 [2022-04-08 10:08:13,622 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:13,622 INFO L403 AbstractCegarLoop]: === Iteration 95 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:13,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:13,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1247400145, now seen corresponding path program 179 times [2022-04-08 10:08:13,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:13,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1928773774] [2022-04-08 10:08:13,624 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:13,624 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:13,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1247400145, now seen corresponding path program 180 times [2022-04-08 10:08:13,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:13,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082299960] [2022-04-08 10:08:13,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:13,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:13,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:13,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {95444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {95420#true} is VALID [2022-04-08 10:08:13,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {95420#true} assume true; {95420#true} is VALID [2022-04-08 10:08:13,995 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95420#true} {95420#true} #61#return; {95420#true} is VALID [2022-04-08 10:08:13,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {95420#true} call ULTIMATE.init(); {95444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:13,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {95444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {95420#true} is VALID [2022-04-08 10:08:13,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {95420#true} assume true; {95420#true} is VALID [2022-04-08 10:08:13,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95420#true} {95420#true} #61#return; {95420#true} is VALID [2022-04-08 10:08:13,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {95420#true} call #t~ret11 := main(); {95420#true} is VALID [2022-04-08 10:08:13,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {95420#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {95425#(= main_~y~0 0)} is VALID [2022-04-08 10:08:13,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {95425#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95426#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:13,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {95426#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95427#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:13,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {95427#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95428#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:13,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {95428#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:13,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {95429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95430#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:14,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {95430#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95431#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:14,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {95431#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95432#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:14,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {95432#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95433#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:14,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {95433#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95434#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:14,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {95434#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95435#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:14,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {95435#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95436#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:14,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {95436#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95437#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:14,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {95437#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {95437#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:14,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {95437#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {95438#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:08:14,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {95438#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95439#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:08:14,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {95439#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95440#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:08:14,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {95440#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95441#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:08:14,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {95441#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95442#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:08:14,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {95442#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95443#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:14,008 INFO L290 TraceCheckUtils]: 25: Hoare triple {95443#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {95421#false} is VALID [2022-04-08 10:08:14,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,008 INFO L290 TraceCheckUtils]: 28: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,009 INFO L290 TraceCheckUtils]: 29: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,009 INFO L290 TraceCheckUtils]: 32: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,009 INFO L290 TraceCheckUtils]: 34: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,009 INFO L290 TraceCheckUtils]: 36: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,009 INFO L290 TraceCheckUtils]: 37: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,009 INFO L290 TraceCheckUtils]: 38: Hoare triple {95421#false} assume !(~y~0 % 4294967296 > 0); {95421#false} is VALID [2022-04-08 10:08:14,009 INFO L272 TraceCheckUtils]: 39: Hoare triple {95421#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {95421#false} is VALID [2022-04-08 10:08:14,009 INFO L290 TraceCheckUtils]: 40: Hoare triple {95421#false} ~cond := #in~cond; {95421#false} is VALID [2022-04-08 10:08:14,009 INFO L290 TraceCheckUtils]: 41: Hoare triple {95421#false} assume 0 == ~cond; {95421#false} is VALID [2022-04-08 10:08:14,009 INFO L290 TraceCheckUtils]: 42: Hoare triple {95421#false} assume !false; {95421#false} is VALID [2022-04-08 10:08:14,010 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:08:14,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:14,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082299960] [2022-04-08 10:08:14,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082299960] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:14,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924699350] [2022-04-08 10:08:14,010 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:08:14,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:14,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:14,011 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:14,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2022-04-08 10:08:14,278 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:08:14,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:14,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 10:08:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:14,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:14,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {95420#true} call ULTIMATE.init(); {95420#true} is VALID [2022-04-08 10:08:14,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {95420#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {95420#true} is VALID [2022-04-08 10:08:14,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {95420#true} assume true; {95420#true} is VALID [2022-04-08 10:08:14,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95420#true} {95420#true} #61#return; {95420#true} is VALID [2022-04-08 10:08:14,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {95420#true} call #t~ret11 := main(); {95420#true} is VALID [2022-04-08 10:08:14,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {95420#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {95425#(= main_~y~0 0)} is VALID [2022-04-08 10:08:14,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {95425#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95426#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:14,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {95426#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95427#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:14,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {95427#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95428#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:14,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {95428#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:14,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {95429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95430#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:14,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {95430#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95431#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:14,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {95431#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95432#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:14,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {95432#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95433#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:14,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {95433#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95434#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:14,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {95434#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95435#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:14,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {95435#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95436#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:14,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {95436#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95437#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:14,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {95437#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {95437#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:14,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {95437#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {95438#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:08:14,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {95438#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95439#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:08:14,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {95439#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95440#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:08:14,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {95440#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95441#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:08:14,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {95441#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95442#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:08:14,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {95442#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95520#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:14,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {95520#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {95421#false} is VALID [2022-04-08 10:08:14,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,593 INFO L290 TraceCheckUtils]: 33: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,593 INFO L290 TraceCheckUtils]: 34: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,594 INFO L290 TraceCheckUtils]: 35: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,594 INFO L290 TraceCheckUtils]: 36: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,594 INFO L290 TraceCheckUtils]: 37: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:14,594 INFO L290 TraceCheckUtils]: 38: Hoare triple {95421#false} assume !(~y~0 % 4294967296 > 0); {95421#false} is VALID [2022-04-08 10:08:14,594 INFO L272 TraceCheckUtils]: 39: Hoare triple {95421#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {95421#false} is VALID [2022-04-08 10:08:14,594 INFO L290 TraceCheckUtils]: 40: Hoare triple {95421#false} ~cond := #in~cond; {95421#false} is VALID [2022-04-08 10:08:14,594 INFO L290 TraceCheckUtils]: 41: Hoare triple {95421#false} assume 0 == ~cond; {95421#false} is VALID [2022-04-08 10:08:14,594 INFO L290 TraceCheckUtils]: 42: Hoare triple {95421#false} assume !false; {95421#false} is VALID [2022-04-08 10:08:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:08:14,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:15,198 INFO L290 TraceCheckUtils]: 42: Hoare triple {95421#false} assume !false; {95421#false} is VALID [2022-04-08 10:08:15,198 INFO L290 TraceCheckUtils]: 41: Hoare triple {95421#false} assume 0 == ~cond; {95421#false} is VALID [2022-04-08 10:08:15,198 INFO L290 TraceCheckUtils]: 40: Hoare triple {95421#false} ~cond := #in~cond; {95421#false} is VALID [2022-04-08 10:08:15,198 INFO L272 TraceCheckUtils]: 39: Hoare triple {95421#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {95421#false} is VALID [2022-04-08 10:08:15,198 INFO L290 TraceCheckUtils]: 38: Hoare triple {95421#false} assume !(~y~0 % 4294967296 > 0); {95421#false} is VALID [2022-04-08 10:08:15,198 INFO L290 TraceCheckUtils]: 37: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:15,198 INFO L290 TraceCheckUtils]: 36: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:15,198 INFO L290 TraceCheckUtils]: 35: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:15,198 INFO L290 TraceCheckUtils]: 34: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:15,198 INFO L290 TraceCheckUtils]: 33: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:15,198 INFO L290 TraceCheckUtils]: 32: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:15,198 INFO L290 TraceCheckUtils]: 31: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:15,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:15,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:15,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:15,199 INFO L290 TraceCheckUtils]: 27: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:15,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-08 10:08:15,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {95626#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {95421#false} is VALID [2022-04-08 10:08:15,201 INFO L290 TraceCheckUtils]: 24: Hoare triple {95630#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95626#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:15,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {95634#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95630#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:15,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {95638#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95634#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:15,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {95642#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95638#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:15,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {95646#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95642#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:08:15,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {95650#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {95646#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:08:15,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {95650#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {95650#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:15,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {95657#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95650#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:15,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {95661#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95657#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:15,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {95665#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95661#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:15,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {95669#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95665#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:15,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {95673#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95669#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:15,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {95677#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95673#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:15,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {95681#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95677#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:15,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {95685#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95681#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:15,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {95689#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95685#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:15,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {95693#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95689#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:15,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {95697#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95693#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:15,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {95701#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95697#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:08:15,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {95420#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {95701#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:15,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {95420#true} call #t~ret11 := main(); {95420#true} is VALID [2022-04-08 10:08:15,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95420#true} {95420#true} #61#return; {95420#true} is VALID [2022-04-08 10:08:15,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {95420#true} assume true; {95420#true} is VALID [2022-04-08 10:08:15,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {95420#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {95420#true} is VALID [2022-04-08 10:08:15,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {95420#true} call ULTIMATE.init(); {95420#true} is VALID [2022-04-08 10:08:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:08:15,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924699350] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:15,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:15,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-08 10:08:15,213 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:15,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1928773774] [2022-04-08 10:08:15,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1928773774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:15,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:15,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:08:15,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964107692] [2022-04-08 10:08:15,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:15,213 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-08 10:08:15,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:15,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:15,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:15,234 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:08:15,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:15,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:08:15,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1430, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:08:15,235 INFO L87 Difference]: Start difference. First operand 177 states and 228 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:17,713 INFO L93 Difference]: Finished difference Result 210 states and 261 transitions. [2022-04-08 10:08:17,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 10:08:17,714 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-08 10:08:17,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:17,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:17,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 78 transitions. [2022-04-08 10:08:17,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 78 transitions. [2022-04-08 10:08:17,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 78 transitions. [2022-04-08 10:08:17,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:17,777 INFO L225 Difference]: With dead ends: 210 [2022-04-08 10:08:17,777 INFO L226 Difference]: Without dead ends: 192 [2022-04-08 10:08:17,778 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=906, Invalid=3924, Unknown=0, NotChecked=0, Total=4830 [2022-04-08 10:08:17,778 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:17,778 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 102 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:08:17,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-04-08 10:08:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 178. [2022-04-08 10:08:18,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:18,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand has 178 states, 173 states have (on average 1.300578034682081) internal successors, (225), 173 states have internal predecessors, (225), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:18,367 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand has 178 states, 173 states have (on average 1.300578034682081) internal successors, (225), 173 states have internal predecessors, (225), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:18,367 INFO L87 Difference]: Start difference. First operand 192 states. Second operand has 178 states, 173 states have (on average 1.300578034682081) internal successors, (225), 173 states have internal predecessors, (225), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:18,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:18,369 INFO L93 Difference]: Finished difference Result 192 states and 243 transitions. [2022-04-08 10:08:18,369 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 243 transitions. [2022-04-08 10:08:18,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:18,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:18,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 173 states have (on average 1.300578034682081) internal successors, (225), 173 states have internal predecessors, (225), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 192 states. [2022-04-08 10:08:18,370 INFO L87 Difference]: Start difference. First operand has 178 states, 173 states have (on average 1.300578034682081) internal successors, (225), 173 states have internal predecessors, (225), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 192 states. [2022-04-08 10:08:18,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:18,371 INFO L93 Difference]: Finished difference Result 192 states and 243 transitions. [2022-04-08 10:08:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 243 transitions. [2022-04-08 10:08:18,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:18,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:18,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:18,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:18,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 173 states have (on average 1.300578034682081) internal successors, (225), 173 states have internal predecessors, (225), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:18,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 229 transitions. [2022-04-08 10:08:18,373 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 229 transitions. Word has length 43 [2022-04-08 10:08:18,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:18,373 INFO L478 AbstractCegarLoop]: Abstraction has 178 states and 229 transitions. [2022-04-08 10:08:18,374 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:18,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 178 states and 229 transitions. [2022-04-08 10:08:18,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 229 transitions. [2022-04-08 10:08:18,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 10:08:18,864 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:18,864 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:18,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Forceful destruction successful, exit code 0 [2022-04-08 10:08:19,064 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:19,065 INFO L403 AbstractCegarLoop]: === Iteration 96 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:19,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:19,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1705851713, now seen corresponding path program 181 times [2022-04-08 10:08:19,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:19,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1233743193] [2022-04-08 10:08:19,069 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:19,069 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:19,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1705851713, now seen corresponding path program 182 times [2022-04-08 10:08:19,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:19,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858668676] [2022-04-08 10:08:19,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:19,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:19,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:19,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {96961#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {96938#true} is VALID [2022-04-08 10:08:19,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {96938#true} assume true; {96938#true} is VALID [2022-04-08 10:08:19,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96938#true} {96938#true} #61#return; {96938#true} is VALID [2022-04-08 10:08:19,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {96938#true} call ULTIMATE.init(); {96961#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:19,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {96961#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {96938#true} is VALID [2022-04-08 10:08:19,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {96938#true} assume true; {96938#true} is VALID [2022-04-08 10:08:19,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96938#true} {96938#true} #61#return; {96938#true} is VALID [2022-04-08 10:08:19,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {96938#true} call #t~ret11 := main(); {96938#true} is VALID [2022-04-08 10:08:19,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {96938#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {96943#(= main_~y~0 0)} is VALID [2022-04-08 10:08:19,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {96943#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96944#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:19,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {96944#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96945#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:19,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {96945#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96946#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:19,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {96946#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96947#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:19,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {96947#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96948#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:19,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {96948#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96949#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:19,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {96949#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96950#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:19,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {96950#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96951#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:19,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {96951#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96952#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:19,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {96952#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96953#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:19,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {96953#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96954#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:19,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {96954#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96955#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:19,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {96955#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96956#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:19,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {96956#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {96956#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:19,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {96956#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {96957#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:08:19,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {96957#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {96958#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:08:19,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {96958#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {96959#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:08:19,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {96959#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {96960#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:19,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {96960#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {96939#false} is VALID [2022-04-08 10:08:19,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,354 INFO L290 TraceCheckUtils]: 30: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,360 INFO L290 TraceCheckUtils]: 34: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,360 INFO L290 TraceCheckUtils]: 37: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,360 INFO L290 TraceCheckUtils]: 38: Hoare triple {96939#false} assume !(~y~0 % 4294967296 > 0); {96939#false} is VALID [2022-04-08 10:08:19,360 INFO L272 TraceCheckUtils]: 39: Hoare triple {96939#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {96939#false} is VALID [2022-04-08 10:08:19,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {96939#false} ~cond := #in~cond; {96939#false} is VALID [2022-04-08 10:08:19,360 INFO L290 TraceCheckUtils]: 41: Hoare triple {96939#false} assume 0 == ~cond; {96939#false} is VALID [2022-04-08 10:08:19,361 INFO L290 TraceCheckUtils]: 42: Hoare triple {96939#false} assume !false; {96939#false} is VALID [2022-04-08 10:08:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:08:19,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:19,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858668676] [2022-04-08 10:08:19,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858668676] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:19,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831018501] [2022-04-08 10:08:19,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:08:19,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:19,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:19,363 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:19,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-04-08 10:08:19,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:08:19,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:19,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 10:08:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:19,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:19,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {96938#true} call ULTIMATE.init(); {96938#true} is VALID [2022-04-08 10:08:19,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {96938#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {96938#true} is VALID [2022-04-08 10:08:19,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {96938#true} assume true; {96938#true} is VALID [2022-04-08 10:08:19,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96938#true} {96938#true} #61#return; {96938#true} is VALID [2022-04-08 10:08:19,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {96938#true} call #t~ret11 := main(); {96938#true} is VALID [2022-04-08 10:08:19,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {96938#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {96943#(= main_~y~0 0)} is VALID [2022-04-08 10:08:19,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {96943#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96944#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:19,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {96944#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96945#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:19,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {96945#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96946#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:19,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {96946#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96947#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:19,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {96947#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96948#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:19,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {96948#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96949#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:19,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {96949#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96950#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:19,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {96950#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96951#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:19,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {96951#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96952#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:19,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {96952#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96953#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:19,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {96953#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96954#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:19,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {96954#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96955#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:19,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {96955#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {96956#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:19,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {96956#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {96956#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:19,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {96956#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {96957#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:08:19,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {96957#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {96958#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:08:19,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {96958#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {96959#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:08:19,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {96959#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97034#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:08:19,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {97034#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {96939#false} is VALID [2022-04-08 10:08:19,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,740 INFO L290 TraceCheckUtils]: 32: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,741 INFO L290 TraceCheckUtils]: 36: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,741 INFO L290 TraceCheckUtils]: 37: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:19,741 INFO L290 TraceCheckUtils]: 38: Hoare triple {96939#false} assume !(~y~0 % 4294967296 > 0); {96939#false} is VALID [2022-04-08 10:08:19,741 INFO L272 TraceCheckUtils]: 39: Hoare triple {96939#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {96939#false} is VALID [2022-04-08 10:08:19,741 INFO L290 TraceCheckUtils]: 40: Hoare triple {96939#false} ~cond := #in~cond; {96939#false} is VALID [2022-04-08 10:08:19,741 INFO L290 TraceCheckUtils]: 41: Hoare triple {96939#false} assume 0 == ~cond; {96939#false} is VALID [2022-04-08 10:08:19,741 INFO L290 TraceCheckUtils]: 42: Hoare triple {96939#false} assume !false; {96939#false} is VALID [2022-04-08 10:08:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:08:19,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:20,297 INFO L290 TraceCheckUtils]: 42: Hoare triple {96939#false} assume !false; {96939#false} is VALID [2022-04-08 10:08:20,298 INFO L290 TraceCheckUtils]: 41: Hoare triple {96939#false} assume 0 == ~cond; {96939#false} is VALID [2022-04-08 10:08:20,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {96939#false} ~cond := #in~cond; {96939#false} is VALID [2022-04-08 10:08:20,298 INFO L272 TraceCheckUtils]: 39: Hoare triple {96939#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {96939#false} is VALID [2022-04-08 10:08:20,298 INFO L290 TraceCheckUtils]: 38: Hoare triple {96939#false} assume !(~y~0 % 4294967296 > 0); {96939#false} is VALID [2022-04-08 10:08:20,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:20,298 INFO L290 TraceCheckUtils]: 36: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:20,298 INFO L290 TraceCheckUtils]: 35: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:20,298 INFO L290 TraceCheckUtils]: 34: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:20,298 INFO L290 TraceCheckUtils]: 33: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:20,298 INFO L290 TraceCheckUtils]: 32: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:20,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:20,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:20,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:20,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:20,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:20,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:20,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-08 10:08:20,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {97146#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {96939#false} is VALID [2022-04-08 10:08:20,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {97150#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97146#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:20,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {97154#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97150#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:20,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {97158#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97154#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:20,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {97162#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {97158#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:20,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {97162#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {97162#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:20,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {97169#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97162#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:20,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {97173#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97169#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:20,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {97177#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97173#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:20,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {97181#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97177#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:20,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {97185#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97181#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:20,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {97189#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97185#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:20,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {97193#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97189#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:20,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {97197#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97193#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:20,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {97201#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97197#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:20,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {97205#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97201#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:08:20,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {97209#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97205#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:20,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {97213#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97209#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:08:20,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {97217#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97213#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:08:20,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {96938#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {97217#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:08:20,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {96938#true} call #t~ret11 := main(); {96938#true} is VALID [2022-04-08 10:08:20,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96938#true} {96938#true} #61#return; {96938#true} is VALID [2022-04-08 10:08:20,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {96938#true} assume true; {96938#true} is VALID [2022-04-08 10:08:20,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {96938#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {96938#true} is VALID [2022-04-08 10:08:20,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {96938#true} call ULTIMATE.init(); {96938#true} is VALID [2022-04-08 10:08:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:08:20,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831018501] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:20,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:20,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-08 10:08:20,311 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:20,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1233743193] [2022-04-08 10:08:20,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1233743193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:20,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:20,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:08:20,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025549173] [2022-04-08 10:08:20,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:20,312 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-08 10:08:20,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:20,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:20,332 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-08 10:08:20,332 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:08:20,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:20,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:08:20,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1267, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:08:20,333 INFO L87 Difference]: Start difference. First operand 178 states and 229 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:22,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:22,743 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2022-04-08 10:08:22,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 10:08:22,743 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-08 10:08:22,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:22,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 79 transitions. [2022-04-08 10:08:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:22,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 79 transitions. [2022-04-08 10:08:22,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 79 transitions. [2022-04-08 10:08:22,807 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-08 10:08:22,809 INFO L225 Difference]: With dead ends: 213 [2022-04-08 10:08:22,809 INFO L226 Difference]: Without dead ends: 194 [2022-04-08 10:08:22,809 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=793, Invalid=3239, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 10:08:22,810 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:22,810 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 109 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:08:22,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-08 10:08:23,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 179. [2022-04-08 10:08:23,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:23,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 174 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:23,405 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 174 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:23,405 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 174 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:23,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:23,407 INFO L93 Difference]: Finished difference Result 194 states and 245 transitions. [2022-04-08 10:08:23,407 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 245 transitions. [2022-04-08 10:08:23,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:23,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:23,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 174 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-08 10:08:23,408 INFO L87 Difference]: Start difference. First operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 174 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-08 10:08:23,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:23,410 INFO L93 Difference]: Finished difference Result 194 states and 245 transitions. [2022-04-08 10:08:23,410 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 245 transitions. [2022-04-08 10:08:23,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:23,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:23,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:23,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:23,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 174 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:23,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 230 transitions. [2022-04-08 10:08:23,412 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 230 transitions. Word has length 43 [2022-04-08 10:08:23,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:23,412 INFO L478 AbstractCegarLoop]: Abstraction has 179 states and 230 transitions. [2022-04-08 10:08:23,412 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:23,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 179 states and 230 transitions. [2022-04-08 10:08:23,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 230 transitions. [2022-04-08 10:08:23,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 10:08:23,909 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:23,909 INFO L499 BasicCegarLoop]: trace histogram [26, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:23,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Ended with exit code 0 [2022-04-08 10:08:24,109 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:24,109 INFO L403 AbstractCegarLoop]: === Iteration 97 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:24,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:24,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1416912529, now seen corresponding path program 183 times [2022-04-08 10:08:24,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:24,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1143743533] [2022-04-08 10:08:24,112 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:24,112 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:24,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1416912529, now seen corresponding path program 184 times [2022-04-08 10:08:24,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:24,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210686365] [2022-04-08 10:08:24,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:24,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:24,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:24,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {98492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {98458#true} is VALID [2022-04-08 10:08:24,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {98458#true} assume true; {98458#true} is VALID [2022-04-08 10:08:24,696 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98458#true} {98458#true} #61#return; {98458#true} is VALID [2022-04-08 10:08:24,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {98458#true} call ULTIMATE.init(); {98492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:24,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {98492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {98458#true} is VALID [2022-04-08 10:08:24,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {98458#true} assume true; {98458#true} is VALID [2022-04-08 10:08:24,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98458#true} {98458#true} #61#return; {98458#true} is VALID [2022-04-08 10:08:24,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {98458#true} call #t~ret11 := main(); {98458#true} is VALID [2022-04-08 10:08:24,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {98458#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {98463#(= main_~y~0 0)} is VALID [2022-04-08 10:08:24,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {98463#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98464#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:24,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {98464#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98465#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:24,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {98465#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98466#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:24,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {98466#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98467#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:24,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {98467#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98468#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:24,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {98468#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98469#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:24,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {98469#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98470#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:24,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {98470#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98471#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:24,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {98471#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98472#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:24,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {98472#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98473#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:24,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {98473#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98474#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:24,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {98474#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98475#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:24,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {98475#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98476#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:24,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {98476#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98477#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:08:24,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {98477#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98478#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:08:24,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {98478#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98479#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:08:24,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {98479#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98480#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:08:24,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {98480#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98481#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:08:24,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {98481#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98482#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:08:24,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {98482#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98483#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:08:24,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {98483#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98484#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:08:24,708 INFO L290 TraceCheckUtils]: 27: Hoare triple {98484#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98485#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:08:24,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {98485#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98486#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:08:24,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {98486#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98487#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:08:24,710 INFO L290 TraceCheckUtils]: 30: Hoare triple {98487#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98488#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:08:24,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {98488#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98489#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:08:24,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {98489#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {98489#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:08:24,711 INFO L290 TraceCheckUtils]: 33: Hoare triple {98489#(and (<= main_~y~0 26) (<= 26 main_~y~0))} ~z~0 := ~y~0; {98490#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-08 10:08:24,711 INFO L290 TraceCheckUtils]: 34: Hoare triple {98490#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98491#(and (<= 25 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:24,712 INFO L290 TraceCheckUtils]: 35: Hoare triple {98491#(and (<= 25 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {98459#false} is VALID [2022-04-08 10:08:24,712 INFO L290 TraceCheckUtils]: 36: Hoare triple {98459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {98459#false} is VALID [2022-04-08 10:08:24,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {98459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {98459#false} is VALID [2022-04-08 10:08:24,712 INFO L290 TraceCheckUtils]: 38: Hoare triple {98459#false} assume !(~y~0 % 4294967296 > 0); {98459#false} is VALID [2022-04-08 10:08:24,712 INFO L272 TraceCheckUtils]: 39: Hoare triple {98459#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {98459#false} is VALID [2022-04-08 10:08:24,712 INFO L290 TraceCheckUtils]: 40: Hoare triple {98459#false} ~cond := #in~cond; {98459#false} is VALID [2022-04-08 10:08:24,712 INFO L290 TraceCheckUtils]: 41: Hoare triple {98459#false} assume 0 == ~cond; {98459#false} is VALID [2022-04-08 10:08:24,712 INFO L290 TraceCheckUtils]: 42: Hoare triple {98459#false} assume !false; {98459#false} is VALID [2022-04-08 10:08:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:08:24,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:24,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210686365] [2022-04-08 10:08:24,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210686365] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:24,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070260291] [2022-04-08 10:08:24,713 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:08:24,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:24,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:24,713 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:24,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2022-04-08 10:08:24,762 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:08:24,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:24,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-08 10:08:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:24,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:25,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {98458#true} call ULTIMATE.init(); {98458#true} is VALID [2022-04-08 10:08:25,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {98458#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {98458#true} is VALID [2022-04-08 10:08:25,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {98458#true} assume true; {98458#true} is VALID [2022-04-08 10:08:25,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98458#true} {98458#true} #61#return; {98458#true} is VALID [2022-04-08 10:08:25,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {98458#true} call #t~ret11 := main(); {98458#true} is VALID [2022-04-08 10:08:25,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {98458#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {98463#(= main_~y~0 0)} is VALID [2022-04-08 10:08:25,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {98463#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98464#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:25,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {98464#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98465#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:25,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {98465#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98466#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:25,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {98466#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98467#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:25,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {98467#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98468#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:25,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {98468#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98469#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:25,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {98469#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98470#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:25,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {98470#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98471#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:25,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {98471#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98472#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:25,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {98472#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98473#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:25,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {98473#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98474#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:25,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {98474#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98475#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:25,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {98475#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98476#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:25,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {98476#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98477#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:08:25,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {98477#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98478#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:08:25,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {98478#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98479#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:08:25,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {98479#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98480#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:08:25,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {98480#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98481#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:08:25,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {98481#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98482#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:08:25,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {98482#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98483#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:08:25,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {98483#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98484#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:08:25,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {98484#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98485#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:08:25,175 INFO L290 TraceCheckUtils]: 28: Hoare triple {98485#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98486#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:08:25,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {98486#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98487#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:08:25,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {98487#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98488#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:08:25,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {98488#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98489#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:08:25,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {98489#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {98489#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:08:25,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {98489#(and (<= main_~y~0 26) (<= 26 main_~y~0))} ~z~0 := ~y~0; {98490#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-08 10:08:25,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {98490#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98598#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-08 10:08:25,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {98598#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !(~z~0 % 4294967296 > 0); {98459#false} is VALID [2022-04-08 10:08:25,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {98459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {98459#false} is VALID [2022-04-08 10:08:25,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {98459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {98459#false} is VALID [2022-04-08 10:08:25,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {98459#false} assume !(~y~0 % 4294967296 > 0); {98459#false} is VALID [2022-04-08 10:08:25,178 INFO L272 TraceCheckUtils]: 39: Hoare triple {98459#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {98459#false} is VALID [2022-04-08 10:08:25,178 INFO L290 TraceCheckUtils]: 40: Hoare triple {98459#false} ~cond := #in~cond; {98459#false} is VALID [2022-04-08 10:08:25,178 INFO L290 TraceCheckUtils]: 41: Hoare triple {98459#false} assume 0 == ~cond; {98459#false} is VALID [2022-04-08 10:08:25,178 INFO L290 TraceCheckUtils]: 42: Hoare triple {98459#false} assume !false; {98459#false} is VALID [2022-04-08 10:08:25,179 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:08:25,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:26,431 INFO L290 TraceCheckUtils]: 42: Hoare triple {98459#false} assume !false; {98459#false} is VALID [2022-04-08 10:08:26,431 INFO L290 TraceCheckUtils]: 41: Hoare triple {98459#false} assume 0 == ~cond; {98459#false} is VALID [2022-04-08 10:08:26,431 INFO L290 TraceCheckUtils]: 40: Hoare triple {98459#false} ~cond := #in~cond; {98459#false} is VALID [2022-04-08 10:08:26,431 INFO L272 TraceCheckUtils]: 39: Hoare triple {98459#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {98459#false} is VALID [2022-04-08 10:08:26,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {98459#false} assume !(~y~0 % 4294967296 > 0); {98459#false} is VALID [2022-04-08 10:08:26,432 INFO L290 TraceCheckUtils]: 37: Hoare triple {98459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {98459#false} is VALID [2022-04-08 10:08:26,432 INFO L290 TraceCheckUtils]: 36: Hoare triple {98459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {98459#false} is VALID [2022-04-08 10:08:26,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {98644#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {98459#false} is VALID [2022-04-08 10:08:26,433 INFO L290 TraceCheckUtils]: 34: Hoare triple {98648#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98644#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:26,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {98652#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {98648#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:26,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {98652#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {98652#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:26,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {98659#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98652#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:26,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {98663#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98659#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:26,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {98667#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98663#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:26,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {98671#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98667#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:26,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {98675#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98671#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:26,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {98679#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98675#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:26,438 INFO L290 TraceCheckUtils]: 25: Hoare triple {98683#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98679#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:26,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {98687#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98683#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:08:26,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {98691#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98687#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:26,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {98695#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98691#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:08:26,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {98699#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98695#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:08:26,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {98703#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98699#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:08:26,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {98707#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98703#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:08:26,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {98711#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98707#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:08:26,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {98715#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98711#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:08:26,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {98719#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98715#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:08:26,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {98723#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98719#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:08:26,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {98727#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98723#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:08:26,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {98731#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98727#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:08:26,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {98735#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98731#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:08:26,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {98739#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98735#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:26,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {98743#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98739#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:08:26,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {98747#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98743#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:08:26,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {98751#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98747#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-08 10:08:26,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {98755#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98751#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:26,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {98759#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98755#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-08 10:08:26,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {98458#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {98759#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-08 10:08:26,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {98458#true} call #t~ret11 := main(); {98458#true} is VALID [2022-04-08 10:08:26,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98458#true} {98458#true} #61#return; {98458#true} is VALID [2022-04-08 10:08:26,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {98458#true} assume true; {98458#true} is VALID [2022-04-08 10:08:26,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {98458#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {98458#true} is VALID [2022-04-08 10:08:26,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {98458#true} call ULTIMATE.init(); {98458#true} is VALID [2022-04-08 10:08:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:08:26,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070260291] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:26,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:26,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-08 10:08:26,452 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:26,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1143743533] [2022-04-08 10:08:26,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1143743533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:26,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:26,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-08 10:08:26,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566052016] [2022-04-08 10:08:26,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:26,452 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-08 10:08:26,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:26,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:26,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:26,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-08 10:08:26,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:26,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-08 10:08:26,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=856, Invalid=2926, Unknown=0, NotChecked=0, Total=3782 [2022-04-08 10:08:26,483 INFO L87 Difference]: Start difference. First operand 179 states and 230 transitions. Second operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:32,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:32,687 INFO L93 Difference]: Finished difference Result 280 states and 404 transitions. [2022-04-08 10:08:32,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 10:08:32,687 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-08 10:08:32,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 176 transitions. [2022-04-08 10:08:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 176 transitions. [2022-04-08 10:08:32,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 176 transitions. [2022-04-08 10:08:32,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:32,835 INFO L225 Difference]: With dead ends: 280 [2022-04-08 10:08:32,835 INFO L226 Difference]: Without dead ends: 272 [2022-04-08 10:08:32,835 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1798, Invalid=6574, Unknown=0, NotChecked=0, Total=8372 [2022-04-08 10:08:32,835 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 147 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 3633 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 3748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 3633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:32,836 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 206 Invalid, 3748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 3633 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-08 10:08:32,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-04-08 10:08:33,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 185. [2022-04-08 10:08:33,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:33,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 272 states. Second operand has 185 states, 180 states have (on average 1.3) internal successors, (234), 180 states have internal predecessors, (234), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:33,459 INFO L74 IsIncluded]: Start isIncluded. First operand 272 states. Second operand has 185 states, 180 states have (on average 1.3) internal successors, (234), 180 states have internal predecessors, (234), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:33,459 INFO L87 Difference]: Start difference. First operand 272 states. Second operand has 185 states, 180 states have (on average 1.3) internal successors, (234), 180 states have internal predecessors, (234), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:33,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:33,462 INFO L93 Difference]: Finished difference Result 272 states and 333 transitions. [2022-04-08 10:08:33,462 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 333 transitions. [2022-04-08 10:08:33,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:33,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:33,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 180 states have (on average 1.3) internal successors, (234), 180 states have internal predecessors, (234), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 272 states. [2022-04-08 10:08:33,462 INFO L87 Difference]: Start difference. First operand has 185 states, 180 states have (on average 1.3) internal successors, (234), 180 states have internal predecessors, (234), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 272 states. [2022-04-08 10:08:33,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:33,465 INFO L93 Difference]: Finished difference Result 272 states and 333 transitions. [2022-04-08 10:08:33,465 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 333 transitions. [2022-04-08 10:08:33,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:33,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:33,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:33,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 180 states have (on average 1.3) internal successors, (234), 180 states have internal predecessors, (234), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 238 transitions. [2022-04-08 10:08:33,468 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 238 transitions. Word has length 43 [2022-04-08 10:08:33,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:33,468 INFO L478 AbstractCegarLoop]: Abstraction has 185 states and 238 transitions. [2022-04-08 10:08:33,468 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:33,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 185 states and 238 transitions. [2022-04-08 10:08:34,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:34,016 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 238 transitions. [2022-04-08 10:08:34,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 10:08:34,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:34,017 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:34,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0 [2022-04-08 10:08:34,217 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable96 [2022-04-08 10:08:34,217 INFO L403 AbstractCegarLoop]: === Iteration 98 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:34,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:34,217 INFO L85 PathProgramCache]: Analyzing trace with hash 60430093, now seen corresponding path program 185 times [2022-04-08 10:08:34,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:34,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1205835973] [2022-04-08 10:08:34,219 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:34,220 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:34,220 INFO L85 PathProgramCache]: Analyzing trace with hash 60430093, now seen corresponding path program 186 times [2022-04-08 10:08:34,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:34,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246683401] [2022-04-08 10:08:34,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:34,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:34,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:34,475 INFO L290 TraceCheckUtils]: 0: Hoare triple {100332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {100314#true} is VALID [2022-04-08 10:08:34,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {100314#true} assume true; {100314#true} is VALID [2022-04-08 10:08:34,475 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {100314#true} {100314#true} #61#return; {100314#true} is VALID [2022-04-08 10:08:34,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {100314#true} call ULTIMATE.init(); {100332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:34,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {100332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {100314#true} is VALID [2022-04-08 10:08:34,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {100314#true} assume true; {100314#true} is VALID [2022-04-08 10:08:34,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100314#true} {100314#true} #61#return; {100314#true} is VALID [2022-04-08 10:08:34,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {100314#true} call #t~ret11 := main(); {100314#true} is VALID [2022-04-08 10:08:34,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {100314#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {100314#true} is VALID [2022-04-08 10:08:34,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:34,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:34,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:34,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:34,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:34,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:34,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:34,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:34,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:34,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:34,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {100314#true} assume !(~x~0 % 4294967296 > 0); {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:34,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:34,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100320#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:08:34,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {100320#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100321#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {100321#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100322#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {100322#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100323#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {100323#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100324#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:08:34,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {100324#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100325#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {100325#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:08:34,484 INFO L290 TraceCheckUtils]: 27: Hoare triple {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-08 10:08:34,485 INFO L290 TraceCheckUtils]: 28: Hoare triple {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~z~0 % 4294967296 > 0); {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-08 10:08:34,485 INFO L290 TraceCheckUtils]: 29: Hoare triple {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:08:34,486 INFO L290 TraceCheckUtils]: 30: Hoare triple {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100325#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,488 INFO L290 TraceCheckUtils]: 33: Hoare triple {100325#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100324#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:08:34,489 INFO L290 TraceCheckUtils]: 34: Hoare triple {100324#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100323#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,489 INFO L290 TraceCheckUtils]: 35: Hoare triple {100323#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100322#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {100322#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100321#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,491 INFO L290 TraceCheckUtils]: 37: Hoare triple {100321#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100320#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:08:34,492 INFO L290 TraceCheckUtils]: 38: Hoare triple {100320#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:34,492 INFO L290 TraceCheckUtils]: 39: Hoare triple {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:34,493 INFO L272 TraceCheckUtils]: 40: Hoare triple {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {100330#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:08:34,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {100330#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {100331#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:08:34,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {100331#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {100315#false} is VALID [2022-04-08 10:08:34,493 INFO L290 TraceCheckUtils]: 43: Hoare triple {100315#false} assume !false; {100315#false} is VALID [2022-04-08 10:08:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:08:34,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:34,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246683401] [2022-04-08 10:08:34,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246683401] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:34,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361781836] [2022-04-08 10:08:34,494 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:08:34,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:34,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:34,495 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:34,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-04-08 10:08:34,749 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:08:34,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:34,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 10:08:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:34,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:35,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {100314#true} call ULTIMATE.init(); {100314#true} is VALID [2022-04-08 10:08:35,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {100314#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {100314#true} is VALID [2022-04-08 10:08:35,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {100314#true} assume true; {100314#true} is VALID [2022-04-08 10:08:35,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100314#true} {100314#true} #61#return; {100314#true} is VALID [2022-04-08 10:08:35,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {100314#true} call #t~ret11 := main(); {100314#true} is VALID [2022-04-08 10:08:35,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {100314#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {100314#true} is VALID [2022-04-08 10:08:35,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:35,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:35,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:35,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:35,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:35,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:35,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:35,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:35,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:35,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:35,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {100314#true} assume !(~x~0 % 4294967296 > 0); {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:35,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:35,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100320#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:08:35,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {100320#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100321#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {100321#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100322#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {100322#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100323#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {100323#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100324#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:08:35,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {100324#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100325#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {100325#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:08:35,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-08 10:08:35,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~z~0 % 4294967296 > 0); {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-08 10:08:35,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:08:35,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100325#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {100325#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100324#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:08:35,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {100324#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100323#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {100323#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100322#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,074 INFO L290 TraceCheckUtils]: 36: Hoare triple {100322#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100321#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {100321#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100320#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:08:35,075 INFO L290 TraceCheckUtils]: 38: Hoare triple {100320#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:35,076 INFO L290 TraceCheckUtils]: 39: Hoare triple {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:35,076 INFO L272 TraceCheckUtils]: 40: Hoare triple {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {100456#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:08:35,077 INFO L290 TraceCheckUtils]: 41: Hoare triple {100456#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {100460#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:08:35,077 INFO L290 TraceCheckUtils]: 42: Hoare triple {100460#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {100315#false} is VALID [2022-04-08 10:08:35,077 INFO L290 TraceCheckUtils]: 43: Hoare triple {100315#false} assume !false; {100315#false} is VALID [2022-04-08 10:08:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:08:35,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:35,388 INFO L290 TraceCheckUtils]: 43: Hoare triple {100315#false} assume !false; {100315#false} is VALID [2022-04-08 10:08:35,389 INFO L290 TraceCheckUtils]: 42: Hoare triple {100460#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {100315#false} is VALID [2022-04-08 10:08:35,389 INFO L290 TraceCheckUtils]: 41: Hoare triple {100456#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {100460#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:08:35,390 INFO L272 TraceCheckUtils]: 40: Hoare triple {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {100456#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:08:35,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:35,391 INFO L290 TraceCheckUtils]: 38: Hoare triple {100320#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:35,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {100321#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100320#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:08:35,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {100322#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100321#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,393 INFO L290 TraceCheckUtils]: 35: Hoare triple {100323#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100322#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {100324#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100323#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {100325#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100324#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:08:35,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100325#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:08:35,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~z~0 % 4294967296 > 0); {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-08 10:08:35,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-08 10:08:35,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:08:35,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {100325#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,400 INFO L290 TraceCheckUtils]: 23: Hoare triple {100324#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100325#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {100323#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100324#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:08:35,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {100322#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100323#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {100321#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100322#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {100320#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100321#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:35,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {100320#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:08:35,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:35,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {100314#true} assume !(~x~0 % 4294967296 > 0); {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:35,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:35,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:35,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:35,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:35,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:35,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:35,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:35,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:35,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:35,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {100314#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100314#true} is VALID [2022-04-08 10:08:35,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {100314#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {100314#true} is VALID [2022-04-08 10:08:35,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {100314#true} call #t~ret11 := main(); {100314#true} is VALID [2022-04-08 10:08:35,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100314#true} {100314#true} #61#return; {100314#true} is VALID [2022-04-08 10:08:35,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {100314#true} assume true; {100314#true} is VALID [2022-04-08 10:08:35,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {100314#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {100314#true} is VALID [2022-04-08 10:08:35,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {100314#true} call ULTIMATE.init(); {100314#true} is VALID [2022-04-08 10:08:35,406 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:08:35,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361781836] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:35,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:35,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 18 [2022-04-08 10:08:35,406 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:35,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1205835973] [2022-04-08 10:08:35,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1205835973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:35,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:35,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:08:35,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120188886] [2022-04-08 10:08:35,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:35,407 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) 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 44 [2022-04-08 10:08:35,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:35,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.9375) 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-08 10:08:35,437 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-08 10:08:35,437 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:08:35,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:35,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:08:35,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:08:35,437 INFO L87 Difference]: Start difference. First operand 185 states and 238 transitions. Second operand has 16 states, 16 states have (on average 1.9375) 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-08 10:08:40,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:40,120 INFO L93 Difference]: Finished difference Result 584 states and 780 transitions. [2022-04-08 10:08:40,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:08:40,121 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) 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 44 [2022-04-08 10:08:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.9375) 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-08 10:08:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-08 10:08:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.9375) 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-08 10:08:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-08 10:08:40,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 72 transitions. [2022-04-08 10:08:40,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:40,201 INFO L225 Difference]: With dead ends: 584 [2022-04-08 10:08:40,201 INFO L226 Difference]: Without dead ends: 568 [2022-04-08 10:08:40,201 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2022-04-08 10:08:40,202 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 41 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:40,202 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 108 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:08:40,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2022-04-08 10:08:40,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 189. [2022-04-08 10:08:40,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:40,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 568 states. Second operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:40,858 INFO L74 IsIncluded]: Start isIncluded. First operand 568 states. Second operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:40,858 INFO L87 Difference]: Start difference. First operand 568 states. Second operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:40,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:40,868 INFO L93 Difference]: Finished difference Result 568 states and 763 transitions. [2022-04-08 10:08:40,868 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 763 transitions. [2022-04-08 10:08:40,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:40,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:40,869 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 568 states. [2022-04-08 10:08:40,869 INFO L87 Difference]: Start difference. First operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 568 states. [2022-04-08 10:08:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:40,879 INFO L93 Difference]: Finished difference Result 568 states and 763 transitions. [2022-04-08 10:08:40,879 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 763 transitions. [2022-04-08 10:08:40,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:40,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:40,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:40,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 244 transitions. [2022-04-08 10:08:40,882 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 244 transitions. Word has length 44 [2022-04-08 10:08:40,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:40,882 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 244 transitions. [2022-04-08 10:08:40,882 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) 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-08 10:08:40,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 189 states and 244 transitions. [2022-04-08 10:08:41,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:41,464 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 244 transitions. [2022-04-08 10:08:41,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 10:08:41,464 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:41,465 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:41,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2022-04-08 10:08:41,665 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable97 [2022-04-08 10:08:41,665 INFO L403 AbstractCegarLoop]: === Iteration 99 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:41,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:41,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1338400127, now seen corresponding path program 187 times [2022-04-08 10:08:41,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:41,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [639251802] [2022-04-08 10:08:41,667 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:41,667 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:41,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1338400127, now seen corresponding path program 188 times [2022-04-08 10:08:41,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:41,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097362281] [2022-04-08 10:08:41,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:41,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:42,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:42,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {103332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {103306#true} is VALID [2022-04-08 10:08:42,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {103306#true} assume true; {103306#true} is VALID [2022-04-08 10:08:42,006 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {103306#true} {103306#true} #61#return; {103306#true} is VALID [2022-04-08 10:08:42,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {103306#true} call ULTIMATE.init(); {103332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:42,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {103332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {103306#true} is VALID [2022-04-08 10:08:42,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {103306#true} assume true; {103306#true} is VALID [2022-04-08 10:08:42,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {103306#true} {103306#true} #61#return; {103306#true} is VALID [2022-04-08 10:08:42,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {103306#true} call #t~ret11 := main(); {103306#true} is VALID [2022-04-08 10:08:42,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {103306#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {103311#(= main_~y~0 0)} is VALID [2022-04-08 10:08:42,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {103311#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103312#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:42,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {103312#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103313#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:42,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {103313#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103314#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:42,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {103314#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103315#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:42,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {103315#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103316#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:42,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {103316#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103317#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:42,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {103317#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103318#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:42,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {103318#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103319#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:42,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {103319#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103320#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:42,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {103320#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103321#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:42,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {103321#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103322#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:42,013 INFO L290 TraceCheckUtils]: 17: Hoare triple {103322#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {103322#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:42,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {103322#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {103323#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:08:42,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {103323#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103324#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:08:42,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {103324#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103325#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:08:42,015 INFO L290 TraceCheckUtils]: 21: Hoare triple {103325#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103326#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:08:42,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {103326#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103327#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:42,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {103327#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103328#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:42,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {103328#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103329#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:42,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {103329#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103330#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:08:42,017 INFO L290 TraceCheckUtils]: 26: Hoare triple {103330#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103331#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:42,018 INFO L290 TraceCheckUtils]: 27: Hoare triple {103331#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {103307#false} is VALID [2022-04-08 10:08:42,018 INFO L290 TraceCheckUtils]: 28: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,018 INFO L290 TraceCheckUtils]: 29: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,018 INFO L290 TraceCheckUtils]: 30: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,018 INFO L290 TraceCheckUtils]: 36: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,018 INFO L290 TraceCheckUtils]: 37: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,018 INFO L290 TraceCheckUtils]: 39: Hoare triple {103307#false} assume !(~y~0 % 4294967296 > 0); {103307#false} is VALID [2022-04-08 10:08:42,018 INFO L272 TraceCheckUtils]: 40: Hoare triple {103307#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {103307#false} is VALID [2022-04-08 10:08:42,018 INFO L290 TraceCheckUtils]: 41: Hoare triple {103307#false} ~cond := #in~cond; {103307#false} is VALID [2022-04-08 10:08:42,018 INFO L290 TraceCheckUtils]: 42: Hoare triple {103307#false} assume 0 == ~cond; {103307#false} is VALID [2022-04-08 10:08:42,019 INFO L290 TraceCheckUtils]: 43: Hoare triple {103307#false} assume !false; {103307#false} is VALID [2022-04-08 10:08:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:08:42,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:42,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097362281] [2022-04-08 10:08:42,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097362281] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:42,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843845439] [2022-04-08 10:08:42,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:08:42,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:42,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:42,021 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:42,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2022-04-08 10:08:42,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:08:42,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:42,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-08 10:08:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:42,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:42,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {103306#true} call ULTIMATE.init(); {103306#true} is VALID [2022-04-08 10:08:42,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {103306#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {103306#true} is VALID [2022-04-08 10:08:42,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {103306#true} assume true; {103306#true} is VALID [2022-04-08 10:08:42,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {103306#true} {103306#true} #61#return; {103306#true} is VALID [2022-04-08 10:08:42,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {103306#true} call #t~ret11 := main(); {103306#true} is VALID [2022-04-08 10:08:42,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {103306#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {103311#(= main_~y~0 0)} is VALID [2022-04-08 10:08:42,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {103311#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103312#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:42,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {103312#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103313#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:42,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {103313#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103314#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:42,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {103314#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103315#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:42,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {103315#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103316#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:42,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {103316#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103317#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:42,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {103317#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103318#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:42,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {103318#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103319#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:42,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {103319#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103320#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:42,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {103320#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103321#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:42,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {103321#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103322#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:42,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {103322#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {103322#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:42,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {103322#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {103390#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:42,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {103390#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103394#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:08:42,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {103394#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103398#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:42,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {103398#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103402#(and (<= main_~y~0 11) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:42,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {103402#(and (<= main_~y~0 11) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103406#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-08 10:08:42,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {103406#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103410#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:42,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {103410#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103414#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:42,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {103414#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103418#(and (<= main_~y~0 11) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:42,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {103418#(and (<= main_~y~0 11) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103422#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:42,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {103422#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 11 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {103307#false} is VALID [2022-04-08 10:08:42,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,537 INFO L290 TraceCheckUtils]: 31: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,537 INFO L290 TraceCheckUtils]: 32: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,537 INFO L290 TraceCheckUtils]: 33: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,537 INFO L290 TraceCheckUtils]: 35: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,537 INFO L290 TraceCheckUtils]: 36: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,537 INFO L290 TraceCheckUtils]: 37: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,537 INFO L290 TraceCheckUtils]: 38: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:42,537 INFO L290 TraceCheckUtils]: 39: Hoare triple {103307#false} assume !(~y~0 % 4294967296 > 0); {103307#false} is VALID [2022-04-08 10:08:42,537 INFO L272 TraceCheckUtils]: 40: Hoare triple {103307#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {103307#false} is VALID [2022-04-08 10:08:42,537 INFO L290 TraceCheckUtils]: 41: Hoare triple {103307#false} ~cond := #in~cond; {103307#false} is VALID [2022-04-08 10:08:42,537 INFO L290 TraceCheckUtils]: 42: Hoare triple {103307#false} assume 0 == ~cond; {103307#false} is VALID [2022-04-08 10:08:42,537 INFO L290 TraceCheckUtils]: 43: Hoare triple {103307#false} assume !false; {103307#false} is VALID [2022-04-08 10:08:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:08:42,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:43,255 INFO L290 TraceCheckUtils]: 43: Hoare triple {103307#false} assume !false; {103307#false} is VALID [2022-04-08 10:08:43,255 INFO L290 TraceCheckUtils]: 42: Hoare triple {103307#false} assume 0 == ~cond; {103307#false} is VALID [2022-04-08 10:08:43,255 INFO L290 TraceCheckUtils]: 41: Hoare triple {103307#false} ~cond := #in~cond; {103307#false} is VALID [2022-04-08 10:08:43,255 INFO L272 TraceCheckUtils]: 40: Hoare triple {103307#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {103307#false} is VALID [2022-04-08 10:08:43,255 INFO L290 TraceCheckUtils]: 39: Hoare triple {103307#false} assume !(~y~0 % 4294967296 > 0); {103307#false} is VALID [2022-04-08 10:08:43,255 INFO L290 TraceCheckUtils]: 38: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:43,255 INFO L290 TraceCheckUtils]: 37: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:43,255 INFO L290 TraceCheckUtils]: 36: Hoare triple {103495#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-08 10:08:43,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {103499#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103495#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:08:43,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {103503#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103499#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:08:43,258 INFO L290 TraceCheckUtils]: 33: Hoare triple {103507#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103503#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:08:43,258 INFO L290 TraceCheckUtils]: 32: Hoare triple {103511#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103507#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:08:43,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {103515#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103511#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:08:43,260 INFO L290 TraceCheckUtils]: 30: Hoare triple {103519#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103515#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:08:43,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {103523#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103519#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:08:43,261 INFO L290 TraceCheckUtils]: 28: Hoare triple {103527#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103523#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:08:43,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {103531#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {103527#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:08:43,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {103535#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103531#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:08:43,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {103539#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103535#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:08:43,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {103543#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103539#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:08:43,265 INFO L290 TraceCheckUtils]: 23: Hoare triple {103547#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103543#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:08:43,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {103551#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103547#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:08:43,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {103555#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103551#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:08:43,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {103559#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103555#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:08:43,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {103563#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103559#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:08:43,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {103306#true} ~z~0 := ~y~0; {103563#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:08:43,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {103306#true} assume !(~x~0 % 4294967296 > 0); {103306#true} is VALID [2022-04-08 10:08:43,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {103306#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103306#true} is VALID [2022-04-08 10:08:43,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {103306#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103306#true} is VALID [2022-04-08 10:08:43,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {103306#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103306#true} is VALID [2022-04-08 10:08:43,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {103306#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103306#true} is VALID [2022-04-08 10:08:43,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {103306#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103306#true} is VALID [2022-04-08 10:08:43,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {103306#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103306#true} is VALID [2022-04-08 10:08:43,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {103306#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103306#true} is VALID [2022-04-08 10:08:43,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {103306#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103306#true} is VALID [2022-04-08 10:08:43,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {103306#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103306#true} is VALID [2022-04-08 10:08:43,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {103306#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103306#true} is VALID [2022-04-08 10:08:43,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {103306#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103306#true} is VALID [2022-04-08 10:08:43,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {103306#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {103306#true} is VALID [2022-04-08 10:08:43,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {103306#true} call #t~ret11 := main(); {103306#true} is VALID [2022-04-08 10:08:43,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {103306#true} {103306#true} #61#return; {103306#true} is VALID [2022-04-08 10:08:43,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {103306#true} assume true; {103306#true} is VALID [2022-04-08 10:08:43,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {103306#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {103306#true} is VALID [2022-04-08 10:08:43,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {103306#true} call ULTIMATE.init(); {103306#true} is VALID [2022-04-08 10:08:43,271 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-08 10:08:43,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843845439] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:43,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:43,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 20] total 51 [2022-04-08 10:08:43,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:43,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [639251802] [2022-04-08 10:08:43,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [639251802] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:43,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:43,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:08:43,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957513210] [2022-04-08 10:08:43,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:43,272 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 10:08:43,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:43,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:43,295 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-08 10:08:43,295 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:08:43,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:43,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:08:43,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=2245, Unknown=0, NotChecked=0, Total=2550 [2022-04-08 10:08:43,296 INFO L87 Difference]: Start difference. First operand 189 states and 244 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:46,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:46,241 INFO L93 Difference]: Finished difference Result 220 states and 275 transitions. [2022-04-08 10:08:46,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 10:08:46,241 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 10:08:46,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 74 transitions. [2022-04-08 10:08:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:46,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 74 transitions. [2022-04-08 10:08:46,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 74 transitions. [2022-04-08 10:08:46,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:46,303 INFO L225 Difference]: With dead ends: 220 [2022-04-08 10:08:46,303 INFO L226 Difference]: Without dead ends: 203 [2022-04-08 10:08:46,304 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=642, Invalid=5678, Unknown=0, NotChecked=0, Total=6320 [2022-04-08 10:08:46,304 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:46,304 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 120 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:08:46,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-04-08 10:08:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 190. [2022-04-08 10:08:46,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:46,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:46,972 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:46,973 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:46,975 INFO L93 Difference]: Finished difference Result 203 states and 258 transitions. [2022-04-08 10:08:46,975 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 258 transitions. [2022-04-08 10:08:46,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:46,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:46,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 203 states. [2022-04-08 10:08:46,975 INFO L87 Difference]: Start difference. First operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 203 states. [2022-04-08 10:08:46,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:46,977 INFO L93 Difference]: Finished difference Result 203 states and 258 transitions. [2022-04-08 10:08:46,977 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 258 transitions. [2022-04-08 10:08:46,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:46,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:46,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:46,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 245 transitions. [2022-04-08 10:08:46,980 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 245 transitions. Word has length 44 [2022-04-08 10:08:46,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:46,980 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 245 transitions. [2022-04-08 10:08:46,980 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:46,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 245 transitions. [2022-04-08 10:08:47,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:47,565 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 245 transitions. [2022-04-08 10:08:47,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 10:08:47,565 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:47,565 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:47,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Ended with exit code 0 [2022-04-08 10:08:47,765 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98,97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:47,766 INFO L403 AbstractCegarLoop]: === Iteration 100 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:47,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:47,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1592108787, now seen corresponding path program 189 times [2022-04-08 10:08:47,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:47,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [462972884] [2022-04-08 10:08:47,768 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:47,768 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:47,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1592108787, now seen corresponding path program 190 times [2022-04-08 10:08:47,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:47,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449901928] [2022-04-08 10:08:47,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:47,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:48,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:48,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {104932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {104907#true} is VALID [2022-04-08 10:08:48,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {104907#true} assume true; {104907#true} is VALID [2022-04-08 10:08:48,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {104907#true} {104907#true} #61#return; {104907#true} is VALID [2022-04-08 10:08:48,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {104907#true} call ULTIMATE.init(); {104932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:48,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {104932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {104907#true} is VALID [2022-04-08 10:08:48,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {104907#true} assume true; {104907#true} is VALID [2022-04-08 10:08:48,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104907#true} {104907#true} #61#return; {104907#true} is VALID [2022-04-08 10:08:48,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {104907#true} call #t~ret11 := main(); {104907#true} is VALID [2022-04-08 10:08:48,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {104907#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {104912#(= main_~y~0 0)} is VALID [2022-04-08 10:08:48,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {104912#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104913#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:48,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {104913#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104914#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:48,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {104914#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104915#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:48,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {104915#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104916#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:48,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {104916#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104917#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:48,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {104917#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104918#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:48,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {104918#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104919#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:48,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {104919#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104920#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:48,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {104920#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104921#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:48,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {104921#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104922#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:48,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {104922#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104923#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:48,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {104923#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104924#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:48,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {104924#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {104924#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:48,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {104924#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {104925#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:08:48,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {104925#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104926#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:08:48,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {104926#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104927#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:08:48,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {104927#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104928#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:08:48,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {104928#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104929#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:08:48,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {104929#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104930#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:48,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {104930#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104931#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:48,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {104931#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {104908#false} is VALID [2022-04-08 10:08:48,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,105 INFO L290 TraceCheckUtils]: 30: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,105 INFO L290 TraceCheckUtils]: 31: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,105 INFO L290 TraceCheckUtils]: 32: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,105 INFO L290 TraceCheckUtils]: 33: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,105 INFO L290 TraceCheckUtils]: 34: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,105 INFO L290 TraceCheckUtils]: 35: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,105 INFO L290 TraceCheckUtils]: 37: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,106 INFO L290 TraceCheckUtils]: 38: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {104908#false} assume !(~y~0 % 4294967296 > 0); {104908#false} is VALID [2022-04-08 10:08:48,106 INFO L272 TraceCheckUtils]: 40: Hoare triple {104908#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {104908#false} is VALID [2022-04-08 10:08:48,106 INFO L290 TraceCheckUtils]: 41: Hoare triple {104908#false} ~cond := #in~cond; {104908#false} is VALID [2022-04-08 10:08:48,106 INFO L290 TraceCheckUtils]: 42: Hoare triple {104908#false} assume 0 == ~cond; {104908#false} is VALID [2022-04-08 10:08:48,106 INFO L290 TraceCheckUtils]: 43: Hoare triple {104908#false} assume !false; {104908#false} is VALID [2022-04-08 10:08:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:08:48,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:48,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449901928] [2022-04-08 10:08:48,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449901928] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:48,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062118994] [2022-04-08 10:08:48,106 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:08:48,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:48,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:48,107 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:48,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2022-04-08 10:08:48,156 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:08:48,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:48,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 10:08:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:48,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:48,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {104907#true} call ULTIMATE.init(); {104907#true} is VALID [2022-04-08 10:08:48,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {104907#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {104907#true} is VALID [2022-04-08 10:08:48,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {104907#true} assume true; {104907#true} is VALID [2022-04-08 10:08:48,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104907#true} {104907#true} #61#return; {104907#true} is VALID [2022-04-08 10:08:48,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {104907#true} call #t~ret11 := main(); {104907#true} is VALID [2022-04-08 10:08:48,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {104907#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {104912#(= main_~y~0 0)} is VALID [2022-04-08 10:08:48,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {104912#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104913#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:48,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {104913#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104914#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:48,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {104914#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104915#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:48,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {104915#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104916#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:48,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {104916#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104917#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:48,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {104917#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104918#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:48,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {104918#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104919#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:48,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {104919#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104920#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:48,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {104920#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104921#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:48,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {104921#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104922#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:48,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {104922#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104923#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:48,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {104923#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104924#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:48,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {104924#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {104924#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:48,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {104924#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {104925#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:08:48,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {104925#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104926#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:08:48,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {104926#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104927#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:08:48,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {104927#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104928#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:08:48,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {104928#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104929#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:08:48,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {104929#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104930#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:48,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {104930#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {105011#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:48,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {105011#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {104908#false} is VALID [2022-04-08 10:08:48,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,494 INFO L290 TraceCheckUtils]: 30: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,494 INFO L290 TraceCheckUtils]: 31: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,494 INFO L290 TraceCheckUtils]: 32: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,494 INFO L290 TraceCheckUtils]: 33: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,494 INFO L290 TraceCheckUtils]: 34: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,494 INFO L290 TraceCheckUtils]: 35: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:48,494 INFO L290 TraceCheckUtils]: 39: Hoare triple {104908#false} assume !(~y~0 % 4294967296 > 0); {104908#false} is VALID [2022-04-08 10:08:48,494 INFO L272 TraceCheckUtils]: 40: Hoare triple {104908#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {104908#false} is VALID [2022-04-08 10:08:48,494 INFO L290 TraceCheckUtils]: 41: Hoare triple {104908#false} ~cond := #in~cond; {104908#false} is VALID [2022-04-08 10:08:48,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {104908#false} assume 0 == ~cond; {104908#false} is VALID [2022-04-08 10:08:48,494 INFO L290 TraceCheckUtils]: 43: Hoare triple {104908#false} assume !false; {104908#false} is VALID [2022-04-08 10:08:48,494 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:08:48,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:49,136 INFO L290 TraceCheckUtils]: 43: Hoare triple {104908#false} assume !false; {104908#false} is VALID [2022-04-08 10:08:49,136 INFO L290 TraceCheckUtils]: 42: Hoare triple {104908#false} assume 0 == ~cond; {104908#false} is VALID [2022-04-08 10:08:49,136 INFO L290 TraceCheckUtils]: 41: Hoare triple {104908#false} ~cond := #in~cond; {104908#false} is VALID [2022-04-08 10:08:49,136 INFO L272 TraceCheckUtils]: 40: Hoare triple {104908#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {104908#false} is VALID [2022-04-08 10:08:49,137 INFO L290 TraceCheckUtils]: 39: Hoare triple {104908#false} assume !(~y~0 % 4294967296 > 0); {104908#false} is VALID [2022-04-08 10:08:49,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:49,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:49,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:49,137 INFO L290 TraceCheckUtils]: 35: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:49,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:49,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:49,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:49,137 INFO L290 TraceCheckUtils]: 31: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:49,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:49,137 INFO L290 TraceCheckUtils]: 29: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:49,137 INFO L290 TraceCheckUtils]: 28: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:49,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-08 10:08:49,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {105117#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {104908#false} is VALID [2022-04-08 10:08:49,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {105121#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {105117#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:49,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {105125#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {105121#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:49,140 INFO L290 TraceCheckUtils]: 23: Hoare triple {105129#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {105125#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:49,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {105133#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {105129#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:49,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {105137#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {105133#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:08:49,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {105141#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {105137#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:08:49,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {105145#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {105141#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:08:49,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {105145#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {105145#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:49,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {105152#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105145#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:49,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {105156#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105152#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:49,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {105160#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105156#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:49,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {105164#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105160#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:49,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {105168#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105164#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:49,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {105172#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105168#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:49,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {105176#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105172#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:49,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {105180#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105176#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:49,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {105184#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105180#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:49,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {105188#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105184#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:49,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {105192#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105188#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:49,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {105196#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105192#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:49,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {104907#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {105196#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:08:49,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {104907#true} call #t~ret11 := main(); {104907#true} is VALID [2022-04-08 10:08:49,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104907#true} {104907#true} #61#return; {104907#true} is VALID [2022-04-08 10:08:49,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {104907#true} assume true; {104907#true} is VALID [2022-04-08 10:08:49,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {104907#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {104907#true} is VALID [2022-04-08 10:08:49,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {104907#true} call ULTIMATE.init(); {104907#true} is VALID [2022-04-08 10:08:49,151 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:08:49,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062118994] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:49,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:49,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-08 10:08:49,151 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:49,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [462972884] [2022-04-08 10:08:49,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [462972884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:49,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:49,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:08:49,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950226549] [2022-04-08 10:08:49,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:49,152 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 10:08:49,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:49,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:49,177 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-08 10:08:49,177 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:08:49,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:49,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:08:49,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1584, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:08:49,178 INFO L87 Difference]: Start difference. First operand 190 states and 245 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:51,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:51,927 INFO L93 Difference]: Finished difference Result 223 states and 278 transitions. [2022-04-08 10:08:51,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 10:08:51,927 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 10:08:51,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 81 transitions. [2022-04-08 10:08:51,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 81 transitions. [2022-04-08 10:08:51,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 81 transitions. [2022-04-08 10:08:51,991 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-08 10:08:51,994 INFO L225 Difference]: With dead ends: 223 [2022-04-08 10:08:51,994 INFO L226 Difference]: Without dead ends: 205 [2022-04-08 10:08:51,995 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1017, Invalid=4533, Unknown=0, NotChecked=0, Total=5550 [2022-04-08 10:08:51,995 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:51,995 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 102 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:08:51,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-04-08 10:08:52,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 191. [2022-04-08 10:08:52,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:52,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 191 states, 186 states have (on average 1.3010752688172043) internal successors, (242), 186 states have internal predecessors, (242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:52,665 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 191 states, 186 states have (on average 1.3010752688172043) internal successors, (242), 186 states have internal predecessors, (242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:52,666 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 191 states, 186 states have (on average 1.3010752688172043) internal successors, (242), 186 states have internal predecessors, (242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:52,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:52,668 INFO L93 Difference]: Finished difference Result 205 states and 260 transitions. [2022-04-08 10:08:52,668 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 260 transitions. [2022-04-08 10:08:52,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:52,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:52,668 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 186 states have (on average 1.3010752688172043) internal successors, (242), 186 states have internal predecessors, (242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 205 states. [2022-04-08 10:08:52,668 INFO L87 Difference]: Start difference. First operand has 191 states, 186 states have (on average 1.3010752688172043) internal successors, (242), 186 states have internal predecessors, (242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 205 states. [2022-04-08 10:08:52,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:52,670 INFO L93 Difference]: Finished difference Result 205 states and 260 transitions. [2022-04-08 10:08:52,670 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 260 transitions. [2022-04-08 10:08:52,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:52,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:52,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:52,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.3010752688172043) internal successors, (242), 186 states have internal predecessors, (242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:52,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 246 transitions. [2022-04-08 10:08:52,673 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 246 transitions. Word has length 44 [2022-04-08 10:08:52,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:52,673 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 246 transitions. [2022-04-08 10:08:52,673 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:52,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 191 states and 246 transitions. [2022-04-08 10:08:53,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:53,271 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 246 transitions. [2022-04-08 10:08:53,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 10:08:53,271 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:53,271 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:53,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Ended with exit code 0 [2022-04-08 10:08:53,472 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:53,472 INFO L403 AbstractCegarLoop]: === Iteration 101 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:53,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:53,472 INFO L85 PathProgramCache]: Analyzing trace with hash 263250815, now seen corresponding path program 191 times [2022-04-08 10:08:53,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:53,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [372090105] [2022-04-08 10:08:53,474 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:53,474 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:53,474 INFO L85 PathProgramCache]: Analyzing trace with hash 263250815, now seen corresponding path program 192 times [2022-04-08 10:08:53,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:53,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556391492] [2022-04-08 10:08:53,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:53,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:53,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:53,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {106541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {106517#true} is VALID [2022-04-08 10:08:53,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {106517#true} assume true; {106517#true} is VALID [2022-04-08 10:08:53,784 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {106517#true} {106517#true} #61#return; {106517#true} is VALID [2022-04-08 10:08:53,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {106517#true} call ULTIMATE.init(); {106541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:53,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {106541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {106517#true} is VALID [2022-04-08 10:08:53,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {106517#true} assume true; {106517#true} is VALID [2022-04-08 10:08:53,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106517#true} {106517#true} #61#return; {106517#true} is VALID [2022-04-08 10:08:53,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {106517#true} call #t~ret11 := main(); {106517#true} is VALID [2022-04-08 10:08:53,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {106517#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {106522#(= main_~y~0 0)} is VALID [2022-04-08 10:08:53,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {106522#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:53,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {106523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106524#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:53,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {106524#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106525#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:53,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {106525#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106526#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:53,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {106526#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106527#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:53,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {106527#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106528#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:53,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {106528#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106529#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:53,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {106529#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106530#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:53,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {106530#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106531#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:53,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {106531#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106532#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:53,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {106532#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106533#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:53,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {106533#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106534#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:53,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {106534#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106535#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:53,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {106535#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {106535#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:53,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {106535#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {106536#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:08:53,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {106536#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {106537#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:08:53,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {106537#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {106538#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:08:53,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {106538#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {106539#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:08:53,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {106539#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {106540#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:53,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {106540#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {106518#false} is VALID [2022-04-08 10:08:53,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:53,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:53,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:53,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:53,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:53,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:53,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:53,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:53,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:53,798 INFO L290 TraceCheckUtils]: 35: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:53,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:53,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:53,799 INFO L290 TraceCheckUtils]: 38: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:53,799 INFO L290 TraceCheckUtils]: 39: Hoare triple {106518#false} assume !(~y~0 % 4294967296 > 0); {106518#false} is VALID [2022-04-08 10:08:53,799 INFO L272 TraceCheckUtils]: 40: Hoare triple {106518#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {106518#false} is VALID [2022-04-08 10:08:53,799 INFO L290 TraceCheckUtils]: 41: Hoare triple {106518#false} ~cond := #in~cond; {106518#false} is VALID [2022-04-08 10:08:53,799 INFO L290 TraceCheckUtils]: 42: Hoare triple {106518#false} assume 0 == ~cond; {106518#false} is VALID [2022-04-08 10:08:53,799 INFO L290 TraceCheckUtils]: 43: Hoare triple {106518#false} assume !false; {106518#false} is VALID [2022-04-08 10:08:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:08:53,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:53,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556391492] [2022-04-08 10:08:53,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556391492] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:53,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678932549] [2022-04-08 10:08:53,800 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:08:53,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:53,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:53,804 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:53,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-04-08 10:08:54,362 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 10:08:54,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:54,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 10:08:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:54,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:54,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {106517#true} call ULTIMATE.init(); {106517#true} is VALID [2022-04-08 10:08:54,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {106517#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {106517#true} is VALID [2022-04-08 10:08:54,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {106517#true} assume true; {106517#true} is VALID [2022-04-08 10:08:54,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106517#true} {106517#true} #61#return; {106517#true} is VALID [2022-04-08 10:08:54,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {106517#true} call #t~ret11 := main(); {106517#true} is VALID [2022-04-08 10:08:54,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {106517#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {106522#(= main_~y~0 0)} is VALID [2022-04-08 10:08:54,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {106522#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:54,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {106523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106524#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:54,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {106524#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106525#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:54,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {106525#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106526#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:54,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {106526#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106527#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:54,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {106527#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106528#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:54,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {106528#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106529#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:54,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {106529#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106530#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:54,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {106530#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106531#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:54,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {106531#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106532#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:54,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {106532#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106533#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:54,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {106533#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106534#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:54,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {106534#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106535#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:54,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {106535#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {106535#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:54,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {106535#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {106536#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:08:54,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {106536#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {106537#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:08:54,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {106537#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {106538#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:08:54,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {106538#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {106539#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:08:54,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {106539#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {106617#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:08:54,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {106617#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {106518#false} is VALID [2022-04-08 10:08:54,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:54,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:54,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:54,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:54,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:54,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:54,689 INFO L290 TraceCheckUtils]: 32: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:54,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:54,689 INFO L290 TraceCheckUtils]: 34: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:54,689 INFO L290 TraceCheckUtils]: 35: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:54,689 INFO L290 TraceCheckUtils]: 36: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:54,689 INFO L290 TraceCheckUtils]: 37: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:54,689 INFO L290 TraceCheckUtils]: 38: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:54,689 INFO L290 TraceCheckUtils]: 39: Hoare triple {106518#false} assume !(~y~0 % 4294967296 > 0); {106518#false} is VALID [2022-04-08 10:08:54,689 INFO L272 TraceCheckUtils]: 40: Hoare triple {106518#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {106518#false} is VALID [2022-04-08 10:08:54,689 INFO L290 TraceCheckUtils]: 41: Hoare triple {106518#false} ~cond := #in~cond; {106518#false} is VALID [2022-04-08 10:08:54,689 INFO L290 TraceCheckUtils]: 42: Hoare triple {106518#false} assume 0 == ~cond; {106518#false} is VALID [2022-04-08 10:08:54,689 INFO L290 TraceCheckUtils]: 43: Hoare triple {106518#false} assume !false; {106518#false} is VALID [2022-04-08 10:08:54,689 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:08:54,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:55,391 INFO L290 TraceCheckUtils]: 43: Hoare triple {106518#false} assume !false; {106518#false} is VALID [2022-04-08 10:08:55,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {106518#false} assume 0 == ~cond; {106518#false} is VALID [2022-04-08 10:08:55,391 INFO L290 TraceCheckUtils]: 41: Hoare triple {106518#false} ~cond := #in~cond; {106518#false} is VALID [2022-04-08 10:08:55,391 INFO L272 TraceCheckUtils]: 40: Hoare triple {106518#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {106518#false} is VALID [2022-04-08 10:08:55,392 INFO L290 TraceCheckUtils]: 39: Hoare triple {106518#false} assume !(~y~0 % 4294967296 > 0); {106518#false} is VALID [2022-04-08 10:08:55,392 INFO L290 TraceCheckUtils]: 38: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:55,392 INFO L290 TraceCheckUtils]: 37: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:55,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:55,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:55,392 INFO L290 TraceCheckUtils]: 34: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:55,392 INFO L290 TraceCheckUtils]: 33: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:55,392 INFO L290 TraceCheckUtils]: 32: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:55,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:55,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:55,392 INFO L290 TraceCheckUtils]: 29: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:55,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:55,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:55,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-08 10:08:55,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {106729#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {106518#false} is VALID [2022-04-08 10:08:55,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {106733#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {106729#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:55,394 INFO L290 TraceCheckUtils]: 23: Hoare triple {106737#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {106733#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:55,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {106741#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {106737#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:55,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {106745#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {106741#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:55,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {106749#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {106745#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:08:55,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {106749#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {106749#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:55,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {106756#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106749#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:55,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {106760#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106756#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:55,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {106764#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106760#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:55,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {106768#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106764#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:55,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {106772#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106768#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:55,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {106776#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106772#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:55,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {106780#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106776#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:55,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {106784#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106780#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:55,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {106788#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106784#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:55,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {106792#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106788#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:55,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {106796#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106792#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:08:55,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {106800#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106796#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:55,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {106804#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106800#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:08:55,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {106517#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {106804#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:08:55,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {106517#true} call #t~ret11 := main(); {106517#true} is VALID [2022-04-08 10:08:55,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106517#true} {106517#true} #61#return; {106517#true} is VALID [2022-04-08 10:08:55,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {106517#true} assume true; {106517#true} is VALID [2022-04-08 10:08:55,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {106517#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {106517#true} is VALID [2022-04-08 10:08:55,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {106517#true} call ULTIMATE.init(); {106517#true} is VALID [2022-04-08 10:08:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:08:55,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678932549] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:55,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:55,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-08 10:08:55,405 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:55,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [372090105] [2022-04-08 10:08:55,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [372090105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:55,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:55,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:08:55,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502865892] [2022-04-08 10:08:55,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:55,406 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 10:08:55,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:55,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:55,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:55,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:08:55,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:55,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:08:55,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=1415, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:08:55,428 INFO L87 Difference]: Start difference. First operand 191 states and 246 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:58,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:58,076 INFO L93 Difference]: Finished difference Result 226 states and 281 transitions. [2022-04-08 10:08:58,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 10:08:58,076 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 10:08:58,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:58,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:58,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 83 transitions. [2022-04-08 10:08:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:58,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 83 transitions. [2022-04-08 10:08:58,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 83 transitions. [2022-04-08 10:08:58,151 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-08 10:08:58,154 INFO L225 Difference]: With dead ends: 226 [2022-04-08 10:08:58,154 INFO L226 Difference]: Without dead ends: 207 [2022-04-08 10:08:58,154 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=924, Invalid=3906, Unknown=0, NotChecked=0, Total=4830 [2022-04-08 10:08:58,155 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:58,155 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 104 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:08:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-08 10:08:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 192. [2022-04-08 10:08:58,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:58,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 192 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 187 states have internal predecessors, (243), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:58,833 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 192 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 187 states have internal predecessors, (243), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:58,833 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 192 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 187 states have internal predecessors, (243), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:58,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:58,835 INFO L93 Difference]: Finished difference Result 207 states and 262 transitions. [2022-04-08 10:08:58,835 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 262 transitions. [2022-04-08 10:08:58,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:58,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:58,836 INFO L74 IsIncluded]: Start isIncluded. First operand has 192 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 187 states have internal predecessors, (243), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 207 states. [2022-04-08 10:08:58,836 INFO L87 Difference]: Start difference. First operand has 192 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 187 states have internal predecessors, (243), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 207 states. [2022-04-08 10:08:58,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:58,838 INFO L93 Difference]: Finished difference Result 207 states and 262 transitions. [2022-04-08 10:08:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 262 transitions. [2022-04-08 10:08:58,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:58,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:58,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:58,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:58,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 187 states have internal predecessors, (243), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 247 transitions. [2022-04-08 10:08:58,841 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 247 transitions. Word has length 44 [2022-04-08 10:08:58,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:58,841 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 247 transitions. [2022-04-08 10:08:58,841 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:58,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 192 states and 247 transitions. [2022-04-08 10:08:59,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:59,450 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 247 transitions. [2022-04-08 10:08:59,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 10:08:59,450 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:59,450 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:59,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Ended with exit code 0 [2022-04-08 10:08:59,650 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2022-04-08 10:08:59,651 INFO L403 AbstractCegarLoop]: === Iteration 102 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:59,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:59,651 INFO L85 PathProgramCache]: Analyzing trace with hash 917310221, now seen corresponding path program 193 times [2022-04-08 10:08:59,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:59,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1254958770] [2022-04-08 10:08:59,653 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:59,653 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:59,653 INFO L85 PathProgramCache]: Analyzing trace with hash 917310221, now seen corresponding path program 194 times [2022-04-08 10:08:59,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:59,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249055584] [2022-04-08 10:08:59,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:59,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:59,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:59,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {108154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108131#true} is VALID [2022-04-08 10:08:59,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {108131#true} assume true; {108131#true} is VALID [2022-04-08 10:08:59,941 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {108131#true} {108131#true} #61#return; {108131#true} is VALID [2022-04-08 10:08:59,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {108131#true} call ULTIMATE.init(); {108154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:59,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {108154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108131#true} is VALID [2022-04-08 10:08:59,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {108131#true} assume true; {108131#true} is VALID [2022-04-08 10:08:59,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108131#true} {108131#true} #61#return; {108131#true} is VALID [2022-04-08 10:08:59,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {108131#true} call #t~ret11 := main(); {108131#true} is VALID [2022-04-08 10:08:59,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {108131#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108136#(= main_~y~0 0)} is VALID [2022-04-08 10:08:59,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {108136#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108137#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:59,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {108137#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108138#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:59,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {108138#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108139#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:59,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {108139#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108140#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:59,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {108140#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108141#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:59,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {108141#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108142#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:59,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {108142#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108143#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:59,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {108143#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108144#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:59,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {108144#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108145#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:59,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {108145#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108146#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:59,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {108146#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108147#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:59,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {108147#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108148#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:59,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {108148#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108149#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:59,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {108149#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108150#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:08:59,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {108150#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {108150#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:08:59,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {108150#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {108151#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:08:59,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {108151#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108152#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:08:59,951 INFO L290 TraceCheckUtils]: 23: Hoare triple {108152#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108153#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-08 10:08:59,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {108153#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {108132#false} is VALID [2022-04-08 10:08:59,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:08:59,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:08:59,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:08:59,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:08:59,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:08:59,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:08:59,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:08:59,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:08:59,952 INFO L290 TraceCheckUtils]: 33: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:08:59,952 INFO L290 TraceCheckUtils]: 34: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:08:59,952 INFO L290 TraceCheckUtils]: 35: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:08:59,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:08:59,952 INFO L290 TraceCheckUtils]: 37: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:08:59,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:08:59,952 INFO L290 TraceCheckUtils]: 39: Hoare triple {108132#false} assume !(~y~0 % 4294967296 > 0); {108132#false} is VALID [2022-04-08 10:08:59,952 INFO L272 TraceCheckUtils]: 40: Hoare triple {108132#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {108132#false} is VALID [2022-04-08 10:08:59,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {108132#false} ~cond := #in~cond; {108132#false} is VALID [2022-04-08 10:08:59,952 INFO L290 TraceCheckUtils]: 42: Hoare triple {108132#false} assume 0 == ~cond; {108132#false} is VALID [2022-04-08 10:08:59,952 INFO L290 TraceCheckUtils]: 43: Hoare triple {108132#false} assume !false; {108132#false} is VALID [2022-04-08 10:08:59,952 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:08:59,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:59,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249055584] [2022-04-08 10:08:59,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249055584] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:59,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745137254] [2022-04-08 10:08:59,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:08:59,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:59,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:59,953 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:59,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-04-08 10:09:00,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:09:00,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:00,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 10:09:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:00,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:00,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {108131#true} call ULTIMATE.init(); {108131#true} is VALID [2022-04-08 10:09:00,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {108131#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108131#true} is VALID [2022-04-08 10:09:00,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {108131#true} assume true; {108131#true} is VALID [2022-04-08 10:09:00,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108131#true} {108131#true} #61#return; {108131#true} is VALID [2022-04-08 10:09:00,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {108131#true} call #t~ret11 := main(); {108131#true} is VALID [2022-04-08 10:09:00,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {108131#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108136#(= main_~y~0 0)} is VALID [2022-04-08 10:09:00,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {108136#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108137#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:00,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {108137#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108138#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:00,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {108138#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108139#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:00,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {108139#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108140#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:00,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {108140#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108141#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:00,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {108141#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108142#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:00,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {108142#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108143#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:00,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {108143#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108144#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:00,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {108144#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108145#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:00,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {108145#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108146#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:00,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {108146#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108147#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:00,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {108147#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108148#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:00,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {108148#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108149#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:00,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {108149#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108150#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:00,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {108150#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {108150#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:00,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {108150#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {108151#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:09:00,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {108151#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108152#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:09:00,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {108152#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108227#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:09:00,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {108227#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {108132#false} is VALID [2022-04-08 10:09:00,325 INFO L290 TraceCheckUtils]: 25: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,325 INFO L290 TraceCheckUtils]: 32: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,326 INFO L290 TraceCheckUtils]: 36: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,326 INFO L290 TraceCheckUtils]: 38: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,326 INFO L290 TraceCheckUtils]: 39: Hoare triple {108132#false} assume !(~y~0 % 4294967296 > 0); {108132#false} is VALID [2022-04-08 10:09:00,326 INFO L272 TraceCheckUtils]: 40: Hoare triple {108132#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {108132#false} is VALID [2022-04-08 10:09:00,332 INFO L290 TraceCheckUtils]: 41: Hoare triple {108132#false} ~cond := #in~cond; {108132#false} is VALID [2022-04-08 10:09:00,333 INFO L290 TraceCheckUtils]: 42: Hoare triple {108132#false} assume 0 == ~cond; {108132#false} is VALID [2022-04-08 10:09:00,333 INFO L290 TraceCheckUtils]: 43: Hoare triple {108132#false} assume !false; {108132#false} is VALID [2022-04-08 10:09:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:09:00,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:00,902 INFO L290 TraceCheckUtils]: 43: Hoare triple {108132#false} assume !false; {108132#false} is VALID [2022-04-08 10:09:00,902 INFO L290 TraceCheckUtils]: 42: Hoare triple {108132#false} assume 0 == ~cond; {108132#false} is VALID [2022-04-08 10:09:00,902 INFO L290 TraceCheckUtils]: 41: Hoare triple {108132#false} ~cond := #in~cond; {108132#false} is VALID [2022-04-08 10:09:00,902 INFO L272 TraceCheckUtils]: 40: Hoare triple {108132#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {108132#false} is VALID [2022-04-08 10:09:00,902 INFO L290 TraceCheckUtils]: 39: Hoare triple {108132#false} assume !(~y~0 % 4294967296 > 0); {108132#false} is VALID [2022-04-08 10:09:00,902 INFO L290 TraceCheckUtils]: 38: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,902 INFO L290 TraceCheckUtils]: 36: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,902 INFO L290 TraceCheckUtils]: 35: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,903 INFO L290 TraceCheckUtils]: 32: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-08 10:09:00,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {108345#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {108132#false} is VALID [2022-04-08 10:09:00,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {108349#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108345#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:00,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {108353#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108349#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:00,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {108357#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {108353#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:00,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {108357#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {108357#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:00,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {108364#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108357#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:00,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {108368#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108364#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:00,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {108372#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108368#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:00,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {108376#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108372#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:00,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {108380#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108376#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:00,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {108384#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108380#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:00,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {108388#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108384#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:00,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {108392#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108388#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:00,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {108396#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108392#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:09:00,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {108400#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108396#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:00,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {108404#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108400#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:09:00,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {108408#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108404#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:09:00,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {108412#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108408#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:09:00,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {108416#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108412#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:09:00,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {108131#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108416#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:09:00,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {108131#true} call #t~ret11 := main(); {108131#true} is VALID [2022-04-08 10:09:00,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108131#true} {108131#true} #61#return; {108131#true} is VALID [2022-04-08 10:09:00,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {108131#true} assume true; {108131#true} is VALID [2022-04-08 10:09:00,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {108131#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108131#true} is VALID [2022-04-08 10:09:00,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {108131#true} call ULTIMATE.init(); {108131#true} is VALID [2022-04-08 10:09:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:09:00,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745137254] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:00,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:00,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-08 10:09:00,915 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:00,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1254958770] [2022-04-08 10:09:00,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1254958770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:00,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:00,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:09:00,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421806715] [2022-04-08 10:09:00,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:00,916 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 10:09:00,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:00,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:00,935 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-08 10:09:00,936 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:09:00,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:00,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:09:00,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1246, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:09:00,936 INFO L87 Difference]: Start difference. First operand 192 states and 247 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:03,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:03,374 INFO L93 Difference]: Finished difference Result 229 states and 284 transitions. [2022-04-08 10:09:03,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:09:03,374 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 10:09:03,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 81 transitions. [2022-04-08 10:09:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 81 transitions. [2022-04-08 10:09:03,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 81 transitions. [2022-04-08 10:09:03,440 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-08 10:09:03,443 INFO L225 Difference]: With dead ends: 229 [2022-04-08 10:09:03,443 INFO L226 Difference]: Without dead ends: 209 [2022-04-08 10:09:03,443 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=746, Invalid=2914, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 10:09:03,443 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:03,443 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 106 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:09:03,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-04-08 10:09:04,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 193. [2022-04-08 10:09:04,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:04,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 193 states, 188 states have (on average 1.297872340425532) internal successors, (244), 188 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:04,139 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 193 states, 188 states have (on average 1.297872340425532) internal successors, (244), 188 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:04,139 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 193 states, 188 states have (on average 1.297872340425532) internal successors, (244), 188 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:04,141 INFO L93 Difference]: Finished difference Result 209 states and 264 transitions. [2022-04-08 10:09:04,141 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 264 transitions. [2022-04-08 10:09:04,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:04,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:04,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 188 states have (on average 1.297872340425532) internal successors, (244), 188 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 209 states. [2022-04-08 10:09:04,142 INFO L87 Difference]: Start difference. First operand has 193 states, 188 states have (on average 1.297872340425532) internal successors, (244), 188 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 209 states. [2022-04-08 10:09:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:04,144 INFO L93 Difference]: Finished difference Result 209 states and 264 transitions. [2022-04-08 10:09:04,144 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 264 transitions. [2022-04-08 10:09:04,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:04,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:04,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:04,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:04,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.297872340425532) internal successors, (244), 188 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:04,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 248 transitions. [2022-04-08 10:09:04,147 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 248 transitions. Word has length 44 [2022-04-08 10:09:04,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:04,147 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 248 transitions. [2022-04-08 10:09:04,147 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:04,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 193 states and 248 transitions. [2022-04-08 10:09:04,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:04,752 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 248 transitions. [2022-04-08 10:09:04,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 10:09:04,752 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:04,752 INFO L499 BasicCegarLoop]: trace histogram [27, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:04,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:04,953 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:04,953 INFO L403 AbstractCegarLoop]: === Iteration 103 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:04,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:04,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1518166610, now seen corresponding path program 195 times [2022-04-08 10:09:04,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:04,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1593305026] [2022-04-08 10:09:04,955 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:04,955 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:04,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1518166610, now seen corresponding path program 196 times [2022-04-08 10:09:04,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:04,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132713527] [2022-04-08 10:09:04,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:04,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:05,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:05,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {109776#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {109741#true} is VALID [2022-04-08 10:09:05,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {109741#true} assume true; {109741#true} is VALID [2022-04-08 10:09:05,534 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {109741#true} {109741#true} #61#return; {109741#true} is VALID [2022-04-08 10:09:05,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {109741#true} call ULTIMATE.init(); {109776#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:05,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {109776#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {109741#true} is VALID [2022-04-08 10:09:05,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {109741#true} assume true; {109741#true} is VALID [2022-04-08 10:09:05,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109741#true} {109741#true} #61#return; {109741#true} is VALID [2022-04-08 10:09:05,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {109741#true} call #t~ret11 := main(); {109741#true} is VALID [2022-04-08 10:09:05,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {109741#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {109746#(= main_~y~0 0)} is VALID [2022-04-08 10:09:05,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {109746#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109747#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:05,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {109747#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109748#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:05,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {109748#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109749#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:05,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {109749#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109750#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:05,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {109750#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109751#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:05,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {109751#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109752#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:05,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {109752#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:05,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {109753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109754#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:05,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {109754#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109755#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:05,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {109755#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109756#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:05,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {109756#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109757#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:05,541 INFO L290 TraceCheckUtils]: 17: Hoare triple {109757#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109758#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:05,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {109758#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109759#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:05,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {109759#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109760#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:05,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {109760#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109761#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:05,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {109761#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109762#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:05,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {109762#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109763#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:05,544 INFO L290 TraceCheckUtils]: 23: Hoare triple {109763#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109764#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:09:05,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {109764#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109765#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:09:05,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {109765#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109766#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:09:05,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {109766#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109767#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:09:05,546 INFO L290 TraceCheckUtils]: 27: Hoare triple {109767#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109768#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:09:05,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {109768#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109769#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:09:05,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {109769#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109770#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:09:05,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {109770#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109771#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:09:05,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {109771#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109772#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:09:05,548 INFO L290 TraceCheckUtils]: 32: Hoare triple {109772#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109773#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:09:05,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {109773#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {109773#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:09:05,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {109773#(and (<= main_~y~0 27) (<= 27 main_~y~0))} ~z~0 := ~y~0; {109774#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-08 10:09:05,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {109774#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {109775#(and (<= (div main_~z~0 4294967296) 0) (<= 26 main_~z~0))} is VALID [2022-04-08 10:09:05,550 INFO L290 TraceCheckUtils]: 36: Hoare triple {109775#(and (<= (div main_~z~0 4294967296) 0) (<= 26 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {109742#false} is VALID [2022-04-08 10:09:05,550 INFO L290 TraceCheckUtils]: 37: Hoare triple {109742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {109742#false} is VALID [2022-04-08 10:09:05,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {109742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {109742#false} is VALID [2022-04-08 10:09:05,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {109742#false} assume !(~y~0 % 4294967296 > 0); {109742#false} is VALID [2022-04-08 10:09:05,550 INFO L272 TraceCheckUtils]: 40: Hoare triple {109742#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {109742#false} is VALID [2022-04-08 10:09:05,550 INFO L290 TraceCheckUtils]: 41: Hoare triple {109742#false} ~cond := #in~cond; {109742#false} is VALID [2022-04-08 10:09:05,550 INFO L290 TraceCheckUtils]: 42: Hoare triple {109742#false} assume 0 == ~cond; {109742#false} is VALID [2022-04-08 10:09:05,550 INFO L290 TraceCheckUtils]: 43: Hoare triple {109742#false} assume !false; {109742#false} is VALID [2022-04-08 10:09:05,550 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 379 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:09:05,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:05,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132713527] [2022-04-08 10:09:05,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132713527] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:05,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764316980] [2022-04-08 10:09:05,551 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:09:05,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:05,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:05,556 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:05,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2022-04-08 10:09:05,605 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:09:05,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:05,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-08 10:09:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:05,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:06,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {109741#true} call ULTIMATE.init(); {109741#true} is VALID [2022-04-08 10:09:06,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {109741#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {109741#true} is VALID [2022-04-08 10:09:06,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {109741#true} assume true; {109741#true} is VALID [2022-04-08 10:09:06,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109741#true} {109741#true} #61#return; {109741#true} is VALID [2022-04-08 10:09:06,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {109741#true} call #t~ret11 := main(); {109741#true} is VALID [2022-04-08 10:09:06,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {109741#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {109746#(= main_~y~0 0)} is VALID [2022-04-08 10:09:06,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {109746#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109747#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:06,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {109747#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109748#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:06,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {109748#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109749#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:06,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {109749#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109750#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:06,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {109750#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109751#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:06,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {109751#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109752#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:06,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {109752#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:06,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {109753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109754#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:06,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {109754#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109755#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:06,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {109755#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109756#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:06,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {109756#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109757#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:06,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {109757#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109758#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:06,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {109758#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109759#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:06,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {109759#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109760#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:06,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {109760#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109761#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:06,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {109761#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109762#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:06,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {109762#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109763#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:06,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {109763#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109764#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:09:06,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {109764#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109765#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:09:06,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {109765#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109766#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:09:06,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {109766#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109767#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:09:06,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {109767#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109768#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:09:06,032 INFO L290 TraceCheckUtils]: 28: Hoare triple {109768#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109769#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:09:06,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {109769#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109770#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:09:06,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {109770#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109771#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:09:06,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {109771#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109772#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:09:06,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {109772#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109773#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:09:06,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {109773#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {109773#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:09:06,035 INFO L290 TraceCheckUtils]: 34: Hoare triple {109773#(and (<= main_~y~0 27) (<= 27 main_~y~0))} ~z~0 := ~y~0; {109774#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-08 10:09:06,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {109774#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {109885#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-08 10:09:06,036 INFO L290 TraceCheckUtils]: 36: Hoare triple {109885#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {109742#false} is VALID [2022-04-08 10:09:06,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {109742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {109742#false} is VALID [2022-04-08 10:09:06,036 INFO L290 TraceCheckUtils]: 38: Hoare triple {109742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {109742#false} is VALID [2022-04-08 10:09:06,036 INFO L290 TraceCheckUtils]: 39: Hoare triple {109742#false} assume !(~y~0 % 4294967296 > 0); {109742#false} is VALID [2022-04-08 10:09:06,036 INFO L272 TraceCheckUtils]: 40: Hoare triple {109742#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {109742#false} is VALID [2022-04-08 10:09:06,036 INFO L290 TraceCheckUtils]: 41: Hoare triple {109742#false} ~cond := #in~cond; {109742#false} is VALID [2022-04-08 10:09:06,036 INFO L290 TraceCheckUtils]: 42: Hoare triple {109742#false} assume 0 == ~cond; {109742#false} is VALID [2022-04-08 10:09:06,036 INFO L290 TraceCheckUtils]: 43: Hoare triple {109742#false} assume !false; {109742#false} is VALID [2022-04-08 10:09:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 379 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:09:06,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:07,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {109742#false} assume !false; {109742#false} is VALID [2022-04-08 10:09:07,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {109742#false} assume 0 == ~cond; {109742#false} is VALID [2022-04-08 10:09:07,396 INFO L290 TraceCheckUtils]: 41: Hoare triple {109742#false} ~cond := #in~cond; {109742#false} is VALID [2022-04-08 10:09:07,396 INFO L272 TraceCheckUtils]: 40: Hoare triple {109742#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {109742#false} is VALID [2022-04-08 10:09:07,396 INFO L290 TraceCheckUtils]: 39: Hoare triple {109742#false} assume !(~y~0 % 4294967296 > 0); {109742#false} is VALID [2022-04-08 10:09:07,396 INFO L290 TraceCheckUtils]: 38: Hoare triple {109742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {109742#false} is VALID [2022-04-08 10:09:07,396 INFO L290 TraceCheckUtils]: 37: Hoare triple {109742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {109742#false} is VALID [2022-04-08 10:09:07,396 INFO L290 TraceCheckUtils]: 36: Hoare triple {109931#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {109742#false} is VALID [2022-04-08 10:09:07,397 INFO L290 TraceCheckUtils]: 35: Hoare triple {109935#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {109931#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:07,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {109939#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {109935#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:07,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {109939#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {109939#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:07,398 INFO L290 TraceCheckUtils]: 32: Hoare triple {109946#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109939#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:07,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {109950#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109946#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:07,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {109954#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109950#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:07,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {109958#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109954#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:07,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {109962#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109958#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:07,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {109966#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109962#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:07,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {109970#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109966#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:07,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {109974#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109970#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:09:07,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {109978#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109974#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:07,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {109982#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109978#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:09:07,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {109986#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109982#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:09:07,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {109990#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109986#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:09:07,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {109994#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109990#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:09:07,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {109998#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109994#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:09:07,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {110002#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109998#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:09:07,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {110006#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110002#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:09:07,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {110010#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110006#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:09:07,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {110014#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110010#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:09:07,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {110018#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110014#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:09:07,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {110022#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110018#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:09:07,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {110026#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110022#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:07,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {110030#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110026#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:09:07,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {110034#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110030#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:09:07,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {110038#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110034#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-08 10:09:07,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {110042#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110038#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:07,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {110046#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110042#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-08 10:09:07,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {110050#(< 0 (mod (+ main_~y~0 26) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110046#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-08 10:09:07,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {109741#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {110050#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-08 10:09:07,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {109741#true} call #t~ret11 := main(); {109741#true} is VALID [2022-04-08 10:09:07,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109741#true} {109741#true} #61#return; {109741#true} is VALID [2022-04-08 10:09:07,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {109741#true} assume true; {109741#true} is VALID [2022-04-08 10:09:07,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {109741#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {109741#true} is VALID [2022-04-08 10:09:07,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {109741#true} call ULTIMATE.init(); {109741#true} is VALID [2022-04-08 10:09:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 379 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:09:07,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764316980] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:07,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:07,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64 [2022-04-08 10:09:07,415 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:07,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1593305026] [2022-04-08 10:09:07,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1593305026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:07,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:07,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-08 10:09:07,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574222556] [2022-04-08 10:09:07,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:07,416 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 10:09:07,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:07,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:07,441 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-08 10:09:07,442 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-08 10:09:07,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:07,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-08 10:09:07,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=915, Invalid=3117, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 10:09:07,442 INFO L87 Difference]: Start difference. First operand 193 states and 248 transitions. Second operand has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:14,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:14,222 INFO L93 Difference]: Finished difference Result 307 states and 446 transitions. [2022-04-08 10:09:14,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 10:09:14,222 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 10:09:14,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:14,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:14,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 183 transitions. [2022-04-08 10:09:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 183 transitions. [2022-04-08 10:09:14,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 183 transitions. [2022-04-08 10:09:14,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:14,381 INFO L225 Difference]: With dead ends: 307 [2022-04-08 10:09:14,381 INFO L226 Difference]: Without dead ends: 299 [2022-04-08 10:09:14,381 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1919, Invalid=7011, Unknown=0, NotChecked=0, Total=8930 [2022-04-08 10:09:14,381 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 155 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 3937 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 4056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 3937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:14,382 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 214 Invalid, 4056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 3937 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-08 10:09:14,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-04-08 10:09:15,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 199. [2022-04-08 10:09:15,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:15,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states. Second operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:15,094 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states. Second operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:15,094 INFO L87 Difference]: Start difference. First operand 299 states. Second operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:15,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:15,097 INFO L93 Difference]: Finished difference Result 299 states and 365 transitions. [2022-04-08 10:09:15,097 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 365 transitions. [2022-04-08 10:09:15,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:15,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:15,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 299 states. [2022-04-08 10:09:15,098 INFO L87 Difference]: Start difference. First operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 299 states. [2022-04-08 10:09:15,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:15,101 INFO L93 Difference]: Finished difference Result 299 states and 365 transitions. [2022-04-08 10:09:15,101 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 365 transitions. [2022-04-08 10:09:15,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:15,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:15,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:15,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:15,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 256 transitions. [2022-04-08 10:09:15,104 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 256 transitions. Word has length 44 [2022-04-08 10:09:15,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:15,104 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 256 transitions. [2022-04-08 10:09:15,104 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:15,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 256 transitions. [2022-04-08 10:09:15,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 256 transitions. [2022-04-08 10:09:15,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 10:09:15,706 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:15,706 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:15,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Ended with exit code 0 [2022-04-08 10:09:15,906 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2022-04-08 10:09:15,906 INFO L403 AbstractCegarLoop]: === Iteration 104 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:15,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:15,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1633510225, now seen corresponding path program 197 times [2022-04-08 10:09:15,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:15,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1757896460] [2022-04-08 10:09:15,909 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:15,909 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:15,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1633510225, now seen corresponding path program 198 times [2022-04-08 10:09:15,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:15,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82743053] [2022-04-08 10:09:15,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:15,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:16,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:16,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {111770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {111743#true} is VALID [2022-04-08 10:09:16,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {111743#true} assume true; {111743#true} is VALID [2022-04-08 10:09:16,271 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111743#true} {111743#true} #61#return; {111743#true} is VALID [2022-04-08 10:09:16,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {111743#true} call ULTIMATE.init(); {111770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:16,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {111770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {111743#true} is VALID [2022-04-08 10:09:16,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {111743#true} assume true; {111743#true} is VALID [2022-04-08 10:09:16,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111743#true} {111743#true} #61#return; {111743#true} is VALID [2022-04-08 10:09:16,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {111743#true} call #t~ret11 := main(); {111743#true} is VALID [2022-04-08 10:09:16,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {111743#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111748#(= main_~y~0 0)} is VALID [2022-04-08 10:09:16,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {111748#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111749#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:16,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {111749#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111750#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:16,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {111750#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111751#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:16,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {111751#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111752#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:16,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {111752#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111753#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:16,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {111753#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111754#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:16,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {111754#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111755#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:16,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {111755#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111756#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:16,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {111756#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111757#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:16,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {111757#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:16,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {111758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {111758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:16,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {111758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {111759#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:09:16,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {111759#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111760#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:09:16,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {111760#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111761#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:09:16,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {111761#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111762#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:09:16,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {111762#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111763#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:16,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {111763#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111764#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:09:16,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {111764#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111765#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:09:16,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {111765#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111766#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:09:16,281 INFO L290 TraceCheckUtils]: 25: Hoare triple {111766#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111767#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:09:16,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {111767#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111768#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:09:16,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {111768#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111769#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:09:16,283 INFO L290 TraceCheckUtils]: 28: Hoare triple {111769#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111744#false} is VALID [2022-04-08 10:09:16,283 INFO L290 TraceCheckUtils]: 29: Hoare triple {111744#false} assume !(~z~0 % 4294967296 > 0); {111744#false} is VALID [2022-04-08 10:09:16,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-08 10:09:16,283 INFO L290 TraceCheckUtils]: 31: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-08 10:09:16,283 INFO L290 TraceCheckUtils]: 32: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-08 10:09:16,283 INFO L290 TraceCheckUtils]: 33: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-08 10:09:16,283 INFO L290 TraceCheckUtils]: 34: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-08 10:09:16,283 INFO L290 TraceCheckUtils]: 35: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-08 10:09:16,283 INFO L290 TraceCheckUtils]: 36: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-08 10:09:16,283 INFO L290 TraceCheckUtils]: 37: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-08 10:09:16,283 INFO L290 TraceCheckUtils]: 38: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-08 10:09:16,283 INFO L290 TraceCheckUtils]: 39: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-08 10:09:16,283 INFO L290 TraceCheckUtils]: 40: Hoare triple {111744#false} assume !(~y~0 % 4294967296 > 0); {111744#false} is VALID [2022-04-08 10:09:16,283 INFO L272 TraceCheckUtils]: 41: Hoare triple {111744#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {111744#false} is VALID [2022-04-08 10:09:16,283 INFO L290 TraceCheckUtils]: 42: Hoare triple {111744#false} ~cond := #in~cond; {111744#false} is VALID [2022-04-08 10:09:16,283 INFO L290 TraceCheckUtils]: 43: Hoare triple {111744#false} assume 0 == ~cond; {111744#false} is VALID [2022-04-08 10:09:16,283 INFO L290 TraceCheckUtils]: 44: Hoare triple {111744#false} assume !false; {111744#false} is VALID [2022-04-08 10:09:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:09:16,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:16,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82743053] [2022-04-08 10:09:16,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82743053] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:16,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719385] [2022-04-08 10:09:16,284 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:09:16,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:16,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:16,285 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:16,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-04-08 10:09:16,568 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:09:16,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:16,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-08 10:09:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:16,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:17,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {111743#true} call ULTIMATE.init(); {111743#true} is VALID [2022-04-08 10:09:17,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {111743#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {111743#true} is VALID [2022-04-08 10:09:17,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {111743#true} assume true; {111743#true} is VALID [2022-04-08 10:09:17,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111743#true} {111743#true} #61#return; {111743#true} is VALID [2022-04-08 10:09:17,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {111743#true} call #t~ret11 := main(); {111743#true} is VALID [2022-04-08 10:09:17,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {111743#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111748#(= main_~y~0 0)} is VALID [2022-04-08 10:09:17,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {111748#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111749#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:17,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {111749#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111750#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:17,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {111750#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111751#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:17,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {111751#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111752#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:17,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {111752#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111753#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:17,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {111753#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111754#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:17,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {111754#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111755#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:17,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {111755#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111756#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:17,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {111756#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111757#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:17,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {111757#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:17,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {111758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {111758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:17,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {111758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {111825#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:17,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {111825#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111829#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:09:17,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {111829#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111833#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:17,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {111833#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111837#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-08 10:09:17,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {111837#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111841#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:17,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {111841#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111845#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} is VALID [2022-04-08 10:09:17,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {111845#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111849#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:17,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {111849#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111853#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)))} is VALID [2022-04-08 10:09:17,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {111853#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111857#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)))} is VALID [2022-04-08 10:09:17,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {111857#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111861#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))))} is VALID [2022-04-08 10:09:17,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {111861#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111865#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ (- 9) main_~y~0) (+ main_~z~0 1)))} is VALID [2022-04-08 10:09:17,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {111865#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ (- 9) main_~y~0) (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111744#false} is VALID [2022-04-08 10:09:17,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {111744#false} assume !(~z~0 % 4294967296 > 0); {111744#false} is VALID [2022-04-08 10:09:17,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-08 10:09:17,108 INFO L290 TraceCheckUtils]: 31: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-08 10:09:17,108 INFO L290 TraceCheckUtils]: 32: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-08 10:09:17,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-08 10:09:17,108 INFO L290 TraceCheckUtils]: 34: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-08 10:09:17,108 INFO L290 TraceCheckUtils]: 35: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-08 10:09:17,108 INFO L290 TraceCheckUtils]: 36: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-08 10:09:17,108 INFO L290 TraceCheckUtils]: 37: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-08 10:09:17,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-08 10:09:17,108 INFO L290 TraceCheckUtils]: 39: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-08 10:09:17,108 INFO L290 TraceCheckUtils]: 40: Hoare triple {111744#false} assume !(~y~0 % 4294967296 > 0); {111744#false} is VALID [2022-04-08 10:09:17,108 INFO L272 TraceCheckUtils]: 41: Hoare triple {111744#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {111744#false} is VALID [2022-04-08 10:09:17,109 INFO L290 TraceCheckUtils]: 42: Hoare triple {111744#false} ~cond := #in~cond; {111744#false} is VALID [2022-04-08 10:09:17,109 INFO L290 TraceCheckUtils]: 43: Hoare triple {111744#false} assume 0 == ~cond; {111744#false} is VALID [2022-04-08 10:09:17,109 INFO L290 TraceCheckUtils]: 44: Hoare triple {111744#false} assume !false; {111744#false} is VALID [2022-04-08 10:09:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:09:17,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:18,021 INFO L290 TraceCheckUtils]: 44: Hoare triple {111744#false} assume !false; {111744#false} is VALID [2022-04-08 10:09:18,021 INFO L290 TraceCheckUtils]: 43: Hoare triple {111744#false} assume 0 == ~cond; {111744#false} is VALID [2022-04-08 10:09:18,021 INFO L290 TraceCheckUtils]: 42: Hoare triple {111744#false} ~cond := #in~cond; {111744#false} is VALID [2022-04-08 10:09:18,021 INFO L272 TraceCheckUtils]: 41: Hoare triple {111744#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {111744#false} is VALID [2022-04-08 10:09:18,022 INFO L290 TraceCheckUtils]: 40: Hoare triple {111929#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {111744#false} is VALID [2022-04-08 10:09:18,023 INFO L290 TraceCheckUtils]: 39: Hoare triple {111933#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111929#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:18,024 INFO L290 TraceCheckUtils]: 38: Hoare triple {111937#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111933#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:18,025 INFO L290 TraceCheckUtils]: 37: Hoare triple {111941#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111937#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:18,025 INFO L290 TraceCheckUtils]: 36: Hoare triple {111945#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111941#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:18,026 INFO L290 TraceCheckUtils]: 35: Hoare triple {111949#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111945#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:18,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {111953#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111949#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:18,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {111957#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111953#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:18,028 INFO L290 TraceCheckUtils]: 32: Hoare triple {111961#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111957#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:09:18,029 INFO L290 TraceCheckUtils]: 31: Hoare triple {111965#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111961#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:18,029 INFO L290 TraceCheckUtils]: 30: Hoare triple {111969#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111965#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:09:18,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {111969#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} assume !(~z~0 % 4294967296 > 0); {111969#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} is VALID [2022-04-08 10:09:18,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {111976#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111969#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} is VALID [2022-04-08 10:09:18,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {111980#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111976#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-08 10:09:18,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {111984#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111980#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-08 10:09:18,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {111988#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111984#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-08 10:09:18,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {111992#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111988#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-08 10:09:18,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {111996#(or (< 0 (mod (+ main_~y~0 4294967286) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111992#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-08 10:09:18,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {112000#(or (< 0 (mod (+ main_~y~0 4294967286) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111996#(or (< 0 (mod (+ main_~y~0 4294967286) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:09:18,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {112004#(or (< 0 (mod (+ main_~y~0 4294967286) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {112000#(or (< 0 (mod (+ main_~y~0 4294967286) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:09:18,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {112008#(or (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {112004#(or (< 0 (mod (+ main_~y~0 4294967286) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-08 10:09:18,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {112012#(or (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {112008#(or (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-08 10:09:18,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {112016#(or (not (< 0 (mod (+ main_~z~0 4294967286) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {112012#(or (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-08 10:09:18,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {111743#true} ~z~0 := ~y~0; {112016#(or (not (< 0 (mod (+ main_~z~0 4294967286) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-08 10:09:18,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {111743#true} assume !(~x~0 % 4294967296 > 0); {111743#true} is VALID [2022-04-08 10:09:18,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {111743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111743#true} is VALID [2022-04-08 10:09:18,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {111743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111743#true} is VALID [2022-04-08 10:09:18,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {111743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111743#true} is VALID [2022-04-08 10:09:18,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {111743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111743#true} is VALID [2022-04-08 10:09:18,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {111743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111743#true} is VALID [2022-04-08 10:09:18,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {111743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111743#true} is VALID [2022-04-08 10:09:18,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {111743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111743#true} is VALID [2022-04-08 10:09:18,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {111743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111743#true} is VALID [2022-04-08 10:09:18,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {111743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111743#true} is VALID [2022-04-08 10:09:18,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {111743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111743#true} is VALID [2022-04-08 10:09:18,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {111743#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111743#true} is VALID [2022-04-08 10:09:18,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {111743#true} call #t~ret11 := main(); {111743#true} is VALID [2022-04-08 10:09:18,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111743#true} {111743#true} #61#return; {111743#true} is VALID [2022-04-08 10:09:18,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {111743#true} assume true; {111743#true} is VALID [2022-04-08 10:09:18,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {111743#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {111743#true} is VALID [2022-04-08 10:09:18,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {111743#true} call ULTIMATE.init(); {111743#true} is VALID [2022-04-08 10:09:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:09:18,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719385] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:18,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:18,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 58 [2022-04-08 10:09:18,040 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:18,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1757896460] [2022-04-08 10:09:18,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1757896460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:18,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:18,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:09:18,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374716014] [2022-04-08 10:09:18,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:18,041 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-08 10:09:18,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:18,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:18,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:18,064 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:09:18,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:18,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:09:18,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=2808, Unknown=0, NotChecked=0, Total=3306 [2022-04-08 10:09:18,065 INFO L87 Difference]: Start difference. First operand 199 states and 256 transitions. Second operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:20,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:20,153 INFO L93 Difference]: Finished difference Result 215 states and 271 transitions. [2022-04-08 10:09:20,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:09:20,153 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-08 10:09:20,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 49 transitions. [2022-04-08 10:09:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 49 transitions. [2022-04-08 10:09:20,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 49 transitions. [2022-04-08 10:09:20,190 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-08 10:09:20,192 INFO L225 Difference]: With dead ends: 215 [2022-04-08 10:09:20,192 INFO L226 Difference]: Without dead ends: 186 [2022-04-08 10:09:20,192 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=960, Invalid=5360, Unknown=0, NotChecked=0, Total=6320 [2022-04-08 10:09:20,193 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:20,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 126 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:09:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-08 10:09:20,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-04-08 10:09:20,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:20,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 186 states, 181 states have (on average 1.3093922651933703) internal successors, (237), 181 states have internal predecessors, (237), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:20,827 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 186 states, 181 states have (on average 1.3093922651933703) internal successors, (237), 181 states have internal predecessors, (237), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:20,827 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 186 states, 181 states have (on average 1.3093922651933703) internal successors, (237), 181 states have internal predecessors, (237), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:20,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:20,829 INFO L93 Difference]: Finished difference Result 186 states and 241 transitions. [2022-04-08 10:09:20,829 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2022-04-08 10:09:20,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:20,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:20,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 181 states have (on average 1.3093922651933703) internal successors, (237), 181 states have internal predecessors, (237), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 186 states. [2022-04-08 10:09:20,830 INFO L87 Difference]: Start difference. First operand has 186 states, 181 states have (on average 1.3093922651933703) internal successors, (237), 181 states have internal predecessors, (237), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 186 states. [2022-04-08 10:09:20,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:20,831 INFO L93 Difference]: Finished difference Result 186 states and 241 transitions. [2022-04-08 10:09:20,831 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2022-04-08 10:09:20,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:20,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:20,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:20,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 181 states have (on average 1.3093922651933703) internal successors, (237), 181 states have internal predecessors, (237), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:20,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 241 transitions. [2022-04-08 10:09:20,833 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 241 transitions. Word has length 45 [2022-04-08 10:09:20,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:20,834 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 241 transitions. [2022-04-08 10:09:20,834 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:20,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 186 states and 241 transitions. [2022-04-08 10:09:21,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:21,392 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2022-04-08 10:09:21,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 10:09:21,393 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:21,393 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:21,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:21,593 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2022-04-08 10:09:21,593 INFO L403 AbstractCegarLoop]: === Iteration 105 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:21,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:21,593 INFO L85 PathProgramCache]: Analyzing trace with hash 462891775, now seen corresponding path program 199 times [2022-04-08 10:09:21,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:21,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1851139492] [2022-04-08 10:09:21,596 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:21,597 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:21,597 INFO L85 PathProgramCache]: Analyzing trace with hash 462891775, now seen corresponding path program 200 times [2022-04-08 10:09:21,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:21,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856242018] [2022-04-08 10:09:21,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:21,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:21,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:21,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {113318#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {113291#true} is VALID [2022-04-08 10:09:21,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {113291#true} assume true; {113291#true} is VALID [2022-04-08 10:09:21,959 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {113291#true} {113291#true} #61#return; {113291#true} is VALID [2022-04-08 10:09:21,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {113291#true} call ULTIMATE.init(); {113318#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:21,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {113318#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {113291#true} is VALID [2022-04-08 10:09:21,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {113291#true} assume true; {113291#true} is VALID [2022-04-08 10:09:21,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113291#true} {113291#true} #61#return; {113291#true} is VALID [2022-04-08 10:09:21,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {113291#true} call #t~ret11 := main(); {113291#true} is VALID [2022-04-08 10:09:21,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {113291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {113296#(= main_~y~0 0)} is VALID [2022-04-08 10:09:21,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {113296#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:21,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {113297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:21,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {113298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113299#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:21,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {113299#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:21,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {113300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113301#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:21,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {113301#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113302#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:21,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {113302#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113303#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:21,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {113303#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113304#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:21,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {113304#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113305#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:21,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {113305#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113306#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:21,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {113306#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:21,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {113307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {113307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:21,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {113307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {113308#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:09:21,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {113308#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113309#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:09:21,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {113309#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113310#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:09:21,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {113310#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113311#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:09:21,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {113311#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113312#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:09:21,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {113312#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113313#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:21,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {113313#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113314#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:09:21,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {113314#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113315#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:09:21,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {113315#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113316#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:09:21,970 INFO L290 TraceCheckUtils]: 27: Hoare triple {113316#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113317#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:09:21,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {113317#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {113292#false} is VALID [2022-04-08 10:09:21,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:21,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:21,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:21,971 INFO L290 TraceCheckUtils]: 32: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:21,971 INFO L290 TraceCheckUtils]: 33: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:21,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:21,971 INFO L290 TraceCheckUtils]: 35: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:21,971 INFO L290 TraceCheckUtils]: 36: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:21,971 INFO L290 TraceCheckUtils]: 37: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:21,971 INFO L290 TraceCheckUtils]: 38: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:21,971 INFO L290 TraceCheckUtils]: 39: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:21,971 INFO L290 TraceCheckUtils]: 40: Hoare triple {113292#false} assume !(~y~0 % 4294967296 > 0); {113292#false} is VALID [2022-04-08 10:09:21,971 INFO L272 TraceCheckUtils]: 41: Hoare triple {113292#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {113292#false} is VALID [2022-04-08 10:09:21,971 INFO L290 TraceCheckUtils]: 42: Hoare triple {113292#false} ~cond := #in~cond; {113292#false} is VALID [2022-04-08 10:09:21,971 INFO L290 TraceCheckUtils]: 43: Hoare triple {113292#false} assume 0 == ~cond; {113292#false} is VALID [2022-04-08 10:09:21,971 INFO L290 TraceCheckUtils]: 44: Hoare triple {113292#false} assume !false; {113292#false} is VALID [2022-04-08 10:09:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:09:21,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:21,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856242018] [2022-04-08 10:09:21,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856242018] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:21,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319235546] [2022-04-08 10:09:21,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:09:21,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:21,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:21,973 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:21,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2022-04-08 10:09:22,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:09:22,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:22,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-08 10:09:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:22,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:22,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {113291#true} call ULTIMATE.init(); {113291#true} is VALID [2022-04-08 10:09:22,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {113291#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {113291#true} is VALID [2022-04-08 10:09:22,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {113291#true} assume true; {113291#true} is VALID [2022-04-08 10:09:22,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113291#true} {113291#true} #61#return; {113291#true} is VALID [2022-04-08 10:09:22,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {113291#true} call #t~ret11 := main(); {113291#true} is VALID [2022-04-08 10:09:22,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {113291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {113296#(= main_~y~0 0)} is VALID [2022-04-08 10:09:22,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {113296#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:22,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {113297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:22,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {113298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113299#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:22,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {113299#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:22,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {113300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113301#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:22,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {113301#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113302#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:22,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {113302#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113303#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:22,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {113303#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113304#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:22,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {113304#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113305#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:22,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {113305#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113306#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:22,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {113306#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:22,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {113307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {113307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:22,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {113307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {113376#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:22,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {113376#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113380#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:09:22,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {113380#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113384#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:22,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {113384#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113388#(and (<= main_~y~0 11) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:22,522 INFO L290 TraceCheckUtils]: 22: Hoare triple {113388#(and (<= main_~y~0 11) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113392#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-08 10:09:22,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {113392#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113396#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:22,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {113396#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113400#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:22,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {113400#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113404#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:22,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {113404#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113408#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:22,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {113408#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113412#(and (<= main_~y~0 11) (= (+ main_~z~0 2) (+ main_~y~0 (- 7))) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:22,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {113412#(and (<= main_~y~0 11) (= (+ main_~z~0 2) (+ main_~y~0 (- 7))) (<= 11 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {113292#false} is VALID [2022-04-08 10:09:22,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:22,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:22,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:22,526 INFO L290 TraceCheckUtils]: 32: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:22,526 INFO L290 TraceCheckUtils]: 33: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:22,526 INFO L290 TraceCheckUtils]: 34: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:22,526 INFO L290 TraceCheckUtils]: 35: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:22,526 INFO L290 TraceCheckUtils]: 36: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:22,526 INFO L290 TraceCheckUtils]: 37: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:22,526 INFO L290 TraceCheckUtils]: 38: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:22,526 INFO L290 TraceCheckUtils]: 39: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:22,526 INFO L290 TraceCheckUtils]: 40: Hoare triple {113292#false} assume !(~y~0 % 4294967296 > 0); {113292#false} is VALID [2022-04-08 10:09:22,526 INFO L272 TraceCheckUtils]: 41: Hoare triple {113292#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {113292#false} is VALID [2022-04-08 10:09:22,526 INFO L290 TraceCheckUtils]: 42: Hoare triple {113292#false} ~cond := #in~cond; {113292#false} is VALID [2022-04-08 10:09:22,526 INFO L290 TraceCheckUtils]: 43: Hoare triple {113292#false} assume 0 == ~cond; {113292#false} is VALID [2022-04-08 10:09:22,526 INFO L290 TraceCheckUtils]: 44: Hoare triple {113292#false} assume !false; {113292#false} is VALID [2022-04-08 10:09:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:09:22,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:23,332 INFO L290 TraceCheckUtils]: 44: Hoare triple {113292#false} assume !false; {113292#false} is VALID [2022-04-08 10:09:23,332 INFO L290 TraceCheckUtils]: 43: Hoare triple {113292#false} assume 0 == ~cond; {113292#false} is VALID [2022-04-08 10:09:23,332 INFO L290 TraceCheckUtils]: 42: Hoare triple {113292#false} ~cond := #in~cond; {113292#false} is VALID [2022-04-08 10:09:23,332 INFO L272 TraceCheckUtils]: 41: Hoare triple {113292#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {113292#false} is VALID [2022-04-08 10:09:23,332 INFO L290 TraceCheckUtils]: 40: Hoare triple {113292#false} assume !(~y~0 % 4294967296 > 0); {113292#false} is VALID [2022-04-08 10:09:23,332 INFO L290 TraceCheckUtils]: 39: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:23,333 INFO L290 TraceCheckUtils]: 38: Hoare triple {113482#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-08 10:09:23,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {113486#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113482#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:09:23,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {113490#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113486#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:09:23,335 INFO L290 TraceCheckUtils]: 35: Hoare triple {113494#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113490#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:09:23,336 INFO L290 TraceCheckUtils]: 34: Hoare triple {113498#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113494#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:09:23,336 INFO L290 TraceCheckUtils]: 33: Hoare triple {113502#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113498#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:09:23,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {113506#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113502#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:09:23,338 INFO L290 TraceCheckUtils]: 31: Hoare triple {113510#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113506#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:09:23,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {113514#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113510#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:09:23,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {113518#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113514#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:09:23,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {113522#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {113518#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} is VALID [2022-04-08 10:09:23,341 INFO L290 TraceCheckUtils]: 27: Hoare triple {113526#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113522#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:09:23,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {113530#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113526#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:09:23,342 INFO L290 TraceCheckUtils]: 25: Hoare triple {113534#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113530#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:09:23,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {113538#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113534#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:09:23,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {113542#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113538#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:09:23,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {113546#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113542#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:09:23,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {113550#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113546#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:09:23,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {113554#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113550#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:09:23,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {113558#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113554#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:09:23,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {113291#true} ~z~0 := ~y~0; {113558#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-08 10:09:23,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {113291#true} assume !(~x~0 % 4294967296 > 0); {113291#true} is VALID [2022-04-08 10:09:23,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {113291#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113291#true} is VALID [2022-04-08 10:09:23,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {113291#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113291#true} is VALID [2022-04-08 10:09:23,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {113291#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113291#true} is VALID [2022-04-08 10:09:23,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {113291#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113291#true} is VALID [2022-04-08 10:09:23,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {113291#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113291#true} is VALID [2022-04-08 10:09:23,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {113291#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113291#true} is VALID [2022-04-08 10:09:23,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {113291#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113291#true} is VALID [2022-04-08 10:09:23,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {113291#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113291#true} is VALID [2022-04-08 10:09:23,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {113291#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113291#true} is VALID [2022-04-08 10:09:23,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {113291#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113291#true} is VALID [2022-04-08 10:09:23,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {113291#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {113291#true} is VALID [2022-04-08 10:09:23,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {113291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {113291#true} is VALID [2022-04-08 10:09:23,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {113291#true} call #t~ret11 := main(); {113291#true} is VALID [2022-04-08 10:09:23,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113291#true} {113291#true} #61#return; {113291#true} is VALID [2022-04-08 10:09:23,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {113291#true} assume true; {113291#true} is VALID [2022-04-08 10:09:23,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {113291#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {113291#true} is VALID [2022-04-08 10:09:23,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {113291#true} call ULTIMATE.init(); {113291#true} is VALID [2022-04-08 10:09:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 20 proven. 90 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-04-08 10:09:23,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319235546] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:23,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:23,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 22] total 55 [2022-04-08 10:09:23,349 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:23,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1851139492] [2022-04-08 10:09:23,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1851139492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:23,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:23,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:09:23,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437479003] [2022-04-08 10:09:23,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:23,350 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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 45 [2022-04-08 10:09:23,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:23,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:09:23,372 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-08 10:09:23,372 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:09:23,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:23,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:09:23,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=2618, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 10:09:23,373 INFO L87 Difference]: Start difference. First operand 186 states and 241 transitions. Second operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:09:26,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:26,024 INFO L93 Difference]: Finished difference Result 217 states and 272 transitions. [2022-04-08 10:09:26,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:09:26,025 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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 45 [2022-04-08 10:09:26,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:09:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 63 transitions. [2022-04-08 10:09:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:09:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 63 transitions. [2022-04-08 10:09:26,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 63 transitions. [2022-04-08 10:09:26,083 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-08 10:09:26,085 INFO L225 Difference]: With dead ends: 217 [2022-04-08 10:09:26,085 INFO L226 Difference]: Without dead ends: 200 [2022-04-08 10:09:26,085 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=592, Invalid=5260, Unknown=0, NotChecked=0, Total=5852 [2022-04-08 10:09:26,086 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:26,086 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 128 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:09:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-04-08 10:09:26,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 187. [2022-04-08 10:09:26,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:26,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 187 states, 182 states have (on average 1.3076923076923077) internal successors, (238), 182 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:26,748 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 187 states, 182 states have (on average 1.3076923076923077) internal successors, (238), 182 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:26,748 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 187 states, 182 states have (on average 1.3076923076923077) internal successors, (238), 182 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:26,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:26,750 INFO L93 Difference]: Finished difference Result 200 states and 255 transitions. [2022-04-08 10:09:26,750 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 255 transitions. [2022-04-08 10:09:26,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:26,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:26,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 182 states have (on average 1.3076923076923077) internal successors, (238), 182 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 200 states. [2022-04-08 10:09:26,750 INFO L87 Difference]: Start difference. First operand has 187 states, 182 states have (on average 1.3076923076923077) internal successors, (238), 182 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 200 states. [2022-04-08 10:09:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:26,752 INFO L93 Difference]: Finished difference Result 200 states and 255 transitions. [2022-04-08 10:09:26,752 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 255 transitions. [2022-04-08 10:09:26,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:26,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:26,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:26,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.3076923076923077) internal successors, (238), 182 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:26,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 242 transitions. [2022-04-08 10:09:26,755 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 242 transitions. Word has length 45 [2022-04-08 10:09:26,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:26,755 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 242 transitions. [2022-04-08 10:09:26,755 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:09:26,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 187 states and 242 transitions. [2022-04-08 10:09:27,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:27,316 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 242 transitions. [2022-04-08 10:09:27,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 10:09:27,316 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:27,316 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:27,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Ended with exit code 0 [2022-04-08 10:09:27,516 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable104 [2022-04-08 10:09:27,517 INFO L403 AbstractCegarLoop]: === Iteration 106 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:27,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:27,517 INFO L85 PathProgramCache]: Analyzing trace with hash 606825199, now seen corresponding path program 201 times [2022-04-08 10:09:27,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:27,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1072692044] [2022-04-08 10:09:27,519 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:27,519 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:27,520 INFO L85 PathProgramCache]: Analyzing trace with hash 606825199, now seen corresponding path program 202 times [2022-04-08 10:09:27,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:27,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671526355] [2022-04-08 10:09:27,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:27,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:27,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:27,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {114896#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {114870#true} is VALID [2022-04-08 10:09:27,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {114870#true} assume true; {114870#true} is VALID [2022-04-08 10:09:27,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {114870#true} {114870#true} #61#return; {114870#true} is VALID [2022-04-08 10:09:27,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {114870#true} call ULTIMATE.init(); {114896#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:27,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {114896#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {114870#true} is VALID [2022-04-08 10:09:27,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {114870#true} assume true; {114870#true} is VALID [2022-04-08 10:09:27,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114870#true} {114870#true} #61#return; {114870#true} is VALID [2022-04-08 10:09:27,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {114870#true} call #t~ret11 := main(); {114870#true} is VALID [2022-04-08 10:09:27,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {114870#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {114875#(= main_~y~0 0)} is VALID [2022-04-08 10:09:27,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {114875#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114876#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:27,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {114876#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114877#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:27,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {114877#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114878#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:27,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {114878#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114879#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:27,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {114879#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114880#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:27,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {114880#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114881#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:27,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {114881#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:27,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {114882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114883#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:27,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {114883#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114884#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:27,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {114884#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114885#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:27,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {114885#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114886#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:27,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {114886#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114887#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:27,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {114887#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {114887#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:27,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {114887#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {114888#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:09:27,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {114888#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114889#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:09:27,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {114889#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114890#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:09:27,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {114890#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114891#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:09:27,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {114891#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114892#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:09:27,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {114892#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114893#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:09:27,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {114893#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114894#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:27,878 INFO L290 TraceCheckUtils]: 26: Hoare triple {114894#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114895#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:09:27,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {114895#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {114871#false} is VALID [2022-04-08 10:09:27,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:27,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:27,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:27,879 INFO L290 TraceCheckUtils]: 31: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:27,879 INFO L290 TraceCheckUtils]: 32: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:27,879 INFO L290 TraceCheckUtils]: 33: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:27,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:27,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:27,879 INFO L290 TraceCheckUtils]: 36: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:27,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:27,879 INFO L290 TraceCheckUtils]: 38: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:27,879 INFO L290 TraceCheckUtils]: 39: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:27,879 INFO L290 TraceCheckUtils]: 40: Hoare triple {114871#false} assume !(~y~0 % 4294967296 > 0); {114871#false} is VALID [2022-04-08 10:09:27,880 INFO L272 TraceCheckUtils]: 41: Hoare triple {114871#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {114871#false} is VALID [2022-04-08 10:09:27,880 INFO L290 TraceCheckUtils]: 42: Hoare triple {114871#false} ~cond := #in~cond; {114871#false} is VALID [2022-04-08 10:09:27,880 INFO L290 TraceCheckUtils]: 43: Hoare triple {114871#false} assume 0 == ~cond; {114871#false} is VALID [2022-04-08 10:09:27,880 INFO L290 TraceCheckUtils]: 44: Hoare triple {114871#false} assume !false; {114871#false} is VALID [2022-04-08 10:09:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:09:27,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:27,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671526355] [2022-04-08 10:09:27,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671526355] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:27,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505207764] [2022-04-08 10:09:27,880 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:09:27,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:27,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:27,881 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:27,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2022-04-08 10:09:27,930 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:09:27,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:27,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:09:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:27,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:28,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {114870#true} call ULTIMATE.init(); {114870#true} is VALID [2022-04-08 10:09:28,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {114870#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {114870#true} is VALID [2022-04-08 10:09:28,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {114870#true} assume true; {114870#true} is VALID [2022-04-08 10:09:28,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114870#true} {114870#true} #61#return; {114870#true} is VALID [2022-04-08 10:09:28,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {114870#true} call #t~ret11 := main(); {114870#true} is VALID [2022-04-08 10:09:28,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {114870#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {114875#(= main_~y~0 0)} is VALID [2022-04-08 10:09:28,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {114875#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114876#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:28,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {114876#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114877#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:28,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {114877#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114878#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:28,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {114878#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114879#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:28,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {114879#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114880#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:28,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {114880#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114881#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:28,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {114881#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:28,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {114882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114883#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:28,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {114883#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114884#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:28,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {114884#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114885#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:28,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {114885#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114886#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:28,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {114886#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114887#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:28,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {114887#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {114887#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:28,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {114887#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {114888#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:09:28,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {114888#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114889#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:09:28,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {114889#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114890#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:09:28,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {114890#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114891#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:09:28,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {114891#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114892#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:09:28,276 INFO L290 TraceCheckUtils]: 24: Hoare triple {114892#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114893#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:09:28,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {114893#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114894#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:28,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {114894#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114978#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:09:28,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {114978#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {114871#false} is VALID [2022-04-08 10:09:28,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,278 INFO L290 TraceCheckUtils]: 31: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,278 INFO L290 TraceCheckUtils]: 32: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,278 INFO L290 TraceCheckUtils]: 33: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,278 INFO L290 TraceCheckUtils]: 35: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,278 INFO L290 TraceCheckUtils]: 36: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,278 INFO L290 TraceCheckUtils]: 37: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,278 INFO L290 TraceCheckUtils]: 38: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,278 INFO L290 TraceCheckUtils]: 39: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,278 INFO L290 TraceCheckUtils]: 40: Hoare triple {114871#false} assume !(~y~0 % 4294967296 > 0); {114871#false} is VALID [2022-04-08 10:09:28,278 INFO L272 TraceCheckUtils]: 41: Hoare triple {114871#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {114871#false} is VALID [2022-04-08 10:09:28,278 INFO L290 TraceCheckUtils]: 42: Hoare triple {114871#false} ~cond := #in~cond; {114871#false} is VALID [2022-04-08 10:09:28,279 INFO L290 TraceCheckUtils]: 43: Hoare triple {114871#false} assume 0 == ~cond; {114871#false} is VALID [2022-04-08 10:09:28,279 INFO L290 TraceCheckUtils]: 44: Hoare triple {114871#false} assume !false; {114871#false} is VALID [2022-04-08 10:09:28,279 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:09:28,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:28,962 INFO L290 TraceCheckUtils]: 44: Hoare triple {114871#false} assume !false; {114871#false} is VALID [2022-04-08 10:09:28,962 INFO L290 TraceCheckUtils]: 43: Hoare triple {114871#false} assume 0 == ~cond; {114871#false} is VALID [2022-04-08 10:09:28,962 INFO L290 TraceCheckUtils]: 42: Hoare triple {114871#false} ~cond := #in~cond; {114871#false} is VALID [2022-04-08 10:09:28,962 INFO L272 TraceCheckUtils]: 41: Hoare triple {114871#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {114871#false} is VALID [2022-04-08 10:09:28,962 INFO L290 TraceCheckUtils]: 40: Hoare triple {114871#false} assume !(~y~0 % 4294967296 > 0); {114871#false} is VALID [2022-04-08 10:09:28,962 INFO L290 TraceCheckUtils]: 39: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,963 INFO L290 TraceCheckUtils]: 38: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,963 INFO L290 TraceCheckUtils]: 37: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,963 INFO L290 TraceCheckUtils]: 36: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,963 INFO L290 TraceCheckUtils]: 35: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,963 INFO L290 TraceCheckUtils]: 34: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,963 INFO L290 TraceCheckUtils]: 33: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,963 INFO L290 TraceCheckUtils]: 32: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,963 INFO L290 TraceCheckUtils]: 31: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-08 10:09:28,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {115084#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {114871#false} is VALID [2022-04-08 10:09:28,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {115088#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115084#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:28,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {115092#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115088#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:28,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {115096#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115092#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:28,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {115100#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115096#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:28,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {115104#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115100#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:09:28,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {115108#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115104#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:09:28,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {115112#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115108#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:09:28,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {115116#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} ~z~0 := ~y~0; {115112#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:09:28,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {115116#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~x~0 % 4294967296 > 0); {115116#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:09:28,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {115123#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115116#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:09:28,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {115127#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115123#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:28,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {115131#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115127#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:28,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {115135#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115131#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:28,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {115139#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115135#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:28,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {115143#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115139#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:28,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {115147#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115143#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:28,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {115151#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115147#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:28,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {115155#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115151#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:28,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {115159#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115155#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:28,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {115163#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115159#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:28,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {115167#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115163#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:28,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {114870#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115167#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:28,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {114870#true} call #t~ret11 := main(); {114870#true} is VALID [2022-04-08 10:09:28,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114870#true} {114870#true} #61#return; {114870#true} is VALID [2022-04-08 10:09:28,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {114870#true} assume true; {114870#true} is VALID [2022-04-08 10:09:28,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {114870#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {114870#true} is VALID [2022-04-08 10:09:28,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {114870#true} call ULTIMATE.init(); {114870#true} is VALID [2022-04-08 10:09:28,978 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:09:28,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505207764] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:28,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:28,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-08 10:09:28,979 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:28,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1072692044] [2022-04-08 10:09:28,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1072692044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:28,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:28,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:09:28,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758183351] [2022-04-08 10:09:28,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:28,979 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-08 10:09:28,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:28,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:29,001 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-08 10:09:29,002 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:09:29,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:29,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:09:29,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=1746, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:09:29,002 INFO L87 Difference]: Start difference. First operand 187 states and 242 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:31,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:31,848 INFO L93 Difference]: Finished difference Result 220 states and 275 transitions. [2022-04-08 10:09:31,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 10:09:31,848 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-08 10:09:31,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:31,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 74 transitions. [2022-04-08 10:09:31,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:31,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 74 transitions. [2022-04-08 10:09:31,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 74 transitions. [2022-04-08 10:09:31,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:31,942 INFO L225 Difference]: With dead ends: 220 [2022-04-08 10:09:31,942 INFO L226 Difference]: Without dead ends: 202 [2022-04-08 10:09:31,943 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=958, Invalid=4444, Unknown=0, NotChecked=0, Total=5402 [2022-04-08 10:09:31,943 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:31,943 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 125 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:09:31,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-04-08 10:09:32,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 188. [2022-04-08 10:09:32,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:32,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand has 188 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 183 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:32,637 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand has 188 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 183 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:32,637 INFO L87 Difference]: Start difference. First operand 202 states. Second operand has 188 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 183 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:32,640 INFO L93 Difference]: Finished difference Result 202 states and 257 transitions. [2022-04-08 10:09:32,640 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 257 transitions. [2022-04-08 10:09:32,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:32,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:32,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 183 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 202 states. [2022-04-08 10:09:32,640 INFO L87 Difference]: Start difference. First operand has 188 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 183 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 202 states. [2022-04-08 10:09:32,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:32,642 INFO L93 Difference]: Finished difference Result 202 states and 257 transitions. [2022-04-08 10:09:32,642 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 257 transitions. [2022-04-08 10:09:32,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:32,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:32,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:32,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:32,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 183 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 243 transitions. [2022-04-08 10:09:32,645 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 243 transitions. Word has length 45 [2022-04-08 10:09:32,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:32,645 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 243 transitions. [2022-04-08 10:09:32,645 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:32,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 188 states and 243 transitions. [2022-04-08 10:09:33,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:33,225 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 243 transitions. [2022-04-08 10:09:33,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 10:09:33,226 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:33,226 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:33,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:33,431 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105,104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:33,431 INFO L403 AbstractCegarLoop]: === Iteration 107 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:33,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:33,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1175887039, now seen corresponding path program 203 times [2022-04-08 10:09:33,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:33,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [949474123] [2022-04-08 10:09:33,435 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:33,435 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:33,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1175887039, now seen corresponding path program 204 times [2022-04-08 10:09:33,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:33,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541085690] [2022-04-08 10:09:33,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:33,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:33,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:33,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {116489#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {116464#true} is VALID [2022-04-08 10:09:33,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {116464#true} assume true; {116464#true} is VALID [2022-04-08 10:09:33,768 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {116464#true} {116464#true} #61#return; {116464#true} is VALID [2022-04-08 10:09:33,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {116464#true} call ULTIMATE.init(); {116489#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:33,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {116489#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {116464#true} is VALID [2022-04-08 10:09:33,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {116464#true} assume true; {116464#true} is VALID [2022-04-08 10:09:33,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116464#true} {116464#true} #61#return; {116464#true} is VALID [2022-04-08 10:09:33,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {116464#true} call #t~ret11 := main(); {116464#true} is VALID [2022-04-08 10:09:33,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {116464#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {116469#(= main_~y~0 0)} is VALID [2022-04-08 10:09:33,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {116469#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116470#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:33,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {116470#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116471#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:33,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {116471#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116472#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:33,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {116472#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116473#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:33,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {116473#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116474#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:33,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {116474#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:33,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {116475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116476#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:33,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {116476#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116477#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:33,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {116477#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116478#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:33,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {116478#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116479#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:33,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {116479#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116480#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:33,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {116480#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116481#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:33,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {116481#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116482#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:33,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {116482#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {116482#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:33,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {116482#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {116483#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:09:33,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {116483#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {116484#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:09:33,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {116484#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {116485#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:09:33,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {116485#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {116486#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:09:33,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {116486#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {116487#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:09:33,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {116487#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {116488#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:09:33,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {116488#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {116465#false} is VALID [2022-04-08 10:09:33,779 INFO L290 TraceCheckUtils]: 27: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:33,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:33,779 INFO L290 TraceCheckUtils]: 29: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:33,779 INFO L290 TraceCheckUtils]: 30: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:33,779 INFO L290 TraceCheckUtils]: 31: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:33,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:33,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:33,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:33,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:33,779 INFO L290 TraceCheckUtils]: 36: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:33,779 INFO L290 TraceCheckUtils]: 37: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:33,779 INFO L290 TraceCheckUtils]: 38: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:33,779 INFO L290 TraceCheckUtils]: 39: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:33,780 INFO L290 TraceCheckUtils]: 40: Hoare triple {116465#false} assume !(~y~0 % 4294967296 > 0); {116465#false} is VALID [2022-04-08 10:09:33,780 INFO L272 TraceCheckUtils]: 41: Hoare triple {116465#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {116465#false} is VALID [2022-04-08 10:09:33,780 INFO L290 TraceCheckUtils]: 42: Hoare triple {116465#false} ~cond := #in~cond; {116465#false} is VALID [2022-04-08 10:09:33,780 INFO L290 TraceCheckUtils]: 43: Hoare triple {116465#false} assume 0 == ~cond; {116465#false} is VALID [2022-04-08 10:09:33,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {116465#false} assume !false; {116465#false} is VALID [2022-04-08 10:09:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:09:33,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:33,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541085690] [2022-04-08 10:09:33,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541085690] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:33,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137650374] [2022-04-08 10:09:33,780 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:09:33,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:33,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:33,781 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:33,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2022-04-08 10:09:34,358 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 10:09:34,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:34,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 10:09:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:34,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:34,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {116464#true} call ULTIMATE.init(); {116464#true} is VALID [2022-04-08 10:09:34,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {116464#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {116464#true} is VALID [2022-04-08 10:09:34,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {116464#true} assume true; {116464#true} is VALID [2022-04-08 10:09:34,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116464#true} {116464#true} #61#return; {116464#true} is VALID [2022-04-08 10:09:34,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {116464#true} call #t~ret11 := main(); {116464#true} is VALID [2022-04-08 10:09:34,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {116464#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {116469#(= main_~y~0 0)} is VALID [2022-04-08 10:09:34,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {116469#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116470#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:34,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {116470#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116471#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:34,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {116471#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116472#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:34,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {116472#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116473#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:34,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {116473#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116474#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:34,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {116474#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:34,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {116475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116476#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:34,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {116476#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116477#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:34,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {116477#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116478#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:34,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {116478#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116479#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:34,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {116479#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116480#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:34,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {116480#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116481#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:34,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {116481#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116482#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:34,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {116482#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {116482#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:34,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {116482#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {116483#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:09:34,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {116483#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {116484#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:09:34,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {116484#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {116485#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:09:34,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {116485#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {116486#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:09:34,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {116486#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {116487#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:09:34,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {116487#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {116568#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:09:34,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {116568#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {116465#false} is VALID [2022-04-08 10:09:34,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:34,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:34,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:34,710 INFO L290 TraceCheckUtils]: 30: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:34,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:34,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:34,711 INFO L290 TraceCheckUtils]: 33: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:34,711 INFO L290 TraceCheckUtils]: 34: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:34,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:34,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:34,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:34,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:34,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:34,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {116465#false} assume !(~y~0 % 4294967296 > 0); {116465#false} is VALID [2022-04-08 10:09:34,711 INFO L272 TraceCheckUtils]: 41: Hoare triple {116465#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {116465#false} is VALID [2022-04-08 10:09:34,711 INFO L290 TraceCheckUtils]: 42: Hoare triple {116465#false} ~cond := #in~cond; {116465#false} is VALID [2022-04-08 10:09:34,711 INFO L290 TraceCheckUtils]: 43: Hoare triple {116465#false} assume 0 == ~cond; {116465#false} is VALID [2022-04-08 10:09:34,711 INFO L290 TraceCheckUtils]: 44: Hoare triple {116465#false} assume !false; {116465#false} is VALID [2022-04-08 10:09:34,711 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:09:34,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:35,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {116465#false} assume !false; {116465#false} is VALID [2022-04-08 10:09:35,401 INFO L290 TraceCheckUtils]: 43: Hoare triple {116465#false} assume 0 == ~cond; {116465#false} is VALID [2022-04-08 10:09:35,401 INFO L290 TraceCheckUtils]: 42: Hoare triple {116465#false} ~cond := #in~cond; {116465#false} is VALID [2022-04-08 10:09:35,401 INFO L272 TraceCheckUtils]: 41: Hoare triple {116465#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {116465#false} is VALID [2022-04-08 10:09:35,401 INFO L290 TraceCheckUtils]: 40: Hoare triple {116465#false} assume !(~y~0 % 4294967296 > 0); {116465#false} is VALID [2022-04-08 10:09:35,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:35,401 INFO L290 TraceCheckUtils]: 38: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:35,401 INFO L290 TraceCheckUtils]: 37: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:35,401 INFO L290 TraceCheckUtils]: 36: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:35,401 INFO L290 TraceCheckUtils]: 35: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:35,401 INFO L290 TraceCheckUtils]: 34: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:35,401 INFO L290 TraceCheckUtils]: 33: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:35,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:35,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:35,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:35,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:35,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:35,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-08 10:09:35,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {116680#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {116465#false} is VALID [2022-04-08 10:09:35,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {116684#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {116680#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:35,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {116688#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {116684#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:35,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {116692#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {116688#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:35,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {116696#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {116692#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:35,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {116700#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {116696#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:09:35,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {116704#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {116700#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:09:35,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {116704#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {116704#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:35,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {116711#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116704#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:35,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {116715#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116711#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:35,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {116719#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116715#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:35,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {116723#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116719#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:35,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {116727#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116723#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:35,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {116731#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116727#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:35,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {116735#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116731#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:35,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {116739#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116735#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:35,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {116743#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116739#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:35,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {116747#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116743#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:35,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {116751#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116747#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:35,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {116755#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116751#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:09:35,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {116759#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {116755#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:35,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {116464#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {116759#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:09:35,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {116464#true} call #t~ret11 := main(); {116464#true} is VALID [2022-04-08 10:09:35,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116464#true} {116464#true} #61#return; {116464#true} is VALID [2022-04-08 10:09:35,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {116464#true} assume true; {116464#true} is VALID [2022-04-08 10:09:35,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {116464#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {116464#true} is VALID [2022-04-08 10:09:35,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {116464#true} call ULTIMATE.init(); {116464#true} is VALID [2022-04-08 10:09:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:09:35,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137650374] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:35,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:35,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-08 10:09:35,415 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:35,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [949474123] [2022-04-08 10:09:35,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [949474123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:35,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:35,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:09:35,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140548017] [2022-04-08 10:09:35,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:35,415 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-08 10:09:35,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:35,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:35,438 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-08 10:09:35,438 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:09:35,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:35,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:09:35,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1569, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:09:35,439 INFO L87 Difference]: Start difference. First operand 188 states and 243 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:38,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:38,154 INFO L93 Difference]: Finished difference Result 223 states and 278 transitions. [2022-04-08 10:09:38,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 10:09:38,154 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-08 10:09:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:38,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 80 transitions. [2022-04-08 10:09:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 80 transitions. [2022-04-08 10:09:38,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 80 transitions. [2022-04-08 10:09:38,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:38,222 INFO L225 Difference]: With dead ends: 223 [2022-04-08 10:09:38,222 INFO L226 Difference]: Without dead ends: 204 [2022-04-08 10:09:38,222 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=983, Invalid=4273, Unknown=0, NotChecked=0, Total=5256 [2022-04-08 10:09:38,222 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:38,223 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 107 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:09:38,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-04-08 10:09:38,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 189. [2022-04-08 10:09:38,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:38,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 204 states. Second operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:38,882 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:38,882 INFO L87 Difference]: Start difference. First operand 204 states. Second operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:38,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:38,884 INFO L93 Difference]: Finished difference Result 204 states and 259 transitions. [2022-04-08 10:09:38,884 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 259 transitions. [2022-04-08 10:09:38,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:38,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:38,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 204 states. [2022-04-08 10:09:38,885 INFO L87 Difference]: Start difference. First operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 204 states. [2022-04-08 10:09:38,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:38,886 INFO L93 Difference]: Finished difference Result 204 states and 259 transitions. [2022-04-08 10:09:38,887 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 259 transitions. [2022-04-08 10:09:38,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:38,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:38,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:38,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:38,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 244 transitions. [2022-04-08 10:09:38,889 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 244 transitions. Word has length 45 [2022-04-08 10:09:38,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:38,889 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 244 transitions. [2022-04-08 10:09:38,889 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:38,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 189 states and 244 transitions. [2022-04-08 10:09:39,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:39,466 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 244 transitions. [2022-04-08 10:09:39,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 10:09:39,467 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:39,467 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:39,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:39,667 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106,105 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:39,667 INFO L403 AbstractCegarLoop]: === Iteration 108 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:39,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:39,668 INFO L85 PathProgramCache]: Analyzing trace with hash -151209681, now seen corresponding path program 205 times [2022-04-08 10:09:39,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:39,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [673235994] [2022-04-08 10:09:39,670 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:39,670 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:39,670 INFO L85 PathProgramCache]: Analyzing trace with hash -151209681, now seen corresponding path program 206 times [2022-04-08 10:09:39,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:39,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613389897] [2022-04-08 10:09:39,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:39,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:39,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:39,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {118094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {118070#true} is VALID [2022-04-08 10:09:39,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {118070#true} assume true; {118070#true} is VALID [2022-04-08 10:09:39,967 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118070#true} {118070#true} #61#return; {118070#true} is VALID [2022-04-08 10:09:39,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {118070#true} call ULTIMATE.init(); {118094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:39,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {118094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {118070#true} is VALID [2022-04-08 10:09:39,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {118070#true} assume true; {118070#true} is VALID [2022-04-08 10:09:39,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118070#true} {118070#true} #61#return; {118070#true} is VALID [2022-04-08 10:09:39,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {118070#true} call #t~ret11 := main(); {118070#true} is VALID [2022-04-08 10:09:39,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {118070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {118075#(= main_~y~0 0)} is VALID [2022-04-08 10:09:39,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {118075#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118076#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:39,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {118076#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118077#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:39,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {118077#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118078#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:39,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {118078#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118079#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:39,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {118079#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118080#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:39,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {118080#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118081#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:39,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {118081#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118082#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:39,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {118082#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118083#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:39,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {118083#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:39,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {118084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118085#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:39,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {118085#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118086#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:39,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {118086#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118087#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:39,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {118087#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118088#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:39,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {118088#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:39,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {118089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {118089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:39,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {118089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {118090#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:09:39,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {118090#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {118091#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:09:39,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {118091#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {118092#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:09:39,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {118092#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {118093#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-08 10:09:39,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {118093#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {118071#false} is VALID [2022-04-08 10:09:39,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:39,978 INFO L290 TraceCheckUtils]: 27: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:39,978 INFO L290 TraceCheckUtils]: 28: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:39,978 INFO L290 TraceCheckUtils]: 29: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:39,978 INFO L290 TraceCheckUtils]: 30: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:39,978 INFO L290 TraceCheckUtils]: 31: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:39,978 INFO L290 TraceCheckUtils]: 32: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:39,978 INFO L290 TraceCheckUtils]: 33: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:39,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:39,978 INFO L290 TraceCheckUtils]: 35: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:39,978 INFO L290 TraceCheckUtils]: 36: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:39,978 INFO L290 TraceCheckUtils]: 37: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:39,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:39,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:39,979 INFO L290 TraceCheckUtils]: 40: Hoare triple {118071#false} assume !(~y~0 % 4294967296 > 0); {118071#false} is VALID [2022-04-08 10:09:39,979 INFO L272 TraceCheckUtils]: 41: Hoare triple {118071#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {118071#false} is VALID [2022-04-08 10:09:39,979 INFO L290 TraceCheckUtils]: 42: Hoare triple {118071#false} ~cond := #in~cond; {118071#false} is VALID [2022-04-08 10:09:39,979 INFO L290 TraceCheckUtils]: 43: Hoare triple {118071#false} assume 0 == ~cond; {118071#false} is VALID [2022-04-08 10:09:39,979 INFO L290 TraceCheckUtils]: 44: Hoare triple {118071#false} assume !false; {118071#false} is VALID [2022-04-08 10:09:39,979 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:09:39,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:39,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613389897] [2022-04-08 10:09:39,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613389897] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:39,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302739003] [2022-04-08 10:09:39,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:09:39,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:39,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:39,980 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:39,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2022-04-08 10:09:40,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:09:40,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:40,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 10:09:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:40,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:40,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {118070#true} call ULTIMATE.init(); {118070#true} is VALID [2022-04-08 10:09:40,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {118070#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {118070#true} is VALID [2022-04-08 10:09:40,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {118070#true} assume true; {118070#true} is VALID [2022-04-08 10:09:40,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118070#true} {118070#true} #61#return; {118070#true} is VALID [2022-04-08 10:09:40,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {118070#true} call #t~ret11 := main(); {118070#true} is VALID [2022-04-08 10:09:40,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {118070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {118075#(= main_~y~0 0)} is VALID [2022-04-08 10:09:40,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {118075#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118076#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:40,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {118076#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118077#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:40,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {118077#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118078#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:40,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {118078#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118079#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:40,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {118079#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118080#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:40,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {118080#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118081#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:40,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {118081#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118082#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:40,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {118082#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118083#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:40,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {118083#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:40,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {118084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118085#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:40,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {118085#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118086#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:40,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {118086#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118087#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:40,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {118087#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118088#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:40,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {118088#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:40,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {118089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {118089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:40,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {118089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {118090#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:09:40,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {118090#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {118091#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:09:40,366 INFO L290 TraceCheckUtils]: 23: Hoare triple {118091#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {118092#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:09:40,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {118092#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {118170#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:09:40,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {118170#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {118071#false} is VALID [2022-04-08 10:09:40,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,368 INFO L290 TraceCheckUtils]: 36: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,368 INFO L290 TraceCheckUtils]: 37: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {118071#false} assume !(~y~0 % 4294967296 > 0); {118071#false} is VALID [2022-04-08 10:09:40,368 INFO L272 TraceCheckUtils]: 41: Hoare triple {118071#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {118071#false} is VALID [2022-04-08 10:09:40,368 INFO L290 TraceCheckUtils]: 42: Hoare triple {118071#false} ~cond := #in~cond; {118071#false} is VALID [2022-04-08 10:09:40,368 INFO L290 TraceCheckUtils]: 43: Hoare triple {118071#false} assume 0 == ~cond; {118071#false} is VALID [2022-04-08 10:09:40,368 INFO L290 TraceCheckUtils]: 44: Hoare triple {118071#false} assume !false; {118071#false} is VALID [2022-04-08 10:09:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:09:40,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:40,968 INFO L290 TraceCheckUtils]: 44: Hoare triple {118071#false} assume !false; {118071#false} is VALID [2022-04-08 10:09:40,968 INFO L290 TraceCheckUtils]: 43: Hoare triple {118071#false} assume 0 == ~cond; {118071#false} is VALID [2022-04-08 10:09:40,969 INFO L290 TraceCheckUtils]: 42: Hoare triple {118071#false} ~cond := #in~cond; {118071#false} is VALID [2022-04-08 10:09:40,969 INFO L272 TraceCheckUtils]: 41: Hoare triple {118071#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {118071#false} is VALID [2022-04-08 10:09:40,969 INFO L290 TraceCheckUtils]: 40: Hoare triple {118071#false} assume !(~y~0 % 4294967296 > 0); {118071#false} is VALID [2022-04-08 10:09:40,969 INFO L290 TraceCheckUtils]: 39: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,969 INFO L290 TraceCheckUtils]: 38: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,969 INFO L290 TraceCheckUtils]: 36: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,969 INFO L290 TraceCheckUtils]: 32: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-08 10:09:40,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {118288#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {118071#false} is VALID [2022-04-08 10:09:40,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {118292#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {118288#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:40,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {118296#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {118292#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:40,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {118300#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {118296#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:40,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {118304#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {118300#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:40,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {118304#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {118304#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:40,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {118311#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118304#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:40,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {118315#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118311#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:40,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {118319#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118315#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:40,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {118323#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118319#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:40,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {118327#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118323#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:40,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {118331#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118327#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:40,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {118335#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118331#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:40,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {118339#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118335#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:40,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {118343#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118339#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:40,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {118347#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118343#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:09:40,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {118351#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118347#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:40,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {118355#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118351#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:09:40,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {118359#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118355#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:09:40,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {118363#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118359#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:09:40,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {118070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {118363#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:09:40,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {118070#true} call #t~ret11 := main(); {118070#true} is VALID [2022-04-08 10:09:40,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118070#true} {118070#true} #61#return; {118070#true} is VALID [2022-04-08 10:09:40,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {118070#true} assume true; {118070#true} is VALID [2022-04-08 10:09:40,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {118070#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {118070#true} is VALID [2022-04-08 10:09:40,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {118070#true} call ULTIMATE.init(); {118070#true} is VALID [2022-04-08 10:09:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:09:40,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302739003] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:40,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:40,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-08 10:09:40,983 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:40,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [673235994] [2022-04-08 10:09:40,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [673235994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:40,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:40,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:09:40,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761504851] [2022-04-08 10:09:40,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:40,984 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-08 10:09:40,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:40,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:41,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:41,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:09:41,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:41,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:09:41,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1396, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:09:41,004 INFO L87 Difference]: Start difference. First operand 189 states and 244 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:43,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:43,651 INFO L93 Difference]: Finished difference Result 226 states and 281 transitions. [2022-04-08 10:09:43,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 10:09:43,651 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-08 10:09:43,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:43,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:43,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 81 transitions. [2022-04-08 10:09:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 81 transitions. [2022-04-08 10:09:43,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 81 transitions. [2022-04-08 10:09:43,717 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-08 10:09:43,719 INFO L225 Difference]: With dead ends: 226 [2022-04-08 10:09:43,719 INFO L226 Difference]: Without dead ends: 206 [2022-04-08 10:09:43,720 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=869, Invalid=3553, Unknown=0, NotChecked=0, Total=4422 [2022-04-08 10:09:43,720 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:43,720 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 114 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:09:43,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-04-08 10:09:44,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 190. [2022-04-08 10:09:44,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:44,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:44,389 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:44,389 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:44,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:44,391 INFO L93 Difference]: Finished difference Result 206 states and 261 transitions. [2022-04-08 10:09:44,391 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 261 transitions. [2022-04-08 10:09:44,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:44,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:44,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 206 states. [2022-04-08 10:09:44,392 INFO L87 Difference]: Start difference. First operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 206 states. [2022-04-08 10:09:44,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:44,394 INFO L93 Difference]: Finished difference Result 206 states and 261 transitions. [2022-04-08 10:09:44,394 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 261 transitions. [2022-04-08 10:09:44,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:44,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:44,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:44,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:44,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:44,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 245 transitions. [2022-04-08 10:09:44,396 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 245 transitions. Word has length 45 [2022-04-08 10:09:44,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:44,396 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 245 transitions. [2022-04-08 10:09:44,396 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:44,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 245 transitions. [2022-04-08 10:09:44,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:44,971 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 245 transitions. [2022-04-08 10:09:44,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 10:09:44,972 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:44,972 INFO L499 BasicCegarLoop]: trace histogram [28, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:44,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Ended with exit code 0 [2022-04-08 10:09:45,172 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2022-04-08 10:09:45,172 INFO L403 AbstractCegarLoop]: === Iteration 109 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:45,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:45,173 INFO L85 PathProgramCache]: Analyzing trace with hash -362075825, now seen corresponding path program 207 times [2022-04-08 10:09:45,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:45,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1509189659] [2022-04-08 10:09:45,175 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:45,175 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:45,175 INFO L85 PathProgramCache]: Analyzing trace with hash -362075825, now seen corresponding path program 208 times [2022-04-08 10:09:45,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:45,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17705035] [2022-04-08 10:09:45,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:45,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:45,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:45,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {119714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {119678#true} is VALID [2022-04-08 10:09:45,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {119678#true} assume true; {119678#true} is VALID [2022-04-08 10:09:45,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {119678#true} {119678#true} #61#return; {119678#true} is VALID [2022-04-08 10:09:45,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {119678#true} call ULTIMATE.init(); {119714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:45,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {119714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {119678#true} is VALID [2022-04-08 10:09:45,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {119678#true} assume true; {119678#true} is VALID [2022-04-08 10:09:45,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119678#true} {119678#true} #61#return; {119678#true} is VALID [2022-04-08 10:09:45,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {119678#true} call #t~ret11 := main(); {119678#true} is VALID [2022-04-08 10:09:45,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {119678#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {119683#(= main_~y~0 0)} is VALID [2022-04-08 10:09:45,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {119683#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119684#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:45,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {119684#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119685#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:45,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {119685#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119686#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:45,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {119686#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119687#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:45,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {119687#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119688#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:45,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {119688#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119689#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:45,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {119689#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119690#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:45,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {119690#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119691#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:45,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {119691#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119692#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:45,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {119692#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119693#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:45,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {119693#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119694#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:45,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {119694#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119695#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:45,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {119695#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119696#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:45,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {119696#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119697#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:45,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {119697#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119698#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:45,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {119698#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119699#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:45,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {119699#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119700#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:45,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {119700#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119701#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:09:45,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {119701#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119702#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:09:45,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {119702#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119703#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:09:45,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {119703#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119704#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:09:45,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {119704#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119705#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:09:45,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {119705#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119706#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:09:45,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {119706#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119707#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:09:45,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {119707#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119708#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:09:45,795 INFO L290 TraceCheckUtils]: 31: Hoare triple {119708#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119709#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:09:45,795 INFO L290 TraceCheckUtils]: 32: Hoare triple {119709#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119710#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:09:45,796 INFO L290 TraceCheckUtils]: 33: Hoare triple {119710#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119711#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-08 10:09:45,796 INFO L290 TraceCheckUtils]: 34: Hoare triple {119711#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {119711#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-08 10:09:45,796 INFO L290 TraceCheckUtils]: 35: Hoare triple {119711#(and (<= main_~y~0 28) (<= 28 main_~y~0))} ~z~0 := ~y~0; {119712#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-08 10:09:45,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {119712#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119713#(and (<= (div main_~z~0 4294967296) 0) (<= 27 main_~z~0))} is VALID [2022-04-08 10:09:45,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {119713#(and (<= (div main_~z~0 4294967296) 0) (<= 27 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {119679#false} is VALID [2022-04-08 10:09:45,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {119679#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {119679#false} is VALID [2022-04-08 10:09:45,797 INFO L290 TraceCheckUtils]: 39: Hoare triple {119679#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {119679#false} is VALID [2022-04-08 10:09:45,797 INFO L290 TraceCheckUtils]: 40: Hoare triple {119679#false} assume !(~y~0 % 4294967296 > 0); {119679#false} is VALID [2022-04-08 10:09:45,797 INFO L272 TraceCheckUtils]: 41: Hoare triple {119679#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {119679#false} is VALID [2022-04-08 10:09:45,798 INFO L290 TraceCheckUtils]: 42: Hoare triple {119679#false} ~cond := #in~cond; {119679#false} is VALID [2022-04-08 10:09:45,798 INFO L290 TraceCheckUtils]: 43: Hoare triple {119679#false} assume 0 == ~cond; {119679#false} is VALID [2022-04-08 10:09:45,798 INFO L290 TraceCheckUtils]: 44: Hoare triple {119679#false} assume !false; {119679#false} is VALID [2022-04-08 10:09:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:09:45,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:45,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17705035] [2022-04-08 10:09:45,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17705035] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:45,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082827555] [2022-04-08 10:09:45,798 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:09:45,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:45,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:45,799 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:45,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2022-04-08 10:09:45,851 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:09:45,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:45,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-08 10:09:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:45,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:46,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {119678#true} call ULTIMATE.init(); {119678#true} is VALID [2022-04-08 10:09:46,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {119678#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {119678#true} is VALID [2022-04-08 10:09:46,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {119678#true} assume true; {119678#true} is VALID [2022-04-08 10:09:46,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119678#true} {119678#true} #61#return; {119678#true} is VALID [2022-04-08 10:09:46,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {119678#true} call #t~ret11 := main(); {119678#true} is VALID [2022-04-08 10:09:46,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {119678#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {119683#(= main_~y~0 0)} is VALID [2022-04-08 10:09:46,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {119683#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119684#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:46,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {119684#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119685#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:46,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {119685#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119686#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:46,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {119686#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119687#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:46,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {119687#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119688#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:46,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {119688#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119689#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:46,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {119689#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119690#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:46,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {119690#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119691#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:46,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {119691#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119692#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:46,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {119692#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119693#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:46,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {119693#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119694#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:46,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {119694#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119695#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:46,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {119695#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119696#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:46,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {119696#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119697#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:46,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {119697#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119698#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:46,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {119698#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119699#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:46,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {119699#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119700#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:46,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {119700#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119701#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:09:46,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {119701#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119702#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:09:46,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {119702#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119703#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:09:46,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {119703#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119704#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:09:46,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {119704#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119705#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:09:46,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {119705#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119706#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:09:46,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {119706#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119707#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:09:46,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {119707#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119708#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:09:46,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {119708#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119709#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:09:46,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {119709#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119710#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:09:46,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {119710#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119711#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-08 10:09:46,333 INFO L290 TraceCheckUtils]: 34: Hoare triple {119711#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {119711#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-08 10:09:46,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {119711#(and (<= main_~y~0 28) (<= 28 main_~y~0))} ~z~0 := ~y~0; {119712#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-08 10:09:46,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {119712#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119826#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-08 10:09:46,335 INFO L290 TraceCheckUtils]: 37: Hoare triple {119826#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {119679#false} is VALID [2022-04-08 10:09:46,335 INFO L290 TraceCheckUtils]: 38: Hoare triple {119679#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {119679#false} is VALID [2022-04-08 10:09:46,335 INFO L290 TraceCheckUtils]: 39: Hoare triple {119679#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {119679#false} is VALID [2022-04-08 10:09:46,335 INFO L290 TraceCheckUtils]: 40: Hoare triple {119679#false} assume !(~y~0 % 4294967296 > 0); {119679#false} is VALID [2022-04-08 10:09:46,335 INFO L272 TraceCheckUtils]: 41: Hoare triple {119679#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {119679#false} is VALID [2022-04-08 10:09:46,335 INFO L290 TraceCheckUtils]: 42: Hoare triple {119679#false} ~cond := #in~cond; {119679#false} is VALID [2022-04-08 10:09:46,335 INFO L290 TraceCheckUtils]: 43: Hoare triple {119679#false} assume 0 == ~cond; {119679#false} is VALID [2022-04-08 10:09:46,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {119679#false} assume !false; {119679#false} is VALID [2022-04-08 10:09:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:09:46,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:47,801 INFO L290 TraceCheckUtils]: 44: Hoare triple {119679#false} assume !false; {119679#false} is VALID [2022-04-08 10:09:47,801 INFO L290 TraceCheckUtils]: 43: Hoare triple {119679#false} assume 0 == ~cond; {119679#false} is VALID [2022-04-08 10:09:47,801 INFO L290 TraceCheckUtils]: 42: Hoare triple {119679#false} ~cond := #in~cond; {119679#false} is VALID [2022-04-08 10:09:47,801 INFO L272 TraceCheckUtils]: 41: Hoare triple {119679#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {119679#false} is VALID [2022-04-08 10:09:47,801 INFO L290 TraceCheckUtils]: 40: Hoare triple {119679#false} assume !(~y~0 % 4294967296 > 0); {119679#false} is VALID [2022-04-08 10:09:47,801 INFO L290 TraceCheckUtils]: 39: Hoare triple {119679#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {119679#false} is VALID [2022-04-08 10:09:47,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {119679#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {119679#false} is VALID [2022-04-08 10:09:47,802 INFO L290 TraceCheckUtils]: 37: Hoare triple {119872#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {119679#false} is VALID [2022-04-08 10:09:47,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {119876#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119872#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:47,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {119880#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {119876#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:47,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {119880#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {119880#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:47,804 INFO L290 TraceCheckUtils]: 33: Hoare triple {119887#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119880#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:47,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {119891#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119887#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:47,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {119895#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119891#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:47,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {119899#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119895#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:47,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {119903#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119899#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:47,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {119907#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119903#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:47,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {119911#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119907#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:47,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {119915#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119911#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:09:47,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {119919#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119915#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:47,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {119923#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119919#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:09:47,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {119927#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119923#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:09:47,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {119931#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119927#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:09:47,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {119935#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119931#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:09:47,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {119939#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119935#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:09:47,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {119943#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119939#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:09:47,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {119947#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119943#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:09:47,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {119951#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119947#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:09:47,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {119955#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119951#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:09:47,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {119959#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119955#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:09:47,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {119963#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119959#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:09:47,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {119967#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119963#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:47,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {119971#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119967#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:09:47,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {119975#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119971#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:09:47,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {119979#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119975#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-08 10:09:47,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {119983#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119979#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:47,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {119987#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119983#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-08 10:09:47,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {119991#(< 0 (mod (+ main_~y~0 26) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119987#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-08 10:09:47,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {119995#(< 0 (mod (+ main_~y~0 27) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119991#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-08 10:09:47,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {119678#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {119995#(< 0 (mod (+ main_~y~0 27) 4294967296))} is VALID [2022-04-08 10:09:47,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {119678#true} call #t~ret11 := main(); {119678#true} is VALID [2022-04-08 10:09:47,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119678#true} {119678#true} #61#return; {119678#true} is VALID [2022-04-08 10:09:47,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {119678#true} assume true; {119678#true} is VALID [2022-04-08 10:09:47,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {119678#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {119678#true} is VALID [2022-04-08 10:09:47,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {119678#true} call ULTIMATE.init(); {119678#true} is VALID [2022-04-08 10:09:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:09:47,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082827555] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:47,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:47,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 66 [2022-04-08 10:09:47,822 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:47,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1509189659] [2022-04-08 10:09:47,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1509189659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:47,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:47,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-08 10:09:47,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576720769] [2022-04-08 10:09:47,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:47,822 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-08 10:09:47,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:47,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:47,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:47,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-08 10:09:47,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:47,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-08 10:09:47,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=3314, Unknown=0, NotChecked=0, Total=4290 [2022-04-08 10:09:47,849 INFO L87 Difference]: Start difference. First operand 190 states and 245 transitions. Second operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:54,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:54,770 INFO L93 Difference]: Finished difference Result 305 states and 445 transitions. [2022-04-08 10:09:54,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-08 10:09:54,770 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-08 10:09:54,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:54,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:54,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 186 transitions. [2022-04-08 10:09:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 186 transitions. [2022-04-08 10:09:54,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 186 transitions. [2022-04-08 10:09:54,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:54,930 INFO L225 Difference]: With dead ends: 305 [2022-04-08 10:09:54,930 INFO L226 Difference]: Without dead ends: 297 [2022-04-08 10:09:54,931 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2044, Invalid=7462, Unknown=0, NotChecked=0, Total=9506 [2022-04-08 10:09:54,931 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 155 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 4000 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 4123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 4000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:54,931 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 214 Invalid, 4123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 4000 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-08 10:09:54,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-08 10:09:55,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 196. [2022-04-08 10:09:55,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:55,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 196 states, 191 states have (on average 1.3036649214659686) internal successors, (249), 191 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:55,625 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 196 states, 191 states have (on average 1.3036649214659686) internal successors, (249), 191 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:55,625 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 196 states, 191 states have (on average 1.3036649214659686) internal successors, (249), 191 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:55,629 INFO L93 Difference]: Finished difference Result 297 states and 363 transitions. [2022-04-08 10:09:55,629 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 363 transitions. [2022-04-08 10:09:55,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:55,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:55,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 191 states have (on average 1.3036649214659686) internal successors, (249), 191 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 297 states. [2022-04-08 10:09:55,629 INFO L87 Difference]: Start difference. First operand has 196 states, 191 states have (on average 1.3036649214659686) internal successors, (249), 191 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 297 states. [2022-04-08 10:09:55,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:55,633 INFO L93 Difference]: Finished difference Result 297 states and 363 transitions. [2022-04-08 10:09:55,633 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 363 transitions. [2022-04-08 10:09:55,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:55,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:55,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:55,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:55,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 191 states have (on average 1.3036649214659686) internal successors, (249), 191 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 253 transitions. [2022-04-08 10:09:55,636 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 253 transitions. Word has length 45 [2022-04-08 10:09:55,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:55,636 INFO L478 AbstractCegarLoop]: Abstraction has 196 states and 253 transitions. [2022-04-08 10:09:55,636 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:55,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 253 transitions. [2022-04-08 10:09:56,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:56,236 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 253 transitions. [2022-04-08 10:09:56,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 10:09:56,237 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:56,237 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:56,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Ended with exit code 0 [2022-04-08 10:09:56,437 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,107 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:56,437 INFO L403 AbstractCegarLoop]: === Iteration 110 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:56,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:56,438 INFO L85 PathProgramCache]: Analyzing trace with hash -908063361, now seen corresponding path program 209 times [2022-04-08 10:09:56,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:56,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [698638958] [2022-04-08 10:09:56,440 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:56,440 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:56,440 INFO L85 PathProgramCache]: Analyzing trace with hash -908063361, now seen corresponding path program 210 times [2022-04-08 10:09:56,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:56,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607612668] [2022-04-08 10:09:56,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:56,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:56,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:56,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {121704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {121676#true} is VALID [2022-04-08 10:09:56,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {121676#true} assume true; {121676#true} is VALID [2022-04-08 10:09:56,830 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {121676#true} {121676#true} #61#return; {121676#true} is VALID [2022-04-08 10:09:56,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {121676#true} call ULTIMATE.init(); {121704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:56,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {121704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {121676#true} is VALID [2022-04-08 10:09:56,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {121676#true} assume true; {121676#true} is VALID [2022-04-08 10:09:56,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121676#true} {121676#true} #61#return; {121676#true} is VALID [2022-04-08 10:09:56,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {121676#true} call #t~ret11 := main(); {121676#true} is VALID [2022-04-08 10:09:56,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {121676#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {121681#(= main_~y~0 0)} is VALID [2022-04-08 10:09:56,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {121681#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121682#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:56,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {121682#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121683#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:56,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {121683#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121684#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:56,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {121684#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121685#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:56,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {121685#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121686#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:56,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {121686#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121687#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:56,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {121687#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121688#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:56,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {121688#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121689#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:56,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {121689#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121690#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:56,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {121690#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121691#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:56,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {121691#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121692#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:56,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {121692#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {121692#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:56,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {121692#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {121693#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:09:56,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {121693#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121694#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:09:56,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {121694#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121695#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:09:56,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {121695#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121696#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:09:56,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {121696#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121697#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:09:56,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {121697#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121698#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:56,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {121698#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121699#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:09:56,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {121699#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121700#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:09:56,841 INFO L290 TraceCheckUtils]: 26: Hoare triple {121700#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121701#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:09:56,841 INFO L290 TraceCheckUtils]: 27: Hoare triple {121701#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121702#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:09:56,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {121702#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121703#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:09:56,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {121703#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {121677#false} is VALID [2022-04-08 10:09:56,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:56,842 INFO L290 TraceCheckUtils]: 31: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:56,842 INFO L290 TraceCheckUtils]: 32: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:56,842 INFO L290 TraceCheckUtils]: 33: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:56,842 INFO L290 TraceCheckUtils]: 34: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:56,842 INFO L290 TraceCheckUtils]: 35: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:56,842 INFO L290 TraceCheckUtils]: 36: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:56,842 INFO L290 TraceCheckUtils]: 37: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:56,842 INFO L290 TraceCheckUtils]: 38: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:56,843 INFO L290 TraceCheckUtils]: 39: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:56,843 INFO L290 TraceCheckUtils]: 40: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:56,843 INFO L290 TraceCheckUtils]: 41: Hoare triple {121677#false} assume !(~y~0 % 4294967296 > 0); {121677#false} is VALID [2022-04-08 10:09:56,843 INFO L272 TraceCheckUtils]: 42: Hoare triple {121677#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {121677#false} is VALID [2022-04-08 10:09:56,843 INFO L290 TraceCheckUtils]: 43: Hoare triple {121677#false} ~cond := #in~cond; {121677#false} is VALID [2022-04-08 10:09:56,843 INFO L290 TraceCheckUtils]: 44: Hoare triple {121677#false} assume 0 == ~cond; {121677#false} is VALID [2022-04-08 10:09:56,843 INFO L290 TraceCheckUtils]: 45: Hoare triple {121677#false} assume !false; {121677#false} is VALID [2022-04-08 10:09:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:09:56,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:56,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607612668] [2022-04-08 10:09:56,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607612668] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:56,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796653414] [2022-04-08 10:09:56,843 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:09:56,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:56,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:56,844 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:56,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2022-04-08 10:09:57,252 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:09:57,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:57,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-08 10:09:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:57,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:57,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {121676#true} call ULTIMATE.init(); {121676#true} is VALID [2022-04-08 10:09:57,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {121676#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {121676#true} is VALID [2022-04-08 10:09:57,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {121676#true} assume true; {121676#true} is VALID [2022-04-08 10:09:57,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121676#true} {121676#true} #61#return; {121676#true} is VALID [2022-04-08 10:09:57,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {121676#true} call #t~ret11 := main(); {121676#true} is VALID [2022-04-08 10:09:57,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {121676#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {121681#(= main_~y~0 0)} is VALID [2022-04-08 10:09:57,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {121681#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121682#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:57,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {121682#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121683#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:57,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {121683#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121684#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:57,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {121684#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121685#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:57,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {121685#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121686#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:57,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {121686#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121687#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:57,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {121687#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121688#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:57,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {121688#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121689#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:57,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {121689#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121690#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:57,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {121690#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121691#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:57,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {121691#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121692#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:57,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {121692#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {121692#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:57,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {121692#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {121762#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:57,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {121762#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121766#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:09:57,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {121766#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121770#(and (<= main_~y~0 11) (= main_~y~0 (+ main_~z~0 2)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:57,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {121770#(and (<= main_~y~0 11) (= main_~y~0 (+ main_~z~0 2)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121774#(and (<= main_~y~0 11) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:57,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {121774#(and (<= main_~y~0 11) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121778#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:57,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {121778#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121782#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:57,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {121782#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121786#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:57,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {121786#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121790#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 4)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:57,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {121790#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 4)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121794#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ 5 main_~z~0)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:57,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {121794#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ 5 main_~z~0)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121798#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 6)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:57,802 INFO L290 TraceCheckUtils]: 28: Hoare triple {121798#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 6)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121802#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= (+ (- 9) main_~y~0) (+ main_~z~0 1)))} is VALID [2022-04-08 10:09:57,802 INFO L290 TraceCheckUtils]: 29: Hoare triple {121802#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= (+ (- 9) main_~y~0) (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {121677#false} is VALID [2022-04-08 10:09:57,803 INFO L290 TraceCheckUtils]: 30: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:57,803 INFO L290 TraceCheckUtils]: 31: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:57,803 INFO L290 TraceCheckUtils]: 32: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:57,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:57,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:57,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:57,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:57,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:57,803 INFO L290 TraceCheckUtils]: 38: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:57,803 INFO L290 TraceCheckUtils]: 39: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:57,803 INFO L290 TraceCheckUtils]: 40: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:57,803 INFO L290 TraceCheckUtils]: 41: Hoare triple {121677#false} assume !(~y~0 % 4294967296 > 0); {121677#false} is VALID [2022-04-08 10:09:57,803 INFO L272 TraceCheckUtils]: 42: Hoare triple {121677#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {121677#false} is VALID [2022-04-08 10:09:57,803 INFO L290 TraceCheckUtils]: 43: Hoare triple {121677#false} ~cond := #in~cond; {121677#false} is VALID [2022-04-08 10:09:57,803 INFO L290 TraceCheckUtils]: 44: Hoare triple {121677#false} assume 0 == ~cond; {121677#false} is VALID [2022-04-08 10:09:57,803 INFO L290 TraceCheckUtils]: 45: Hoare triple {121677#false} assume !false; {121677#false} is VALID [2022-04-08 10:09:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:09:57,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:58,718 INFO L290 TraceCheckUtils]: 45: Hoare triple {121677#false} assume !false; {121677#false} is VALID [2022-04-08 10:09:58,718 INFO L290 TraceCheckUtils]: 44: Hoare triple {121677#false} assume 0 == ~cond; {121677#false} is VALID [2022-04-08 10:09:58,719 INFO L290 TraceCheckUtils]: 43: Hoare triple {121677#false} ~cond := #in~cond; {121677#false} is VALID [2022-04-08 10:09:58,719 INFO L272 TraceCheckUtils]: 42: Hoare triple {121677#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {121677#false} is VALID [2022-04-08 10:09:58,719 INFO L290 TraceCheckUtils]: 41: Hoare triple {121677#false} assume !(~y~0 % 4294967296 > 0); {121677#false} is VALID [2022-04-08 10:09:58,719 INFO L290 TraceCheckUtils]: 40: Hoare triple {121869#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-08 10:09:58,720 INFO L290 TraceCheckUtils]: 39: Hoare triple {121873#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121869#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:09:58,720 INFO L290 TraceCheckUtils]: 38: Hoare triple {121877#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121873#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:09:58,721 INFO L290 TraceCheckUtils]: 37: Hoare triple {121881#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121877#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:09:58,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {121885#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121881#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:09:58,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {121889#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121885#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:09:58,723 INFO L290 TraceCheckUtils]: 34: Hoare triple {121893#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121889#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:09:58,724 INFO L290 TraceCheckUtils]: 33: Hoare triple {121897#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121893#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:09:58,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {121901#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121897#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:09:58,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {121905#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121901#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:09:58,728 INFO L290 TraceCheckUtils]: 30: Hoare triple {121909#(not (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121905#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} is VALID [2022-04-08 10:09:58,728 INFO L290 TraceCheckUtils]: 29: Hoare triple {121913#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {121909#(not (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-08 10:09:58,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {121917#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121913#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-08 10:09:58,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {121921#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121917#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:09:58,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {121925#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121921#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-08 10:09:58,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {121929#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121925#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:09:58,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {121933#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121929#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-08 10:09:58,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {121937#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121933#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-08 10:09:58,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {121941#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121937#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:09:58,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {121945#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121941#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:09:58,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {121949#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121945#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:09:58,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {121953#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121949#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-08 10:09:58,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {121676#true} ~z~0 := ~y~0; {121953#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} is VALID [2022-04-08 10:09:58,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {121676#true} assume !(~x~0 % 4294967296 > 0); {121676#true} is VALID [2022-04-08 10:09:58,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {121676#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121676#true} is VALID [2022-04-08 10:09:58,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {121676#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121676#true} is VALID [2022-04-08 10:09:58,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {121676#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121676#true} is VALID [2022-04-08 10:09:58,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {121676#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121676#true} is VALID [2022-04-08 10:09:58,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {121676#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121676#true} is VALID [2022-04-08 10:09:58,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {121676#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121676#true} is VALID [2022-04-08 10:09:58,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {121676#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121676#true} is VALID [2022-04-08 10:09:58,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {121676#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121676#true} is VALID [2022-04-08 10:09:58,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {121676#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121676#true} is VALID [2022-04-08 10:09:58,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {121676#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121676#true} is VALID [2022-04-08 10:09:58,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {121676#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {121676#true} is VALID [2022-04-08 10:09:58,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {121676#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {121676#true} is VALID [2022-04-08 10:09:58,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {121676#true} call #t~ret11 := main(); {121676#true} is VALID [2022-04-08 10:09:58,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121676#true} {121676#true} #61#return; {121676#true} is VALID [2022-04-08 10:09:58,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {121676#true} assume true; {121676#true} is VALID [2022-04-08 10:09:58,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {121676#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {121676#true} is VALID [2022-04-08 10:09:58,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {121676#true} call ULTIMATE.init(); {121676#true} is VALID [2022-04-08 10:09:58,737 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:09:58,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796653414] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:58,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:58,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 24] total 59 [2022-04-08 10:09:58,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:58,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [698638958] [2022-04-08 10:09:58,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [698638958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:58,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:58,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 10:09:58,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102386054] [2022-04-08 10:09:58,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:58,738 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-08 10:09:58,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:58,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:58,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:58,763 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 10:09:58,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:58,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 10:09:58,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=3019, Unknown=0, NotChecked=0, Total=3422 [2022-04-08 10:09:58,764 INFO L87 Difference]: Start difference. First operand 196 states and 253 transitions. Second operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:01,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:01,524 INFO L93 Difference]: Finished difference Result 227 states and 284 transitions. [2022-04-08 10:10:01,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 10:10:01,524 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-08 10:10:01,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:01,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 64 transitions. [2022-04-08 10:10:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:01,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 64 transitions. [2022-04-08 10:10:01,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 64 transitions. [2022-04-08 10:10:01,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:01,578 INFO L225 Difference]: With dead ends: 227 [2022-04-08 10:10:01,578 INFO L226 Difference]: Without dead ends: 210 [2022-04-08 10:10:01,579 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=671, Invalid=5971, Unknown=0, NotChecked=0, Total=6642 [2022-04-08 10:10:01,579 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:01,579 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 123 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:10:01,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-08 10:10:02,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 197. [2022-04-08 10:10:02,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:02,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand has 197 states, 192 states have (on average 1.3020833333333333) internal successors, (250), 192 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:02,279 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand has 197 states, 192 states have (on average 1.3020833333333333) internal successors, (250), 192 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:02,279 INFO L87 Difference]: Start difference. First operand 210 states. Second operand has 197 states, 192 states have (on average 1.3020833333333333) internal successors, (250), 192 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:02,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:02,281 INFO L93 Difference]: Finished difference Result 210 states and 267 transitions. [2022-04-08 10:10:02,281 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 267 transitions. [2022-04-08 10:10:02,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:02,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:02,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 197 states, 192 states have (on average 1.3020833333333333) internal successors, (250), 192 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 210 states. [2022-04-08 10:10:02,282 INFO L87 Difference]: Start difference. First operand has 197 states, 192 states have (on average 1.3020833333333333) internal successors, (250), 192 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 210 states. [2022-04-08 10:10:02,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:02,284 INFO L93 Difference]: Finished difference Result 210 states and 267 transitions. [2022-04-08 10:10:02,284 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 267 transitions. [2022-04-08 10:10:02,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:02,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:02,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:02,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 192 states have (on average 1.3020833333333333) internal successors, (250), 192 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 254 transitions. [2022-04-08 10:10:02,287 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 254 transitions. Word has length 46 [2022-04-08 10:10:02,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:02,287 INFO L478 AbstractCegarLoop]: Abstraction has 197 states and 254 transitions. [2022-04-08 10:10:02,287 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:02,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 197 states and 254 transitions. [2022-04-08 10:10:02,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 254 transitions. [2022-04-08 10:10:02,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 10:10:02,896 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:02,896 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:02,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:03,096 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,108 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:03,097 INFO L403 AbstractCegarLoop]: === Iteration 111 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:03,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:03,097 INFO L85 PathProgramCache]: Analyzing trace with hash 54302029, now seen corresponding path program 211 times [2022-04-08 10:10:03,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:03,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [375784900] [2022-04-08 10:10:03,099 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:03,099 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:03,099 INFO L85 PathProgramCache]: Analyzing trace with hash 54302029, now seen corresponding path program 212 times [2022-04-08 10:10:03,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:03,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036386369] [2022-04-08 10:10:03,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:03,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:03,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:03,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {123354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123327#true} is VALID [2022-04-08 10:10:03,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {123327#true} assume true; {123327#true} is VALID [2022-04-08 10:10:03,465 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123327#true} {123327#true} #61#return; {123327#true} is VALID [2022-04-08 10:10:03,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {123327#true} call ULTIMATE.init(); {123354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:03,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {123354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123327#true} is VALID [2022-04-08 10:10:03,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {123327#true} assume true; {123327#true} is VALID [2022-04-08 10:10:03,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123327#true} {123327#true} #61#return; {123327#true} is VALID [2022-04-08 10:10:03,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {123327#true} call #t~ret11 := main(); {123327#true} is VALID [2022-04-08 10:10:03,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {123327#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123332#(= main_~y~0 0)} is VALID [2022-04-08 10:10:03,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {123332#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123333#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:03,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {123333#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123334#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:03,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {123334#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123335#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:03,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {123335#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123336#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:03,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {123336#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123337#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:03,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {123337#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123338#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:03,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {123338#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123339#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:03,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {123339#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123340#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:03,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {123340#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123341#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:03,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {123341#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123342#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:03,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {123342#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123343#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:03,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {123343#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123344#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:03,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {123344#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {123344#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:03,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {123344#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {123345#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:10:03,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {123345#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123346#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:10:03,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {123346#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123347#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:03,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {123347#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123348#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:03,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {123348#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123349#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:03,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {123349#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123350#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:03,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {123350#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123351#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:03,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {123351#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123352#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:10:03,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {123352#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123353#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:10:03,488 INFO L290 TraceCheckUtils]: 28: Hoare triple {123353#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {123328#false} is VALID [2022-04-08 10:10:03,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,488 INFO L290 TraceCheckUtils]: 31: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,488 INFO L290 TraceCheckUtils]: 32: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,488 INFO L290 TraceCheckUtils]: 33: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,488 INFO L290 TraceCheckUtils]: 34: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,488 INFO L290 TraceCheckUtils]: 35: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,488 INFO L290 TraceCheckUtils]: 36: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,488 INFO L290 TraceCheckUtils]: 37: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,488 INFO L290 TraceCheckUtils]: 39: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,489 INFO L290 TraceCheckUtils]: 40: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,489 INFO L290 TraceCheckUtils]: 41: Hoare triple {123328#false} assume !(~y~0 % 4294967296 > 0); {123328#false} is VALID [2022-04-08 10:10:03,489 INFO L272 TraceCheckUtils]: 42: Hoare triple {123328#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {123328#false} is VALID [2022-04-08 10:10:03,489 INFO L290 TraceCheckUtils]: 43: Hoare triple {123328#false} ~cond := #in~cond; {123328#false} is VALID [2022-04-08 10:10:03,489 INFO L290 TraceCheckUtils]: 44: Hoare triple {123328#false} assume 0 == ~cond; {123328#false} is VALID [2022-04-08 10:10:03,489 INFO L290 TraceCheckUtils]: 45: Hoare triple {123328#false} assume !false; {123328#false} is VALID [2022-04-08 10:10:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:10:03,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:03,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036386369] [2022-04-08 10:10:03,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036386369] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:03,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517658023] [2022-04-08 10:10:03,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:10:03,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:03,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:03,490 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:03,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2022-04-08 10:10:03,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:10:03,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:03,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:10:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:03,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:03,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {123327#true} call ULTIMATE.init(); {123327#true} is VALID [2022-04-08 10:10:03,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {123327#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123327#true} is VALID [2022-04-08 10:10:03,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {123327#true} assume true; {123327#true} is VALID [2022-04-08 10:10:03,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123327#true} {123327#true} #61#return; {123327#true} is VALID [2022-04-08 10:10:03,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {123327#true} call #t~ret11 := main(); {123327#true} is VALID [2022-04-08 10:10:03,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {123327#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123332#(= main_~y~0 0)} is VALID [2022-04-08 10:10:03,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {123332#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123333#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:03,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {123333#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123334#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:03,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {123334#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123335#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:03,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {123335#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123336#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:03,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {123336#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123337#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:03,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {123337#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123338#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:03,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {123338#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123339#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:03,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {123339#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123340#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:03,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {123340#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123341#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:03,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {123341#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123342#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:03,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {123342#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123343#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:03,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {123343#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123344#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:03,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {123344#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {123344#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:03,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {123344#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {123345#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:10:03,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {123345#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123346#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:10:03,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {123346#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123347#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:03,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {123347#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123348#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:03,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {123348#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123349#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:03,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {123349#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123350#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:03,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {123350#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123351#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:03,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {123351#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123352#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:10:03,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {123352#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123439#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:10:03,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {123439#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {123328#false} is VALID [2022-04-08 10:10:03,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,900 INFO L290 TraceCheckUtils]: 32: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,900 INFO L290 TraceCheckUtils]: 33: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,900 INFO L290 TraceCheckUtils]: 34: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,900 INFO L290 TraceCheckUtils]: 35: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,900 INFO L290 TraceCheckUtils]: 36: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,900 INFO L290 TraceCheckUtils]: 38: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,900 INFO L290 TraceCheckUtils]: 39: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,900 INFO L290 TraceCheckUtils]: 40: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:03,900 INFO L290 TraceCheckUtils]: 41: Hoare triple {123328#false} assume !(~y~0 % 4294967296 > 0); {123328#false} is VALID [2022-04-08 10:10:03,900 INFO L272 TraceCheckUtils]: 42: Hoare triple {123328#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {123328#false} is VALID [2022-04-08 10:10:03,900 INFO L290 TraceCheckUtils]: 43: Hoare triple {123328#false} ~cond := #in~cond; {123328#false} is VALID [2022-04-08 10:10:03,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {123328#false} assume 0 == ~cond; {123328#false} is VALID [2022-04-08 10:10:03,901 INFO L290 TraceCheckUtils]: 45: Hoare triple {123328#false} assume !false; {123328#false} is VALID [2022-04-08 10:10:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:10:03,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:04,644 INFO L290 TraceCheckUtils]: 45: Hoare triple {123328#false} assume !false; {123328#false} is VALID [2022-04-08 10:10:04,644 INFO L290 TraceCheckUtils]: 44: Hoare triple {123328#false} assume 0 == ~cond; {123328#false} is VALID [2022-04-08 10:10:04,644 INFO L290 TraceCheckUtils]: 43: Hoare triple {123328#false} ~cond := #in~cond; {123328#false} is VALID [2022-04-08 10:10:04,645 INFO L272 TraceCheckUtils]: 42: Hoare triple {123328#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {123328#false} is VALID [2022-04-08 10:10:04,645 INFO L290 TraceCheckUtils]: 41: Hoare triple {123328#false} assume !(~y~0 % 4294967296 > 0); {123328#false} is VALID [2022-04-08 10:10:04,645 INFO L290 TraceCheckUtils]: 40: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:04,645 INFO L290 TraceCheckUtils]: 39: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:04,645 INFO L290 TraceCheckUtils]: 38: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:04,645 INFO L290 TraceCheckUtils]: 37: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:04,645 INFO L290 TraceCheckUtils]: 36: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:04,645 INFO L290 TraceCheckUtils]: 35: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:04,645 INFO L290 TraceCheckUtils]: 34: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:04,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:04,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:04,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:04,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:04,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-08 10:10:04,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {123545#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {123328#false} is VALID [2022-04-08 10:10:04,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {123549#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123545#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:04,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {123553#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123549#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:04,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {123557#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123553#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:04,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {123561#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123557#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:04,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {123565#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123561#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:04,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {123569#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123565#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:04,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {123573#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123569#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:04,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {123577#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123573#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:10:04,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {123581#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} ~z~0 := ~y~0; {123577#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:04,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {123581#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {123581#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:04,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {123588#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123581#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:04,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {123592#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123588#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:10:04,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {123596#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123592#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:04,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {123600#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123596#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:04,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {123604#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123600#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:04,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {123608#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123604#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:04,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {123612#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123608#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:04,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {123616#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123612#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:04,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {123620#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123616#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:04,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {123624#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123620#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:04,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {123628#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123624#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:10:04,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {123632#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123628#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:10:04,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {123327#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123632#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:10:04,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {123327#true} call #t~ret11 := main(); {123327#true} is VALID [2022-04-08 10:10:04,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123327#true} {123327#true} #61#return; {123327#true} is VALID [2022-04-08 10:10:04,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {123327#true} assume true; {123327#true} is VALID [2022-04-08 10:10:04,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {123327#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123327#true} is VALID [2022-04-08 10:10:04,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {123327#true} call ULTIMATE.init(); {123327#true} is VALID [2022-04-08 10:10:04,660 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:10:04,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517658023] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:04,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:04,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-08 10:10:04,660 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:04,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [375784900] [2022-04-08 10:10:04,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [375784900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:04,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:04,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:10:04,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763239251] [2022-04-08 10:10:04,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:04,661 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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 46 [2022-04-08 10:10:04,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:04,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:10:04,684 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-08 10:10:04,684 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:10:04,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:04,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:10:04,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1914, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:10:04,685 INFO L87 Difference]: Start difference. First operand 197 states and 254 transitions. Second operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:10:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:07,388 INFO L93 Difference]: Finished difference Result 230 states and 287 transitions. [2022-04-08 10:10:07,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 10:10:07,388 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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 46 [2022-04-08 10:10:07,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:07,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:10:07,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 76 transitions. [2022-04-08 10:10:07,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:10:07,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 76 transitions. [2022-04-08 10:10:07,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 76 transitions. [2022-04-08 10:10:07,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:07,452 INFO L225 Difference]: With dead ends: 230 [2022-04-08 10:10:07,452 INFO L226 Difference]: Without dead ends: 212 [2022-04-08 10:10:07,452 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1042, Invalid=4964, Unknown=0, NotChecked=0, Total=6006 [2022-04-08 10:10:07,452 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:07,453 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 90 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:10:07,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-08 10:10:08,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 198. [2022-04-08 10:10:08,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:08,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 198 states, 193 states have (on average 1.3005181347150259) internal successors, (251), 193 states have internal predecessors, (251), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:08,163 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 198 states, 193 states have (on average 1.3005181347150259) internal successors, (251), 193 states have internal predecessors, (251), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:08,163 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 198 states, 193 states have (on average 1.3005181347150259) internal successors, (251), 193 states have internal predecessors, (251), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:08,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:08,165 INFO L93 Difference]: Finished difference Result 212 states and 269 transitions. [2022-04-08 10:10:08,165 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 269 transitions. [2022-04-08 10:10:08,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:08,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:08,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 193 states have (on average 1.3005181347150259) internal successors, (251), 193 states have internal predecessors, (251), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 212 states. [2022-04-08 10:10:08,166 INFO L87 Difference]: Start difference. First operand has 198 states, 193 states have (on average 1.3005181347150259) internal successors, (251), 193 states have internal predecessors, (251), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 212 states. [2022-04-08 10:10:08,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:08,168 INFO L93 Difference]: Finished difference Result 212 states and 269 transitions. [2022-04-08 10:10:08,168 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 269 transitions. [2022-04-08 10:10:08,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:08,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:08,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:08,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:08,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 193 states have (on average 1.3005181347150259) internal successors, (251), 193 states have internal predecessors, (251), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:08,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 255 transitions. [2022-04-08 10:10:08,170 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 255 transitions. Word has length 46 [2022-04-08 10:10:08,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:08,170 INFO L478 AbstractCegarLoop]: Abstraction has 198 states and 255 transitions. [2022-04-08 10:10:08,171 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:10:08,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 198 states and 255 transitions. [2022-04-08 10:10:08,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:08,810 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 255 transitions. [2022-04-08 10:10:08,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 10:10:08,810 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:08,810 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:08,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Ended with exit code 0 [2022-04-08 10:10:09,010 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,109 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:09,010 INFO L403 AbstractCegarLoop]: === Iteration 112 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:09,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash -597161089, now seen corresponding path program 213 times [2022-04-08 10:10:09,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:09,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1507392805] [2022-04-08 10:10:09,013 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:09,013 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:09,013 INFO L85 PathProgramCache]: Analyzing trace with hash -597161089, now seen corresponding path program 214 times [2022-04-08 10:10:09,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:09,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117684091] [2022-04-08 10:10:09,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:09,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:09,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:09,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {125019#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {124993#true} is VALID [2022-04-08 10:10:09,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {124993#true} assume true; {124993#true} is VALID [2022-04-08 10:10:09,365 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {124993#true} {124993#true} #61#return; {124993#true} is VALID [2022-04-08 10:10:09,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {124993#true} call ULTIMATE.init(); {125019#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:09,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {125019#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {124993#true} is VALID [2022-04-08 10:10:09,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {124993#true} assume true; {124993#true} is VALID [2022-04-08 10:10:09,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124993#true} {124993#true} #61#return; {124993#true} is VALID [2022-04-08 10:10:09,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {124993#true} call #t~ret11 := main(); {124993#true} is VALID [2022-04-08 10:10:09,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {124993#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {124998#(= main_~y~0 0)} is VALID [2022-04-08 10:10:09,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {124998#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {124999#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:09,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {124999#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125000#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:09,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {125000#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125001#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:09,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {125001#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125002#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:09,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {125002#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125003#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:09,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {125003#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125004#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:09,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {125004#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125005#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:09,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {125005#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125006#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:09,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {125006#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125007#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:09,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {125007#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125008#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:09,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {125008#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125009#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:09,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {125009#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125010#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:09,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {125010#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125011#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:09,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {125011#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {125011#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:09,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {125011#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {125012#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:10:09,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {125012#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125013#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:10:09,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {125013#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125014#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:10:09,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {125014#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125015#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:09,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {125015#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125016#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:09,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {125016#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125017#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:09,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {125017#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125018#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:10:09,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {125018#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {124994#false} is VALID [2022-04-08 10:10:09,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,377 INFO L290 TraceCheckUtils]: 31: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,377 INFO L290 TraceCheckUtils]: 32: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,377 INFO L290 TraceCheckUtils]: 34: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,377 INFO L290 TraceCheckUtils]: 35: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,377 INFO L290 TraceCheckUtils]: 36: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,377 INFO L290 TraceCheckUtils]: 37: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,377 INFO L290 TraceCheckUtils]: 38: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,377 INFO L290 TraceCheckUtils]: 40: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {124994#false} assume !(~y~0 % 4294967296 > 0); {124994#false} is VALID [2022-04-08 10:10:09,377 INFO L272 TraceCheckUtils]: 42: Hoare triple {124994#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {124994#false} is VALID [2022-04-08 10:10:09,377 INFO L290 TraceCheckUtils]: 43: Hoare triple {124994#false} ~cond := #in~cond; {124994#false} is VALID [2022-04-08 10:10:09,377 INFO L290 TraceCheckUtils]: 44: Hoare triple {124994#false} assume 0 == ~cond; {124994#false} is VALID [2022-04-08 10:10:09,377 INFO L290 TraceCheckUtils]: 45: Hoare triple {124994#false} assume !false; {124994#false} is VALID [2022-04-08 10:10:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:10:09,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:09,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117684091] [2022-04-08 10:10:09,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117684091] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:09,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12034251] [2022-04-08 10:10:09,378 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:10:09,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:09,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:09,379 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:09,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2022-04-08 10:10:09,430 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:10:09,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:09,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:10:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:09,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:09,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {124993#true} call ULTIMATE.init(); {124993#true} is VALID [2022-04-08 10:10:09,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {124993#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {124993#true} is VALID [2022-04-08 10:10:09,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {124993#true} assume true; {124993#true} is VALID [2022-04-08 10:10:09,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124993#true} {124993#true} #61#return; {124993#true} is VALID [2022-04-08 10:10:09,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {124993#true} call #t~ret11 := main(); {124993#true} is VALID [2022-04-08 10:10:09,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {124993#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {124998#(= main_~y~0 0)} is VALID [2022-04-08 10:10:09,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {124998#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {124999#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:09,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {124999#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125000#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:09,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {125000#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125001#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:09,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {125001#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125002#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:09,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {125002#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125003#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:09,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {125003#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125004#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:09,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {125004#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125005#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:09,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {125005#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125006#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:09,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {125006#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125007#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:09,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {125007#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125008#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:09,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {125008#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125009#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:09,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {125009#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125010#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:09,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {125010#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125011#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:09,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {125011#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {125011#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:09,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {125011#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {125012#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:10:09,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {125012#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125013#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:10:09,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {125013#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125014#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:10:09,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {125014#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125015#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:09,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {125015#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125016#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:09,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {125016#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125017#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:09,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {125017#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125101#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:09,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {125101#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {124994#false} is VALID [2022-04-08 10:10:09,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,792 INFO L290 TraceCheckUtils]: 35: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:09,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {124994#false} assume !(~y~0 % 4294967296 > 0); {124994#false} is VALID [2022-04-08 10:10:09,792 INFO L272 TraceCheckUtils]: 42: Hoare triple {124994#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {124994#false} is VALID [2022-04-08 10:10:09,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {124994#false} ~cond := #in~cond; {124994#false} is VALID [2022-04-08 10:10:09,792 INFO L290 TraceCheckUtils]: 44: Hoare triple {124994#false} assume 0 == ~cond; {124994#false} is VALID [2022-04-08 10:10:09,792 INFO L290 TraceCheckUtils]: 45: Hoare triple {124994#false} assume !false; {124994#false} is VALID [2022-04-08 10:10:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:10:09,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:10,500 INFO L290 TraceCheckUtils]: 45: Hoare triple {124994#false} assume !false; {124994#false} is VALID [2022-04-08 10:10:10,500 INFO L290 TraceCheckUtils]: 44: Hoare triple {124994#false} assume 0 == ~cond; {124994#false} is VALID [2022-04-08 10:10:10,500 INFO L290 TraceCheckUtils]: 43: Hoare triple {124994#false} ~cond := #in~cond; {124994#false} is VALID [2022-04-08 10:10:10,500 INFO L272 TraceCheckUtils]: 42: Hoare triple {124994#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {124994#false} is VALID [2022-04-08 10:10:10,500 INFO L290 TraceCheckUtils]: 41: Hoare triple {124994#false} assume !(~y~0 % 4294967296 > 0); {124994#false} is VALID [2022-04-08 10:10:10,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:10,501 INFO L290 TraceCheckUtils]: 39: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:10,501 INFO L290 TraceCheckUtils]: 38: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:10,501 INFO L290 TraceCheckUtils]: 37: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:10,501 INFO L290 TraceCheckUtils]: 36: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:10,501 INFO L290 TraceCheckUtils]: 35: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:10,501 INFO L290 TraceCheckUtils]: 34: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:10,501 INFO L290 TraceCheckUtils]: 33: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:10,501 INFO L290 TraceCheckUtils]: 32: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:10,501 INFO L290 TraceCheckUtils]: 31: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:10,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:10,501 INFO L290 TraceCheckUtils]: 29: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:10,501 INFO L290 TraceCheckUtils]: 28: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-08 10:10:10,501 INFO L290 TraceCheckUtils]: 27: Hoare triple {125213#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {124994#false} is VALID [2022-04-08 10:10:10,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {125217#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125213#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:10,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {125221#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125217#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:10,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {125225#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125221#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:10,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {125229#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125225#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:10,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {125233#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125229#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:10,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {125237#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125233#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:10,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {125241#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {125237#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:10,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {125241#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {125241#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:10,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {125248#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125241#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:10,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {125252#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125248#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:10,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {125256#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125252#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:10,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {125260#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125256#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:10,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {125264#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125260#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:10,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {125268#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125264#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:10,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {125272#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125268#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:10,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {125276#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125272#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:10,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {125280#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125276#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:10:10,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {125284#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125280#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:10:10,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {125288#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125284#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:10:10,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {125292#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125288#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:10,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {125296#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125292#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:10:10,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {124993#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {125296#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:10,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {124993#true} call #t~ret11 := main(); {124993#true} is VALID [2022-04-08 10:10:10,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124993#true} {124993#true} #61#return; {124993#true} is VALID [2022-04-08 10:10:10,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {124993#true} assume true; {124993#true} is VALID [2022-04-08 10:10:10,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {124993#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {124993#true} is VALID [2022-04-08 10:10:10,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {124993#true} call ULTIMATE.init(); {124993#true} is VALID [2022-04-08 10:10:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:10:10,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12034251] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:10,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:10,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-08 10:10:10,516 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:10,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1507392805] [2022-04-08 10:10:10,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1507392805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:10,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:10,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:10:10,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963301786] [2022-04-08 10:10:10,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:10,516 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-08 10:10:10,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:10,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:10,539 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-08 10:10:10,539 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:10:10,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:10,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:10:10,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=1729, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:10:10,540 INFO L87 Difference]: Start difference. First operand 198 states and 255 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:13,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:13,462 INFO L93 Difference]: Finished difference Result 233 states and 290 transitions. [2022-04-08 10:10:13,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-08 10:10:13,463 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-08 10:10:13,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 83 transitions. [2022-04-08 10:10:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 83 transitions. [2022-04-08 10:10:13,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 83 transitions. [2022-04-08 10:10:13,529 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-08 10:10:13,531 INFO L225 Difference]: With dead ends: 233 [2022-04-08 10:10:13,531 INFO L226 Difference]: Without dead ends: 214 [2022-04-08 10:10:13,532 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1102, Invalid=4904, Unknown=0, NotChecked=0, Total=6006 [2022-04-08 10:10:13,532 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:13,532 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 102 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:10:13,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-04-08 10:10:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 199. [2022-04-08 10:10:14,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:14,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:14,249 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:14,249 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:14,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:14,251 INFO L93 Difference]: Finished difference Result 214 states and 271 transitions. [2022-04-08 10:10:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 271 transitions. [2022-04-08 10:10:14,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:14,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:14,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 214 states. [2022-04-08 10:10:14,252 INFO L87 Difference]: Start difference. First operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 214 states. [2022-04-08 10:10:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:14,254 INFO L93 Difference]: Finished difference Result 214 states and 271 transitions. [2022-04-08 10:10:14,254 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 271 transitions. [2022-04-08 10:10:14,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:14,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:14,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:14,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:14,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 256 transitions. [2022-04-08 10:10:14,257 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 256 transitions. Word has length 46 [2022-04-08 10:10:14,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:14,257 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 256 transitions. [2022-04-08 10:10:14,257 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:14,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 256 transitions. [2022-04-08 10:10:14,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:14,887 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 256 transitions. [2022-04-08 10:10:14,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 10:10:14,887 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:14,887 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:14,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Ended with exit code 0 [2022-04-08 10:10:15,087 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2022-04-08 10:10:15,088 INFO L403 AbstractCegarLoop]: === Iteration 113 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:15,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:15,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1084411725, now seen corresponding path program 215 times [2022-04-08 10:10:15,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:15,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1468869855] [2022-04-08 10:10:15,090 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:15,090 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:15,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1084411725, now seen corresponding path program 216 times [2022-04-08 10:10:15,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:15,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354340061] [2022-04-08 10:10:15,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:15,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:15,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:15,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {126698#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {126673#true} is VALID [2022-04-08 10:10:15,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {126673#true} assume true; {126673#true} is VALID [2022-04-08 10:10:15,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {126673#true} {126673#true} #61#return; {126673#true} is VALID [2022-04-08 10:10:15,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {126673#true} call ULTIMATE.init(); {126698#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:15,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {126698#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {126673#true} is VALID [2022-04-08 10:10:15,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {126673#true} assume true; {126673#true} is VALID [2022-04-08 10:10:15,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126673#true} {126673#true} #61#return; {126673#true} is VALID [2022-04-08 10:10:15,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {126673#true} call #t~ret11 := main(); {126673#true} is VALID [2022-04-08 10:10:15,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {126673#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {126678#(= main_~y~0 0)} is VALID [2022-04-08 10:10:15,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {126678#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126679#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:15,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {126679#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126680#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:15,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {126680#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126681#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:15,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {126681#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126682#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:15,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {126682#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126683#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:15,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {126683#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126684#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:15,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {126684#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126685#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:15,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {126685#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126686#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:15,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {126686#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126687#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:15,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {126687#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126688#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:15,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {126688#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126689#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:15,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {126689#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126690#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:15,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {126690#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126691#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:15,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {126691#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126692#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:15,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {126692#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {126692#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:15,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {126692#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {126693#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:10:15,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {126693#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126694#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:10:15,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {126694#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126695#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:10:15,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {126695#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126696#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:10:15,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {126696#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126697#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:10:15,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {126697#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {126674#false} is VALID [2022-04-08 10:10:15,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:15,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:15,423 INFO L290 TraceCheckUtils]: 29: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:15,423 INFO L290 TraceCheckUtils]: 30: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:15,423 INFO L290 TraceCheckUtils]: 31: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:15,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:15,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:15,423 INFO L290 TraceCheckUtils]: 34: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:15,423 INFO L290 TraceCheckUtils]: 35: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:15,423 INFO L290 TraceCheckUtils]: 36: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:15,423 INFO L290 TraceCheckUtils]: 37: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:15,423 INFO L290 TraceCheckUtils]: 38: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:15,423 INFO L290 TraceCheckUtils]: 39: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:15,423 INFO L290 TraceCheckUtils]: 40: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:15,423 INFO L290 TraceCheckUtils]: 41: Hoare triple {126674#false} assume !(~y~0 % 4294967296 > 0); {126674#false} is VALID [2022-04-08 10:10:15,423 INFO L272 TraceCheckUtils]: 42: Hoare triple {126674#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {126674#false} is VALID [2022-04-08 10:10:15,423 INFO L290 TraceCheckUtils]: 43: Hoare triple {126674#false} ~cond := #in~cond; {126674#false} is VALID [2022-04-08 10:10:15,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {126674#false} assume 0 == ~cond; {126674#false} is VALID [2022-04-08 10:10:15,423 INFO L290 TraceCheckUtils]: 45: Hoare triple {126674#false} assume !false; {126674#false} is VALID [2022-04-08 10:10:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:10:15,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:15,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354340061] [2022-04-08 10:10:15,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354340061] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:15,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788013657] [2022-04-08 10:10:15,424 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:10:15,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:15,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:15,425 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:15,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2022-04-08 10:10:16,045 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 10:10:16,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:16,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 10:10:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:16,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:16,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {126673#true} call ULTIMATE.init(); {126673#true} is VALID [2022-04-08 10:10:16,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {126673#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {126673#true} is VALID [2022-04-08 10:10:16,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {126673#true} assume true; {126673#true} is VALID [2022-04-08 10:10:16,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126673#true} {126673#true} #61#return; {126673#true} is VALID [2022-04-08 10:10:16,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {126673#true} call #t~ret11 := main(); {126673#true} is VALID [2022-04-08 10:10:16,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {126673#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {126678#(= main_~y~0 0)} is VALID [2022-04-08 10:10:16,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {126678#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126679#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:16,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {126679#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126680#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:16,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {126680#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126681#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:16,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {126681#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126682#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:16,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {126682#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126683#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:16,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {126683#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126684#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:16,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {126684#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126685#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:16,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {126685#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126686#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:16,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {126686#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126687#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:16,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {126687#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126688#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:16,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {126688#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126689#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:16,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {126689#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126690#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:16,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {126690#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126691#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:16,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {126691#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126692#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:16,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {126692#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {126692#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:16,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {126692#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {126693#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:10:16,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {126693#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126694#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:10:16,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {126694#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126695#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:10:16,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {126695#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126696#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:10:16,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {126696#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126777#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:16,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {126777#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {126674#false} is VALID [2022-04-08 10:10:16,405 INFO L290 TraceCheckUtils]: 27: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:16,405 INFO L290 TraceCheckUtils]: 28: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:16,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:16,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:16,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:16,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:16,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:16,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:16,405 INFO L290 TraceCheckUtils]: 35: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:16,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:16,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:16,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:16,405 INFO L290 TraceCheckUtils]: 39: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:16,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:16,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {126674#false} assume !(~y~0 % 4294967296 > 0); {126674#false} is VALID [2022-04-08 10:10:16,406 INFO L272 TraceCheckUtils]: 42: Hoare triple {126674#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {126674#false} is VALID [2022-04-08 10:10:16,406 INFO L290 TraceCheckUtils]: 43: Hoare triple {126674#false} ~cond := #in~cond; {126674#false} is VALID [2022-04-08 10:10:16,406 INFO L290 TraceCheckUtils]: 44: Hoare triple {126674#false} assume 0 == ~cond; {126674#false} is VALID [2022-04-08 10:10:16,406 INFO L290 TraceCheckUtils]: 45: Hoare triple {126674#false} assume !false; {126674#false} is VALID [2022-04-08 10:10:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:10:16,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:17,066 INFO L290 TraceCheckUtils]: 45: Hoare triple {126674#false} assume !false; {126674#false} is VALID [2022-04-08 10:10:17,066 INFO L290 TraceCheckUtils]: 44: Hoare triple {126674#false} assume 0 == ~cond; {126674#false} is VALID [2022-04-08 10:10:17,066 INFO L290 TraceCheckUtils]: 43: Hoare triple {126674#false} ~cond := #in~cond; {126674#false} is VALID [2022-04-08 10:10:17,066 INFO L272 TraceCheckUtils]: 42: Hoare triple {126674#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {126674#false} is VALID [2022-04-08 10:10:17,066 INFO L290 TraceCheckUtils]: 41: Hoare triple {126674#false} assume !(~y~0 % 4294967296 > 0); {126674#false} is VALID [2022-04-08 10:10:17,066 INFO L290 TraceCheckUtils]: 40: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:17,066 INFO L290 TraceCheckUtils]: 39: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:17,066 INFO L290 TraceCheckUtils]: 38: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:17,066 INFO L290 TraceCheckUtils]: 37: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:17,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:17,067 INFO L290 TraceCheckUtils]: 35: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:17,067 INFO L290 TraceCheckUtils]: 34: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:17,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:17,067 INFO L290 TraceCheckUtils]: 32: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:17,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:17,067 INFO L290 TraceCheckUtils]: 30: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:17,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:17,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:17,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-08 10:10:17,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {126895#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {126674#false} is VALID [2022-04-08 10:10:17,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {126899#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126895#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:17,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {126903#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126899#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:17,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {126907#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126903#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:17,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {126911#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126907#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:17,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {126915#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {126911#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:17,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {126915#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {126915#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:17,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {126922#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126915#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:17,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {126926#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126922#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:17,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {126930#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126926#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:17,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {126934#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126930#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:17,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {126938#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126934#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:17,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {126942#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126938#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:17,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {126946#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126942#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:10:17,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {126950#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126946#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:10:17,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {126954#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126950#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:10:17,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {126958#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126954#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:17,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {126962#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126958#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:10:17,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {126966#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126962#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:17,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {126970#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126966#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:10:17,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {126974#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126970#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:10:17,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {126673#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {126974#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:10:17,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {126673#true} call #t~ret11 := main(); {126673#true} is VALID [2022-04-08 10:10:17,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126673#true} {126673#true} #61#return; {126673#true} is VALID [2022-04-08 10:10:17,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {126673#true} assume true; {126673#true} is VALID [2022-04-08 10:10:17,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {126673#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {126673#true} is VALID [2022-04-08 10:10:17,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {126673#true} call ULTIMATE.init(); {126673#true} is VALID [2022-04-08 10:10:17,080 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:10:17,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788013657] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:17,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:17,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-08 10:10:17,081 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:17,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1468869855] [2022-04-08 10:10:17,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1468869855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:17,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:17,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:10:17,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218332239] [2022-04-08 10:10:17,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:17,081 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-08 10:10:17,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:17,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:17,102 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-08 10:10:17,103 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:10:17,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:17,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:10:17,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=1552, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:10:17,103 INFO L87 Difference]: Start difference. First operand 199 states and 256 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:20,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:20,133 INFO L93 Difference]: Finished difference Result 236 states and 293 transitions. [2022-04-08 10:10:20,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 10:10:20,133 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-08 10:10:20,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:20,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:20,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 85 transitions. [2022-04-08 10:10:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:20,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 85 transitions. [2022-04-08 10:10:20,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 85 transitions. [2022-04-08 10:10:20,203 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-08 10:10:20,205 INFO L225 Difference]: With dead ends: 236 [2022-04-08 10:10:20,206 INFO L226 Difference]: Without dead ends: 216 [2022-04-08 10:10:20,206 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1004, Invalid=4252, Unknown=0, NotChecked=0, Total=5256 [2022-04-08 10:10:20,206 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:20,206 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 124 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:10:20,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-04-08 10:10:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 200. [2022-04-08 10:10:20,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:20,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand has 200 states, 195 states have (on average 1.2974358974358975) internal successors, (253), 195 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:20,937 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand has 200 states, 195 states have (on average 1.2974358974358975) internal successors, (253), 195 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:20,937 INFO L87 Difference]: Start difference. First operand 216 states. Second operand has 200 states, 195 states have (on average 1.2974358974358975) internal successors, (253), 195 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:20,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:20,939 INFO L93 Difference]: Finished difference Result 216 states and 273 transitions. [2022-04-08 10:10:20,939 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 273 transitions. [2022-04-08 10:10:20,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:20,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:20,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 200 states, 195 states have (on average 1.2974358974358975) internal successors, (253), 195 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 216 states. [2022-04-08 10:10:20,940 INFO L87 Difference]: Start difference. First operand has 200 states, 195 states have (on average 1.2974358974358975) internal successors, (253), 195 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 216 states. [2022-04-08 10:10:20,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:20,942 INFO L93 Difference]: Finished difference Result 216 states and 273 transitions. [2022-04-08 10:10:20,942 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 273 transitions. [2022-04-08 10:10:20,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:20,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:20,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:20,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:20,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 195 states have (on average 1.2974358974358975) internal successors, (253), 195 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:20,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 257 transitions. [2022-04-08 10:10:20,944 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 257 transitions. Word has length 46 [2022-04-08 10:10:20,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:20,945 INFO L478 AbstractCegarLoop]: Abstraction has 200 states and 257 transitions. [2022-04-08 10:10:20,945 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:20,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 200 states and 257 transitions. [2022-04-08 10:10:21,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:21,569 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 257 transitions. [2022-04-08 10:10:21,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 10:10:21,569 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:21,569 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:21,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:21,774 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 111 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112 [2022-04-08 10:10:21,774 INFO L403 AbstractCegarLoop]: === Iteration 114 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:21,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:21,774 INFO L85 PathProgramCache]: Analyzing trace with hash -114583169, now seen corresponding path program 217 times [2022-04-08 10:10:21,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:21,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [934457881] [2022-04-08 10:10:21,777 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:21,777 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:21,777 INFO L85 PathProgramCache]: Analyzing trace with hash -114583169, now seen corresponding path program 218 times [2022-04-08 10:10:21,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:21,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199521020] [2022-04-08 10:10:21,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:21,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:22,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:22,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {128381#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {128357#true} is VALID [2022-04-08 10:10:22,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {128357#true} assume true; {128357#true} is VALID [2022-04-08 10:10:22,081 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {128357#true} {128357#true} #61#return; {128357#true} is VALID [2022-04-08 10:10:22,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {128357#true} call ULTIMATE.init(); {128381#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:22,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {128381#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {128357#true} is VALID [2022-04-08 10:10:22,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {128357#true} assume true; {128357#true} is VALID [2022-04-08 10:10:22,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128357#true} {128357#true} #61#return; {128357#true} is VALID [2022-04-08 10:10:22,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {128357#true} call #t~ret11 := main(); {128357#true} is VALID [2022-04-08 10:10:22,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {128357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {128362#(= main_~y~0 0)} is VALID [2022-04-08 10:10:22,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {128362#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:22,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {128363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128364#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:22,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {128364#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128365#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:22,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {128365#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128366#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:22,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {128366#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128367#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:22,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {128367#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128368#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:22,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {128368#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128369#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:22,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {128369#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128370#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:22,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {128370#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128371#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:22,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {128371#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128372#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:22,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {128372#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128373#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:22,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {128373#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128374#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:22,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {128374#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128375#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:22,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {128375#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128376#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:22,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {128376#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128377#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:22,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {128377#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {128377#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:22,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {128377#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {128378#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:10:22,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {128378#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {128379#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:10:22,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {128379#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {128380#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:10:22,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {128380#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {128358#false} is VALID [2022-04-08 10:10:22,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,092 INFO L290 TraceCheckUtils]: 34: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,092 INFO L290 TraceCheckUtils]: 35: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,092 INFO L290 TraceCheckUtils]: 36: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,092 INFO L290 TraceCheckUtils]: 37: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,092 INFO L290 TraceCheckUtils]: 38: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,092 INFO L290 TraceCheckUtils]: 39: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,092 INFO L290 TraceCheckUtils]: 40: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,092 INFO L290 TraceCheckUtils]: 41: Hoare triple {128358#false} assume !(~y~0 % 4294967296 > 0); {128358#false} is VALID [2022-04-08 10:10:22,092 INFO L272 TraceCheckUtils]: 42: Hoare triple {128358#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {128358#false} is VALID [2022-04-08 10:10:22,092 INFO L290 TraceCheckUtils]: 43: Hoare triple {128358#false} ~cond := #in~cond; {128358#false} is VALID [2022-04-08 10:10:22,092 INFO L290 TraceCheckUtils]: 44: Hoare triple {128358#false} assume 0 == ~cond; {128358#false} is VALID [2022-04-08 10:10:22,092 INFO L290 TraceCheckUtils]: 45: Hoare triple {128358#false} assume !false; {128358#false} is VALID [2022-04-08 10:10:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 10:10:22,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:22,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199521020] [2022-04-08 10:10:22,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199521020] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:22,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486906503] [2022-04-08 10:10:22,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:10:22,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:22,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:22,094 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:22,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2022-04-08 10:10:22,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:10:22,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:22,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 10:10:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:22,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:22,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {128357#true} call ULTIMATE.init(); {128357#true} is VALID [2022-04-08 10:10:22,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {128357#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {128357#true} is VALID [2022-04-08 10:10:22,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {128357#true} assume true; {128357#true} is VALID [2022-04-08 10:10:22,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128357#true} {128357#true} #61#return; {128357#true} is VALID [2022-04-08 10:10:22,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {128357#true} call #t~ret11 := main(); {128357#true} is VALID [2022-04-08 10:10:22,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {128357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {128362#(= main_~y~0 0)} is VALID [2022-04-08 10:10:22,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {128362#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:22,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {128363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128364#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:22,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {128364#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128365#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:22,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {128365#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128366#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:22,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {128366#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128367#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:22,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {128367#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128368#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:22,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {128368#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128369#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:22,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {128369#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128370#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:22,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {128370#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128371#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:22,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {128371#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128372#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:22,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {128372#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128373#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:22,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {128373#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128374#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:22,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {128374#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128375#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:22,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {128375#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128376#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:22,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {128376#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128377#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:22,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {128377#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {128377#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:22,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {128377#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {128378#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:10:22,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {128378#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {128379#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:10:22,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {128379#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {128457#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:10:22,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {128457#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {128358#false} is VALID [2022-04-08 10:10:22,472 INFO L290 TraceCheckUtils]: 26: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,472 INFO L290 TraceCheckUtils]: 27: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,473 INFO L290 TraceCheckUtils]: 33: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,473 INFO L290 TraceCheckUtils]: 34: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,473 INFO L290 TraceCheckUtils]: 35: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,473 INFO L290 TraceCheckUtils]: 36: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,473 INFO L290 TraceCheckUtils]: 37: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,473 INFO L290 TraceCheckUtils]: 38: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,473 INFO L290 TraceCheckUtils]: 39: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,473 INFO L290 TraceCheckUtils]: 40: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:22,473 INFO L290 TraceCheckUtils]: 41: Hoare triple {128358#false} assume !(~y~0 % 4294967296 > 0); {128358#false} is VALID [2022-04-08 10:10:22,473 INFO L272 TraceCheckUtils]: 42: Hoare triple {128358#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {128358#false} is VALID [2022-04-08 10:10:22,473 INFO L290 TraceCheckUtils]: 43: Hoare triple {128358#false} ~cond := #in~cond; {128358#false} is VALID [2022-04-08 10:10:22,473 INFO L290 TraceCheckUtils]: 44: Hoare triple {128358#false} assume 0 == ~cond; {128358#false} is VALID [2022-04-08 10:10:22,473 INFO L290 TraceCheckUtils]: 45: Hoare triple {128358#false} assume !false; {128358#false} is VALID [2022-04-08 10:10:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 10:10:22,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:23,101 INFO L290 TraceCheckUtils]: 45: Hoare triple {128358#false} assume !false; {128358#false} is VALID [2022-04-08 10:10:23,102 INFO L290 TraceCheckUtils]: 44: Hoare triple {128358#false} assume 0 == ~cond; {128358#false} is VALID [2022-04-08 10:10:23,102 INFO L290 TraceCheckUtils]: 43: Hoare triple {128358#false} ~cond := #in~cond; {128358#false} is VALID [2022-04-08 10:10:23,102 INFO L272 TraceCheckUtils]: 42: Hoare triple {128358#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {128358#false} is VALID [2022-04-08 10:10:23,102 INFO L290 TraceCheckUtils]: 41: Hoare triple {128358#false} assume !(~y~0 % 4294967296 > 0); {128358#false} is VALID [2022-04-08 10:10:23,102 INFO L290 TraceCheckUtils]: 40: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:23,102 INFO L290 TraceCheckUtils]: 39: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:23,102 INFO L290 TraceCheckUtils]: 38: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:23,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:23,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:23,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:23,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:23,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:23,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:23,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:23,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:23,102 INFO L290 TraceCheckUtils]: 29: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:23,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:23,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:23,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-08 10:10:23,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {128581#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {128358#false} is VALID [2022-04-08 10:10:23,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {128585#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {128581#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:23,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {128589#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {128585#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:23,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {128593#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {128589#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:23,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {128593#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {128593#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:23,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {128600#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128593#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:23,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {128604#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128600#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:23,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {128608#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128604#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:23,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {128612#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128608#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:23,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {128616#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128612#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:10:23,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {128620#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128616#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:10:23,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {128624#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128620#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:10:23,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {128628#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128624#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:23,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {128632#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128628#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:10:23,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {128636#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128632#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:23,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {128640#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128636#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:10:23,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {128644#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128640#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:10:23,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {128648#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128644#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:10:23,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {128652#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128648#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:10:23,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {128656#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128652#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:10:23,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {128357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {128656#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:10:23,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {128357#true} call #t~ret11 := main(); {128357#true} is VALID [2022-04-08 10:10:23,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128357#true} {128357#true} #61#return; {128357#true} is VALID [2022-04-08 10:10:23,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {128357#true} assume true; {128357#true} is VALID [2022-04-08 10:10:23,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {128357#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {128357#true} is VALID [2022-04-08 10:10:23,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {128357#true} call ULTIMATE.init(); {128357#true} is VALID [2022-04-08 10:10:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 10:10:23,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486906503] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:23,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:23,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-08 10:10:23,115 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:23,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [934457881] [2022-04-08 10:10:23,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [934457881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:23,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:23,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:10:23,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199060493] [2022-04-08 10:10:23,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:23,116 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-08 10:10:23,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:23,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:23,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:23,137 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:10:23,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:23,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:10:23,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1373, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:10:23,137 INFO L87 Difference]: Start difference. First operand 200 states and 257 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:25,898 INFO L93 Difference]: Finished difference Result 239 states and 296 transitions. [2022-04-08 10:10:25,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:10:25,898 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-08 10:10:25,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:25,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:25,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 83 transitions. [2022-04-08 10:10:25,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:25,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 83 transitions. [2022-04-08 10:10:25,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 83 transitions. [2022-04-08 10:10:25,966 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-08 10:10:25,969 INFO L225 Difference]: With dead ends: 239 [2022-04-08 10:10:25,969 INFO L226 Difference]: Without dead ends: 218 [2022-04-08 10:10:25,969 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=822, Invalid=3210, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 10:10:25,969 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:25,969 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 121 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:10:25,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-04-08 10:10:26,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 201. [2022-04-08 10:10:26,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:26,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand has 201 states, 196 states have (on average 1.2959183673469388) internal successors, (254), 196 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:26,696 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand has 201 states, 196 states have (on average 1.2959183673469388) internal successors, (254), 196 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:26,696 INFO L87 Difference]: Start difference. First operand 218 states. Second operand has 201 states, 196 states have (on average 1.2959183673469388) internal successors, (254), 196 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:26,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:26,698 INFO L93 Difference]: Finished difference Result 218 states and 275 transitions. [2022-04-08 10:10:26,698 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 275 transitions. [2022-04-08 10:10:26,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:26,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:26,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 196 states have (on average 1.2959183673469388) internal successors, (254), 196 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 218 states. [2022-04-08 10:10:26,699 INFO L87 Difference]: Start difference. First operand has 201 states, 196 states have (on average 1.2959183673469388) internal successors, (254), 196 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 218 states. [2022-04-08 10:10:26,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:26,701 INFO L93 Difference]: Finished difference Result 218 states and 275 transitions. [2022-04-08 10:10:26,701 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 275 transitions. [2022-04-08 10:10:26,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:26,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:26,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:26,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 196 states have (on average 1.2959183673469388) internal successors, (254), 196 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 258 transitions. [2022-04-08 10:10:26,704 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 258 transitions. Word has length 46 [2022-04-08 10:10:26,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:26,704 INFO L478 AbstractCegarLoop]: Abstraction has 201 states and 258 transitions. [2022-04-08 10:10:26,704 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:26,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 201 states and 258 transitions. [2022-04-08 10:10:27,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:27,327 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 258 transitions. [2022-04-08 10:10:27,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 10:10:27,328 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:27,328 INFO L499 BasicCegarLoop]: trace histogram [29, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:27,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:27,528 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2022-04-08 10:10:27,528 INFO L403 AbstractCegarLoop]: === Iteration 115 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:27,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:27,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1117000142, now seen corresponding path program 219 times [2022-04-08 10:10:27,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:27,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1393516072] [2022-04-08 10:10:27,530 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:27,530 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:27,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1117000142, now seen corresponding path program 220 times [2022-04-08 10:10:27,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:27,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861844223] [2022-04-08 10:10:27,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:27,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:28,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:28,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {130074#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {130037#true} is VALID [2022-04-08 10:10:28,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {130037#true} assume true; {130037#true} is VALID [2022-04-08 10:10:28,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {130037#true} {130037#true} #61#return; {130037#true} is VALID [2022-04-08 10:10:28,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {130037#true} call ULTIMATE.init(); {130074#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:28,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {130074#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {130037#true} is VALID [2022-04-08 10:10:28,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {130037#true} assume true; {130037#true} is VALID [2022-04-08 10:10:28,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130037#true} {130037#true} #61#return; {130037#true} is VALID [2022-04-08 10:10:28,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {130037#true} call #t~ret11 := main(); {130037#true} is VALID [2022-04-08 10:10:28,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {130037#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {130042#(= main_~y~0 0)} is VALID [2022-04-08 10:10:28,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {130042#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130043#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:28,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {130043#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130044#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:28,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {130044#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130045#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:28,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {130045#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130046#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:28,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {130046#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130047#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:28,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {130047#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130048#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:28,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {130048#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130049#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:28,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {130049#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130050#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:28,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {130050#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130051#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:28,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {130051#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130052#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:28,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {130052#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130053#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:28,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {130053#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130054#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:28,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {130054#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130055#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:28,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {130055#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130056#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:28,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {130056#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130057#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:28,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {130057#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130058#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:10:28,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {130058#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130059#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:10:28,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {130059#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130060#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:10:28,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {130060#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130061#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:10:28,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {130061#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130062#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:10:28,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {130062#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130063#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:10:28,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {130063#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130064#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:10:28,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {130064#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130065#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:10:28,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {130065#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130066#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:10:28,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {130066#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130067#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:10:28,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {130067#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130068#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:10:28,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {130068#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130069#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:10:28,183 INFO L290 TraceCheckUtils]: 33: Hoare triple {130069#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130070#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-08 10:10:28,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {130070#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130071#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-08 10:10:28,184 INFO L290 TraceCheckUtils]: 35: Hoare triple {130071#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !(~x~0 % 4294967296 > 0); {130071#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-08 10:10:28,184 INFO L290 TraceCheckUtils]: 36: Hoare triple {130071#(and (<= 29 main_~y~0) (<= main_~y~0 29))} ~z~0 := ~y~0; {130072#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-08 10:10:28,185 INFO L290 TraceCheckUtils]: 37: Hoare triple {130072#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {130073#(and (<= (div main_~z~0 4294967296) 0) (<= 28 main_~z~0))} is VALID [2022-04-08 10:10:28,185 INFO L290 TraceCheckUtils]: 38: Hoare triple {130073#(and (<= (div main_~z~0 4294967296) 0) (<= 28 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {130038#false} is VALID [2022-04-08 10:10:28,185 INFO L290 TraceCheckUtils]: 39: Hoare triple {130038#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {130038#false} is VALID [2022-04-08 10:10:28,185 INFO L290 TraceCheckUtils]: 40: Hoare triple {130038#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {130038#false} is VALID [2022-04-08 10:10:28,185 INFO L290 TraceCheckUtils]: 41: Hoare triple {130038#false} assume !(~y~0 % 4294967296 > 0); {130038#false} is VALID [2022-04-08 10:10:28,185 INFO L272 TraceCheckUtils]: 42: Hoare triple {130038#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {130038#false} is VALID [2022-04-08 10:10:28,185 INFO L290 TraceCheckUtils]: 43: Hoare triple {130038#false} ~cond := #in~cond; {130038#false} is VALID [2022-04-08 10:10:28,185 INFO L290 TraceCheckUtils]: 44: Hoare triple {130038#false} assume 0 == ~cond; {130038#false} is VALID [2022-04-08 10:10:28,185 INFO L290 TraceCheckUtils]: 45: Hoare triple {130038#false} assume !false; {130038#false} is VALID [2022-04-08 10:10:28,186 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:10:28,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:28,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861844223] [2022-04-08 10:10:28,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861844223] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:28,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933373892] [2022-04-08 10:10:28,186 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:10:28,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:28,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:28,187 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:28,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2022-04-08 10:10:28,238 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:10:28,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:28,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-08 10:10:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:28,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:28,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {130037#true} call ULTIMATE.init(); {130037#true} is VALID [2022-04-08 10:10:28,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {130037#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {130037#true} is VALID [2022-04-08 10:10:28,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {130037#true} assume true; {130037#true} is VALID [2022-04-08 10:10:28,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130037#true} {130037#true} #61#return; {130037#true} is VALID [2022-04-08 10:10:28,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {130037#true} call #t~ret11 := main(); {130037#true} is VALID [2022-04-08 10:10:28,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {130037#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {130042#(= main_~y~0 0)} is VALID [2022-04-08 10:10:28,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {130042#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130043#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:28,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {130043#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130044#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:28,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {130044#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130045#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:28,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {130045#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130046#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:28,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {130046#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130047#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:28,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {130047#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130048#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:28,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {130048#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130049#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:28,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {130049#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130050#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:28,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {130050#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130051#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:28,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {130051#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130052#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:28,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {130052#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130053#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:28,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {130053#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130054#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:28,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {130054#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130055#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:28,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {130055#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130056#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:28,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {130056#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130057#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:28,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {130057#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130058#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:10:28,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {130058#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130059#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:10:28,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {130059#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130060#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:10:28,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {130060#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130061#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:10:28,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {130061#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130062#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:10:28,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {130062#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130063#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:10:28,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {130063#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130064#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:10:28,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {130064#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130065#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:10:28,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {130065#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130066#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:10:28,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {130066#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130067#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:10:28,682 INFO L290 TraceCheckUtils]: 31: Hoare triple {130067#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130068#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:10:28,682 INFO L290 TraceCheckUtils]: 32: Hoare triple {130068#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130069#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:10:28,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {130069#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130070#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-08 10:10:28,683 INFO L290 TraceCheckUtils]: 34: Hoare triple {130070#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130071#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-08 10:10:28,684 INFO L290 TraceCheckUtils]: 35: Hoare triple {130071#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !(~x~0 % 4294967296 > 0); {130071#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-08 10:10:28,684 INFO L290 TraceCheckUtils]: 36: Hoare triple {130071#(and (<= 29 main_~y~0) (<= main_~y~0 29))} ~z~0 := ~y~0; {130072#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-08 10:10:28,684 INFO L290 TraceCheckUtils]: 37: Hoare triple {130072#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {130189#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-08 10:10:28,685 INFO L290 TraceCheckUtils]: 38: Hoare triple {130189#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !(~z~0 % 4294967296 > 0); {130038#false} is VALID [2022-04-08 10:10:28,685 INFO L290 TraceCheckUtils]: 39: Hoare triple {130038#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {130038#false} is VALID [2022-04-08 10:10:28,685 INFO L290 TraceCheckUtils]: 40: Hoare triple {130038#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {130038#false} is VALID [2022-04-08 10:10:28,685 INFO L290 TraceCheckUtils]: 41: Hoare triple {130038#false} assume !(~y~0 % 4294967296 > 0); {130038#false} is VALID [2022-04-08 10:10:28,685 INFO L272 TraceCheckUtils]: 42: Hoare triple {130038#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {130038#false} is VALID [2022-04-08 10:10:28,685 INFO L290 TraceCheckUtils]: 43: Hoare triple {130038#false} ~cond := #in~cond; {130038#false} is VALID [2022-04-08 10:10:28,685 INFO L290 TraceCheckUtils]: 44: Hoare triple {130038#false} assume 0 == ~cond; {130038#false} is VALID [2022-04-08 10:10:28,685 INFO L290 TraceCheckUtils]: 45: Hoare triple {130038#false} assume !false; {130038#false} is VALID [2022-04-08 10:10:28,685 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:10:28,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:30,215 INFO L290 TraceCheckUtils]: 45: Hoare triple {130038#false} assume !false; {130038#false} is VALID [2022-04-08 10:10:30,215 INFO L290 TraceCheckUtils]: 44: Hoare triple {130038#false} assume 0 == ~cond; {130038#false} is VALID [2022-04-08 10:10:30,215 INFO L290 TraceCheckUtils]: 43: Hoare triple {130038#false} ~cond := #in~cond; {130038#false} is VALID [2022-04-08 10:10:30,216 INFO L272 TraceCheckUtils]: 42: Hoare triple {130038#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {130038#false} is VALID [2022-04-08 10:10:30,216 INFO L290 TraceCheckUtils]: 41: Hoare triple {130038#false} assume !(~y~0 % 4294967296 > 0); {130038#false} is VALID [2022-04-08 10:10:30,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {130038#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {130038#false} is VALID [2022-04-08 10:10:30,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {130038#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {130038#false} is VALID [2022-04-08 10:10:30,216 INFO L290 TraceCheckUtils]: 38: Hoare triple {130235#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {130038#false} is VALID [2022-04-08 10:10:30,217 INFO L290 TraceCheckUtils]: 37: Hoare triple {130239#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {130235#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:30,217 INFO L290 TraceCheckUtils]: 36: Hoare triple {130243#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {130239#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:30,217 INFO L290 TraceCheckUtils]: 35: Hoare triple {130243#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {130243#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:30,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {130250#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130243#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:30,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {130254#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130250#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:30,219 INFO L290 TraceCheckUtils]: 32: Hoare triple {130258#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130254#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:30,220 INFO L290 TraceCheckUtils]: 31: Hoare triple {130262#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130258#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:10:30,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {130266#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130262#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:10:30,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {130270#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130266#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:10:30,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {130274#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130270#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:30,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {130278#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130274#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:10:30,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {130282#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130278#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:30,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {130286#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130282#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:10:30,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {130290#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130286#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:10:30,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {130294#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130290#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:10:30,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {130298#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130294#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:10:30,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {130302#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130298#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:10:30,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {130306#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130302#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:10:30,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {130310#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130306#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:10:30,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {130314#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130310#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:10:30,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {130318#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130314#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:10:30,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {130322#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130318#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:10:30,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {130326#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130322#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:10:30,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {130330#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130326#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:30,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {130334#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130330#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:10:30,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {130338#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130334#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:10:30,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {130342#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130338#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-08 10:10:30,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {130346#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130342#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:30,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {130350#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130346#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-08 10:10:30,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {130354#(< 0 (mod (+ main_~y~0 26) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130350#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-08 10:10:30,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {130358#(< 0 (mod (+ main_~y~0 27) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130354#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-08 10:10:30,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {130362#(< 0 (mod (+ main_~y~0 28) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130358#(< 0 (mod (+ main_~y~0 27) 4294967296))} is VALID [2022-04-08 10:10:30,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {130037#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {130362#(< 0 (mod (+ main_~y~0 28) 4294967296))} is VALID [2022-04-08 10:10:30,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {130037#true} call #t~ret11 := main(); {130037#true} is VALID [2022-04-08 10:10:30,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130037#true} {130037#true} #61#return; {130037#true} is VALID [2022-04-08 10:10:30,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {130037#true} assume true; {130037#true} is VALID [2022-04-08 10:10:30,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {130037#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {130037#true} is VALID [2022-04-08 10:10:30,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {130037#true} call ULTIMATE.init(); {130037#true} is VALID [2022-04-08 10:10:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:10:30,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933373892] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:30,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:30,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 68 [2022-04-08 10:10:30,237 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:30,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1393516072] [2022-04-08 10:10:30,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1393516072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:30,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:30,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-08 10:10:30,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310995093] [2022-04-08 10:10:30,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:30,237 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-08 10:10:30,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:30,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:30,264 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-08 10:10:30,264 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-08 10:10:30,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:30,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-08 10:10:30,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1039, Invalid=3517, Unknown=0, NotChecked=0, Total=4556 [2022-04-08 10:10:30,265 INFO L87 Difference]: Start difference. First operand 201 states and 258 transitions. Second operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:37,691 INFO L93 Difference]: Finished difference Result 317 states and 460 transitions. [2022-04-08 10:10:37,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-08 10:10:37,691 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-08 10:10:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 193 transitions. [2022-04-08 10:10:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 193 transitions. [2022-04-08 10:10:37,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 193 transitions. [2022-04-08 10:10:37,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:37,851 INFO L225 Difference]: With dead ends: 317 [2022-04-08 10:10:37,851 INFO L226 Difference]: Without dead ends: 309 [2022-04-08 10:10:37,852 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2173, Invalid=7927, Unknown=0, NotChecked=0, Total=10100 [2022-04-08 10:10:37,852 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 163 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 4318 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 4445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 4318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:37,852 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 222 Invalid, 4445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 4318 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-08 10:10:37,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-08 10:10:38,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 207. [2022-04-08 10:10:38,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:38,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 207 states, 202 states have (on average 1.297029702970297) internal successors, (262), 202 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:38,613 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 207 states, 202 states have (on average 1.297029702970297) internal successors, (262), 202 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:38,613 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 207 states, 202 states have (on average 1.297029702970297) internal successors, (262), 202 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:38,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:38,617 INFO L93 Difference]: Finished difference Result 309 states and 377 transitions. [2022-04-08 10:10:38,617 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 377 transitions. [2022-04-08 10:10:38,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:38,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:38,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 202 states have (on average 1.297029702970297) internal successors, (262), 202 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 309 states. [2022-04-08 10:10:38,617 INFO L87 Difference]: Start difference. First operand has 207 states, 202 states have (on average 1.297029702970297) internal successors, (262), 202 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 309 states. [2022-04-08 10:10:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:38,621 INFO L93 Difference]: Finished difference Result 309 states and 377 transitions. [2022-04-08 10:10:38,621 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 377 transitions. [2022-04-08 10:10:38,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:38,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:38,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:38,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:38,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.297029702970297) internal successors, (262), 202 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 266 transitions. [2022-04-08 10:10:38,624 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 266 transitions. Word has length 46 [2022-04-08 10:10:38,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:38,624 INFO L478 AbstractCegarLoop]: Abstraction has 207 states and 266 transitions. [2022-04-08 10:10:38,624 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:38,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 266 transitions. [2022-04-08 10:10:39,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 266 edges. 266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:39,272 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 266 transitions. [2022-04-08 10:10:39,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 10:10:39,273 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:39,273 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:39,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:39,475 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2022-04-08 10:10:39,475 INFO L403 AbstractCegarLoop]: === Iteration 116 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:39,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:39,476 INFO L85 PathProgramCache]: Analyzing trace with hash -457999617, now seen corresponding path program 221 times [2022-04-08 10:10:39,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:39,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1520108907] [2022-04-08 10:10:39,478 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:39,478 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:39,478 INFO L85 PathProgramCache]: Analyzing trace with hash -457999617, now seen corresponding path program 222 times [2022-04-08 10:10:39,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:39,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191758875] [2022-04-08 10:10:39,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:39,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:39,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:39,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {132134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {132115#true} is VALID [2022-04-08 10:10:39,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {132115#true} assume true; {132115#true} is VALID [2022-04-08 10:10:39,777 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {132115#true} {132115#true} #61#return; {132115#true} is VALID [2022-04-08 10:10:39,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {132115#true} call ULTIMATE.init(); {132134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:39,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {132134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {132115#true} is VALID [2022-04-08 10:10:39,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {132115#true} assume true; {132115#true} is VALID [2022-04-08 10:10:39,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132115#true} {132115#true} #61#return; {132115#true} is VALID [2022-04-08 10:10:39,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {132115#true} call #t~ret11 := main(); {132115#true} is VALID [2022-04-08 10:10:39,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {132115#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {132115#true} is VALID [2022-04-08 10:10:39,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:39,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:39,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:39,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:39,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:39,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:39,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:39,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:39,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:39,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:39,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:39,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {132115#true} assume !(~x~0 % 4294967296 > 0); {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:39,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:39,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132121#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:10:39,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {132121#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132122#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:39,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {132122#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132123#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:39,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {132123#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132124#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:39,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {132124#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132125#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:10:39,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {132125#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132126#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:39,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {132126#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:39,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:39,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:10:39,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-08 10:10:39,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-08 10:10:39,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !(~z~0 % 4294967296 > 0); {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-08 10:10:39,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-08 10:10:39,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:10:39,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:39,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:39,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132126#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:39,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {132126#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132125#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:10:39,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {132125#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132124#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:39,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {132124#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132123#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:39,799 INFO L290 TraceCheckUtils]: 39: Hoare triple {132123#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132122#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:39,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {132122#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132121#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:10:39,801 INFO L290 TraceCheckUtils]: 41: Hoare triple {132121#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:39,801 INFO L290 TraceCheckUtils]: 42: Hoare triple {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:39,802 INFO L272 TraceCheckUtils]: 43: Hoare triple {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {132132#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:10:39,802 INFO L290 TraceCheckUtils]: 44: Hoare triple {132132#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {132133#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:10:39,803 INFO L290 TraceCheckUtils]: 45: Hoare triple {132133#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {132116#false} is VALID [2022-04-08 10:10:39,803 INFO L290 TraceCheckUtils]: 46: Hoare triple {132116#false} assume !false; {132116#false} is VALID [2022-04-08 10:10:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:10:39,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:39,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191758875] [2022-04-08 10:10:39,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191758875] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:39,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283362266] [2022-04-08 10:10:39,803 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:10:39,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:39,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:39,805 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:39,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2022-04-08 10:10:40,646 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:10:40,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:40,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 10:10:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:40,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:40,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {132115#true} call ULTIMATE.init(); {132115#true} is VALID [2022-04-08 10:10:40,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {132115#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {132115#true} is VALID [2022-04-08 10:10:40,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {132115#true} assume true; {132115#true} is VALID [2022-04-08 10:10:40,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132115#true} {132115#true} #61#return; {132115#true} is VALID [2022-04-08 10:10:40,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {132115#true} call #t~ret11 := main(); {132115#true} is VALID [2022-04-08 10:10:40,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {132115#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {132115#true} is VALID [2022-04-08 10:10:40,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:40,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:40,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:40,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:40,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:40,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:40,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:40,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:40,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:40,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:40,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:40,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {132115#true} assume !(~x~0 % 4294967296 > 0); {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:40,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:40,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132121#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:10:40,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {132121#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132122#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:40,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {132122#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132123#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:40,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {132123#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132124#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:40,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {132124#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132125#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:10:40,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {132125#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132126#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:40,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {132126#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:40,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:40,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:10:40,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-08 10:10:40,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-08 10:10:40,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !(~z~0 % 4294967296 > 0); {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-08 10:10:40,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-08 10:10:40,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:10:40,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:40,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:40,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132126#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:40,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {132126#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132125#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:10:40,976 INFO L290 TraceCheckUtils]: 37: Hoare triple {132125#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132124#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:40,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {132124#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132123#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:40,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {132123#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132122#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:40,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {132122#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132121#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:10:40,979 INFO L290 TraceCheckUtils]: 41: Hoare triple {132121#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:40,979 INFO L290 TraceCheckUtils]: 42: Hoare triple {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:40,980 INFO L272 TraceCheckUtils]: 43: Hoare triple {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {132267#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:10:40,980 INFO L290 TraceCheckUtils]: 44: Hoare triple {132267#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {132271#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:10:40,980 INFO L290 TraceCheckUtils]: 45: Hoare triple {132271#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {132116#false} is VALID [2022-04-08 10:10:40,981 INFO L290 TraceCheckUtils]: 46: Hoare triple {132116#false} assume !false; {132116#false} is VALID [2022-04-08 10:10:40,981 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:10:40,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:41,303 INFO L290 TraceCheckUtils]: 46: Hoare triple {132116#false} assume !false; {132116#false} is VALID [2022-04-08 10:10:41,303 INFO L290 TraceCheckUtils]: 45: Hoare triple {132271#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {132116#false} is VALID [2022-04-08 10:10:41,304 INFO L290 TraceCheckUtils]: 44: Hoare triple {132267#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {132271#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:10:41,304 INFO L272 TraceCheckUtils]: 43: Hoare triple {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {132267#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:10:41,305 INFO L290 TraceCheckUtils]: 42: Hoare triple {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:41,305 INFO L290 TraceCheckUtils]: 41: Hoare triple {132121#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:41,306 INFO L290 TraceCheckUtils]: 40: Hoare triple {132122#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132121#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:10:41,307 INFO L290 TraceCheckUtils]: 39: Hoare triple {132123#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132122#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:41,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {132124#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132123#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:41,308 INFO L290 TraceCheckUtils]: 37: Hoare triple {132125#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132124#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:41,309 INFO L290 TraceCheckUtils]: 36: Hoare triple {132126#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132125#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:10:41,310 INFO L290 TraceCheckUtils]: 35: Hoare triple {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132126#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:41,310 INFO L290 TraceCheckUtils]: 34: Hoare triple {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:41,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:41,312 INFO L290 TraceCheckUtils]: 32: Hoare triple {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:10:41,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-08 10:10:41,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !(~z~0 % 4294967296 > 0); {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-08 10:10:41,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-08 10:10:41,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-08 10:10:41,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:10:41,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:41,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {132126#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:41,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {132125#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132126#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:41,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {132124#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132125#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:10:41,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {132123#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132124#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:41,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {132122#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132123#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:41,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {132121#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132122#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:41,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132121#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:10:41,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:41,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {132115#true} assume !(~x~0 % 4294967296 > 0); {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:41,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:41,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:41,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:41,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:41,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:41,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:41,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:41,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:41,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:41,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:41,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {132115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132115#true} is VALID [2022-04-08 10:10:41,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {132115#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {132115#true} is VALID [2022-04-08 10:10:41,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {132115#true} call #t~ret11 := main(); {132115#true} is VALID [2022-04-08 10:10:41,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132115#true} {132115#true} #61#return; {132115#true} is VALID [2022-04-08 10:10:41,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {132115#true} assume true; {132115#true} is VALID [2022-04-08 10:10:41,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {132115#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {132115#true} is VALID [2022-04-08 10:10:41,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {132115#true} call ULTIMATE.init(); {132115#true} is VALID [2022-04-08 10:10:41,322 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:10:41,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283362266] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:41,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:41,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 19 [2022-04-08 10:10:41,323 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:41,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1520108907] [2022-04-08 10:10:41,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1520108907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:41,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:41,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:10:41,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105278505] [2022-04-08 10:10:41,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:41,323 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) 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 47 [2022-04-08 10:10:41,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:41,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.9411764705882353) 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-08 10:10:41,355 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-08 10:10:41,355 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:10:41,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:41,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:10:41,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:10:41,356 INFO L87 Difference]: Start difference. First operand 207 states and 266 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) 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-08 10:10:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:47,306 INFO L93 Difference]: Finished difference Result 692 states and 927 transitions. [2022-04-08 10:10:47,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:10:47,306 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) 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 47 [2022-04-08 10:10:47,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:47,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.9411764705882353) 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-08 10:10:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 77 transitions. [2022-04-08 10:10:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.9411764705882353) 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-08 10:10:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 77 transitions. [2022-04-08 10:10:47,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 77 transitions. [2022-04-08 10:10:47,382 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-08 10:10:47,399 INFO L225 Difference]: With dead ends: 692 [2022-04-08 10:10:47,399 INFO L226 Difference]: Without dead ends: 675 [2022-04-08 10:10:47,399 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 102 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=961, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 10:10:47,400 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 44 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:47,400 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 116 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:10:47,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-04-08 10:10:48,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 211. [2022-04-08 10:10:48,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:48,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 675 states. Second operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:48,193 INFO L74 IsIncluded]: Start isIncluded. First operand 675 states. Second operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:48,193 INFO L87 Difference]: Start difference. First operand 675 states. Second operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:48,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:48,206 INFO L93 Difference]: Finished difference Result 675 states and 909 transitions. [2022-04-08 10:10:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 909 transitions. [2022-04-08 10:10:48,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:48,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:48,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 675 states. [2022-04-08 10:10:48,207 INFO L87 Difference]: Start difference. First operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 675 states. [2022-04-08 10:10:48,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:48,220 INFO L93 Difference]: Finished difference Result 675 states and 909 transitions. [2022-04-08 10:10:48,220 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 909 transitions. [2022-04-08 10:10:48,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:48,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:48,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:48,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:48,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 272 transitions. [2022-04-08 10:10:48,224 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 272 transitions. Word has length 47 [2022-04-08 10:10:48,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:48,224 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 272 transitions. [2022-04-08 10:10:48,224 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) 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-08 10:10:48,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 272 transitions. [2022-04-08 10:10:49,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 272 edges. 272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 272 transitions. [2022-04-08 10:10:49,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 10:10:49,060 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:49,060 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:49,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:49,260 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115,114 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:49,261 INFO L403 AbstractCegarLoop]: === Iteration 117 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:49,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:49,261 INFO L85 PathProgramCache]: Analyzing trace with hash 105952943, now seen corresponding path program 223 times [2022-04-08 10:10:49,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:49,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2043530685] [2022-04-08 10:10:49,263 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:49,263 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:49,263 INFO L85 PathProgramCache]: Analyzing trace with hash 105952943, now seen corresponding path program 224 times [2022-04-08 10:10:49,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:49,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557815204] [2022-04-08 10:10:49,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:49,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:49,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:49,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {135630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {135602#true} is VALID [2022-04-08 10:10:49,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {135602#true} assume true; {135602#true} is VALID [2022-04-08 10:10:49,649 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135602#true} {135602#true} #61#return; {135602#true} is VALID [2022-04-08 10:10:49,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {135602#true} call ULTIMATE.init(); {135630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:49,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {135630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {135602#true} is VALID [2022-04-08 10:10:49,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {135602#true} assume true; {135602#true} is VALID [2022-04-08 10:10:49,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135602#true} {135602#true} #61#return; {135602#true} is VALID [2022-04-08 10:10:49,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {135602#true} call #t~ret11 := main(); {135602#true} is VALID [2022-04-08 10:10:49,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {135602#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {135607#(= main_~y~0 0)} is VALID [2022-04-08 10:10:49,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {135607#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135608#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:49,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {135608#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135609#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:49,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {135609#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135610#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:49,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {135610#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135611#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:49,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {135611#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135612#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:49,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {135612#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135613#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:49,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {135613#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135614#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:49,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {135614#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135615#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:49,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {135615#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135616#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:49,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {135616#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135617#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:49,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {135617#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135618#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:49,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {135618#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135619#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:49,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {135619#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {135619#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:49,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {135619#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {135620#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:10:49,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {135620#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135621#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:10:49,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {135621#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135622#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:49,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {135622#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135623#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:49,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {135623#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135624#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:49,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {135624#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135625#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:49,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {135625#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135626#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:49,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {135626#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135627#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:10:49,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {135627#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135628#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:10:49,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {135628#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135629#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:10:49,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {135629#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {135603#false} is VALID [2022-04-08 10:10:49,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:49,662 INFO L290 TraceCheckUtils]: 31: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:49,662 INFO L290 TraceCheckUtils]: 32: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:49,662 INFO L290 TraceCheckUtils]: 33: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:49,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:49,662 INFO L290 TraceCheckUtils]: 35: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:49,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:49,662 INFO L290 TraceCheckUtils]: 37: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:49,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:49,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:49,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:49,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:49,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {135603#false} assume !(~y~0 % 4294967296 > 0); {135603#false} is VALID [2022-04-08 10:10:49,662 INFO L272 TraceCheckUtils]: 43: Hoare triple {135603#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {135603#false} is VALID [2022-04-08 10:10:49,662 INFO L290 TraceCheckUtils]: 44: Hoare triple {135603#false} ~cond := #in~cond; {135603#false} is VALID [2022-04-08 10:10:49,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {135603#false} assume 0 == ~cond; {135603#false} is VALID [2022-04-08 10:10:49,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {135603#false} assume !false; {135603#false} is VALID [2022-04-08 10:10:49,663 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:10:49,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:49,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557815204] [2022-04-08 10:10:49,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557815204] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:49,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787743846] [2022-04-08 10:10:49,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:10:49,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:49,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:49,664 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:49,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2022-04-08 10:10:49,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:10:49,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:49,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-08 10:10:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:49,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:50,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {135602#true} call ULTIMATE.init(); {135602#true} is VALID [2022-04-08 10:10:50,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {135602#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {135602#true} is VALID [2022-04-08 10:10:50,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {135602#true} assume true; {135602#true} is VALID [2022-04-08 10:10:50,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135602#true} {135602#true} #61#return; {135602#true} is VALID [2022-04-08 10:10:50,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {135602#true} call #t~ret11 := main(); {135602#true} is VALID [2022-04-08 10:10:50,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {135602#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {135607#(= main_~y~0 0)} is VALID [2022-04-08 10:10:50,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {135607#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135608#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:50,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {135608#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135609#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:50,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {135609#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135610#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:50,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {135610#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135611#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:50,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {135611#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135612#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:50,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {135612#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135613#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:50,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {135613#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135614#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:50,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {135614#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135615#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:50,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {135615#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135616#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:50,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {135616#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135617#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:50,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {135617#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135618#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:50,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {135618#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135619#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:50,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {135619#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {135619#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:50,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {135619#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {135691#(and (<= 12 main_~y~0) (= main_~z~0 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:50,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {135691#(and (<= 12 main_~y~0) (= main_~z~0 main_~y~0) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135695#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:10:50,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {135695#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135699#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:10:50,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {135699#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135703#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:50,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {135703#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135707#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:50,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {135707#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135711#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} is VALID [2022-04-08 10:10:50,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {135711#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135715#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)))} is VALID [2022-04-08 10:10:50,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {135715#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135719#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~y~0 (- 3)) (+ main_~z~0 4)))} is VALID [2022-04-08 10:10:50,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {135719#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~y~0 (- 3)) (+ main_~z~0 4)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135723#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:50,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {135723#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135727#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 7))) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:50,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {135727#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 7))) (<= main_~y~0 12))} assume !(~z~0 % 4294967296 > 0); {135603#false} is VALID [2022-04-08 10:10:50,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:50,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:50,238 INFO L290 TraceCheckUtils]: 32: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:50,238 INFO L290 TraceCheckUtils]: 33: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:50,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:50,238 INFO L290 TraceCheckUtils]: 35: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:50,239 INFO L290 TraceCheckUtils]: 36: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:50,239 INFO L290 TraceCheckUtils]: 37: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:50,239 INFO L290 TraceCheckUtils]: 38: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:50,239 INFO L290 TraceCheckUtils]: 39: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:50,239 INFO L290 TraceCheckUtils]: 40: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:50,239 INFO L290 TraceCheckUtils]: 41: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:50,239 INFO L290 TraceCheckUtils]: 42: Hoare triple {135603#false} assume !(~y~0 % 4294967296 > 0); {135603#false} is VALID [2022-04-08 10:10:50,239 INFO L272 TraceCheckUtils]: 43: Hoare triple {135603#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {135603#false} is VALID [2022-04-08 10:10:50,239 INFO L290 TraceCheckUtils]: 44: Hoare triple {135603#false} ~cond := #in~cond; {135603#false} is VALID [2022-04-08 10:10:50,239 INFO L290 TraceCheckUtils]: 45: Hoare triple {135603#false} assume 0 == ~cond; {135603#false} is VALID [2022-04-08 10:10:50,239 INFO L290 TraceCheckUtils]: 46: Hoare triple {135603#false} assume !false; {135603#false} is VALID [2022-04-08 10:10:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:10:50,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:51,066 INFO L290 TraceCheckUtils]: 46: Hoare triple {135603#false} assume !false; {135603#false} is VALID [2022-04-08 10:10:51,067 INFO L290 TraceCheckUtils]: 45: Hoare triple {135603#false} assume 0 == ~cond; {135603#false} is VALID [2022-04-08 10:10:51,067 INFO L290 TraceCheckUtils]: 44: Hoare triple {135603#false} ~cond := #in~cond; {135603#false} is VALID [2022-04-08 10:10:51,067 INFO L272 TraceCheckUtils]: 43: Hoare triple {135603#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {135603#false} is VALID [2022-04-08 10:10:51,067 INFO L290 TraceCheckUtils]: 42: Hoare triple {135603#false} assume !(~y~0 % 4294967296 > 0); {135603#false} is VALID [2022-04-08 10:10:51,067 INFO L290 TraceCheckUtils]: 41: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:51,067 INFO L290 TraceCheckUtils]: 40: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:51,067 INFO L290 TraceCheckUtils]: 39: Hoare triple {135803#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-08 10:10:51,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {135807#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135803#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:10:51,069 INFO L290 TraceCheckUtils]: 37: Hoare triple {135811#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135807#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:10:51,069 INFO L290 TraceCheckUtils]: 36: Hoare triple {135815#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135811#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:10:51,070 INFO L290 TraceCheckUtils]: 35: Hoare triple {135819#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135815#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:10:51,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {135823#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135819#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:10:51,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {135827#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135823#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:10:51,073 INFO L290 TraceCheckUtils]: 32: Hoare triple {135831#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135827#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:10:51,074 INFO L290 TraceCheckUtils]: 31: Hoare triple {135835#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135831#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:10:51,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {135839#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135835#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:10:51,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {135843#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {135839#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} is VALID [2022-04-08 10:10:51,076 INFO L290 TraceCheckUtils]: 28: Hoare triple {135847#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135843#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:10:51,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {135851#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135847#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:10:51,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {135855#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135851#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:10:51,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {135859#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135855#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:10:51,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {135863#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135859#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:10:51,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {135867#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135863#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:10:51,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {135871#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135867#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:10:51,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {135875#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135871#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:10:51,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {135879#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135875#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:10:51,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {135602#true} ~z~0 := ~y~0; {135879#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-08 10:10:51,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {135602#true} assume !(~x~0 % 4294967296 > 0); {135602#true} is VALID [2022-04-08 10:10:51,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {135602#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135602#true} is VALID [2022-04-08 10:10:51,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {135602#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135602#true} is VALID [2022-04-08 10:10:51,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {135602#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135602#true} is VALID [2022-04-08 10:10:51,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {135602#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135602#true} is VALID [2022-04-08 10:10:51,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {135602#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135602#true} is VALID [2022-04-08 10:10:51,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {135602#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135602#true} is VALID [2022-04-08 10:10:51,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {135602#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135602#true} is VALID [2022-04-08 10:10:51,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {135602#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135602#true} is VALID [2022-04-08 10:10:51,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {135602#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135602#true} is VALID [2022-04-08 10:10:51,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {135602#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135602#true} is VALID [2022-04-08 10:10:51,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {135602#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135602#true} is VALID [2022-04-08 10:10:51,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {135602#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135602#true} is VALID [2022-04-08 10:10:51,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {135602#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {135602#true} is VALID [2022-04-08 10:10:51,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {135602#true} call #t~ret11 := main(); {135602#true} is VALID [2022-04-08 10:10:51,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135602#true} {135602#true} #61#return; {135602#true} is VALID [2022-04-08 10:10:51,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {135602#true} assume true; {135602#true} is VALID [2022-04-08 10:10:51,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {135602#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {135602#true} is VALID [2022-04-08 10:10:51,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {135602#true} call ULTIMATE.init(); {135602#true} is VALID [2022-04-08 10:10:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 30 proven. 90 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-08 10:10:51,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787743846] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:51,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:51,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 22] total 56 [2022-04-08 10:10:51,084 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:51,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2043530685] [2022-04-08 10:10:51,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2043530685] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:51,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:51,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 10:10:51,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062143913] [2022-04-08 10:10:51,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:51,085 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-08 10:10:51,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:51,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:51,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:51,110 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 10:10:51,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:51,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 10:10:51,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=2723, Unknown=0, NotChecked=0, Total=3080 [2022-04-08 10:10:51,111 INFO L87 Difference]: Start difference. First operand 211 states and 272 transitions. Second operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:54,640 INFO L93 Difference]: Finished difference Result 244 states and 305 transitions. [2022-04-08 10:10:54,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-08 10:10:54,640 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-08 10:10:54,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:54,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 78 transitions. [2022-04-08 10:10:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:54,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 78 transitions. [2022-04-08 10:10:54,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 78 transitions. [2022-04-08 10:10:54,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:54,707 INFO L225 Difference]: With dead ends: 244 [2022-04-08 10:10:54,707 INFO L226 Difference]: Without dead ends: 226 [2022-04-08 10:10:54,707 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=750, Invalid=6906, Unknown=0, NotChecked=0, Total=7656 [2022-04-08 10:10:54,707 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:54,707 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 125 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:10:54,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-04-08 10:10:55,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 212. [2022-04-08 10:10:55,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:55,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:55,514 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:55,514 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:55,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:55,516 INFO L93 Difference]: Finished difference Result 226 states and 287 transitions. [2022-04-08 10:10:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 287 transitions. [2022-04-08 10:10:55,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:55,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:55,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 226 states. [2022-04-08 10:10:55,517 INFO L87 Difference]: Start difference. First operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 226 states. [2022-04-08 10:10:55,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:55,519 INFO L93 Difference]: Finished difference Result 226 states and 287 transitions. [2022-04-08 10:10:55,519 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 287 transitions. [2022-04-08 10:10:55,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:55,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:55,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:55,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 273 transitions. [2022-04-08 10:10:55,522 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 273 transitions. Word has length 47 [2022-04-08 10:10:55,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:55,522 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 273 transitions. [2022-04-08 10:10:55,522 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:55,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 212 states and 273 transitions. [2022-04-08 10:10:56,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:56,264 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 273 transitions. [2022-04-08 10:10:56,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 10:10:56,264 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:56,264 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:56,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Ended with exit code 0 [2022-04-08 10:10:56,465 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116,115 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:56,465 INFO L403 AbstractCegarLoop]: === Iteration 118 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:56,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:56,465 INFO L85 PathProgramCache]: Analyzing trace with hash 272921791, now seen corresponding path program 225 times [2022-04-08 10:10:56,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:56,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1799049978] [2022-04-08 10:10:56,467 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:56,467 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:56,467 INFO L85 PathProgramCache]: Analyzing trace with hash 272921791, now seen corresponding path program 226 times [2022-04-08 10:10:56,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:56,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388889981] [2022-04-08 10:10:56,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:56,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:56,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:56,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {137397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {137370#true} is VALID [2022-04-08 10:10:56,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {137370#true} assume true; {137370#true} is VALID [2022-04-08 10:10:56,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {137370#true} {137370#true} #61#return; {137370#true} is VALID [2022-04-08 10:10:56,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {137370#true} call ULTIMATE.init(); {137397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:56,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {137397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {137370#true} is VALID [2022-04-08 10:10:56,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {137370#true} assume true; {137370#true} is VALID [2022-04-08 10:10:56,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137370#true} {137370#true} #61#return; {137370#true} is VALID [2022-04-08 10:10:56,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {137370#true} call #t~ret11 := main(); {137370#true} is VALID [2022-04-08 10:10:56,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {137370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {137375#(= main_~y~0 0)} is VALID [2022-04-08 10:10:56,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {137375#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:56,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {137376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137377#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:56,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {137377#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137378#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:56,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {137378#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137379#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:56,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {137379#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137380#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:56,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {137380#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137381#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:56,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {137381#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137382#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:56,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {137382#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137383#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:56,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {137383#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137384#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:56,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {137384#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137385#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:56,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {137385#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137386#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:56,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {137386#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137387#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:56,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {137387#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137388#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:56,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {137388#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {137388#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:56,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {137388#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {137389#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:10:56,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {137389#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137390#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:10:56,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {137390#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137391#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:10:56,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {137391#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137392#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:56,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {137392#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137393#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:56,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {137393#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137394#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:56,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {137394#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137395#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:56,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {137395#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137396#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:56,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {137396#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {137371#false} is VALID [2022-04-08 10:10:56,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:56,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:56,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:56,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:56,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:56,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:56,849 INFO L290 TraceCheckUtils]: 35: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:56,849 INFO L290 TraceCheckUtils]: 36: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:56,849 INFO L290 TraceCheckUtils]: 37: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:56,849 INFO L290 TraceCheckUtils]: 38: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:56,849 INFO L290 TraceCheckUtils]: 39: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:56,849 INFO L290 TraceCheckUtils]: 40: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:56,850 INFO L290 TraceCheckUtils]: 41: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:56,850 INFO L290 TraceCheckUtils]: 42: Hoare triple {137371#false} assume !(~y~0 % 4294967296 > 0); {137371#false} is VALID [2022-04-08 10:10:56,850 INFO L272 TraceCheckUtils]: 43: Hoare triple {137371#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {137371#false} is VALID [2022-04-08 10:10:56,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {137371#false} ~cond := #in~cond; {137371#false} is VALID [2022-04-08 10:10:56,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {137371#false} assume 0 == ~cond; {137371#false} is VALID [2022-04-08 10:10:56,850 INFO L290 TraceCheckUtils]: 46: Hoare triple {137371#false} assume !false; {137371#false} is VALID [2022-04-08 10:10:56,850 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:10:56,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:56,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388889981] [2022-04-08 10:10:56,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388889981] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:56,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987981781] [2022-04-08 10:10:56,850 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:10:56,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:56,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:56,851 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:56,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2022-04-08 10:10:56,905 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:10:56,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:56,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:10:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:56,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:57,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {137370#true} call ULTIMATE.init(); {137370#true} is VALID [2022-04-08 10:10:57,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {137370#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {137370#true} is VALID [2022-04-08 10:10:57,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {137370#true} assume true; {137370#true} is VALID [2022-04-08 10:10:57,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137370#true} {137370#true} #61#return; {137370#true} is VALID [2022-04-08 10:10:57,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {137370#true} call #t~ret11 := main(); {137370#true} is VALID [2022-04-08 10:10:57,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {137370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {137375#(= main_~y~0 0)} is VALID [2022-04-08 10:10:57,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {137375#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:57,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {137376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137377#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:57,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {137377#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137378#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:57,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {137378#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137379#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:57,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {137379#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137380#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:57,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {137380#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137381#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:57,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {137381#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137382#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:57,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {137382#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137383#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:57,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {137383#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137384#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:57,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {137384#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137385#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:57,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {137385#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137386#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:57,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {137386#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137387#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:57,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {137387#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137388#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:57,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {137388#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {137388#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:57,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {137388#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {137389#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:10:57,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {137389#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137390#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:10:57,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {137390#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137391#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:10:57,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {137391#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137392#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:57,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {137392#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137393#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:57,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {137393#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137394#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:57,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {137394#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137395#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:57,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {137395#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137482#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:57,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {137482#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {137371#false} is VALID [2022-04-08 10:10:57,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:57,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:57,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:57,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:57,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:57,265 INFO L290 TraceCheckUtils]: 34: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:57,265 INFO L290 TraceCheckUtils]: 35: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:57,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:57,265 INFO L290 TraceCheckUtils]: 37: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:57,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:57,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:57,265 INFO L290 TraceCheckUtils]: 40: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:57,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:57,265 INFO L290 TraceCheckUtils]: 42: Hoare triple {137371#false} assume !(~y~0 % 4294967296 > 0); {137371#false} is VALID [2022-04-08 10:10:57,265 INFO L272 TraceCheckUtils]: 43: Hoare triple {137371#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {137371#false} is VALID [2022-04-08 10:10:57,265 INFO L290 TraceCheckUtils]: 44: Hoare triple {137371#false} ~cond := #in~cond; {137371#false} is VALID [2022-04-08 10:10:57,265 INFO L290 TraceCheckUtils]: 45: Hoare triple {137371#false} assume 0 == ~cond; {137371#false} is VALID [2022-04-08 10:10:57,265 INFO L290 TraceCheckUtils]: 46: Hoare triple {137371#false} assume !false; {137371#false} is VALID [2022-04-08 10:10:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:10:57,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:58,026 INFO L290 TraceCheckUtils]: 46: Hoare triple {137371#false} assume !false; {137371#false} is VALID [2022-04-08 10:10:58,026 INFO L290 TraceCheckUtils]: 45: Hoare triple {137371#false} assume 0 == ~cond; {137371#false} is VALID [2022-04-08 10:10:58,026 INFO L290 TraceCheckUtils]: 44: Hoare triple {137371#false} ~cond := #in~cond; {137371#false} is VALID [2022-04-08 10:10:58,026 INFO L272 TraceCheckUtils]: 43: Hoare triple {137371#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {137371#false} is VALID [2022-04-08 10:10:58,026 INFO L290 TraceCheckUtils]: 42: Hoare triple {137371#false} assume !(~y~0 % 4294967296 > 0); {137371#false} is VALID [2022-04-08 10:10:58,026 INFO L290 TraceCheckUtils]: 41: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:58,026 INFO L290 TraceCheckUtils]: 40: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:58,026 INFO L290 TraceCheckUtils]: 39: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:58,026 INFO L290 TraceCheckUtils]: 38: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:58,026 INFO L290 TraceCheckUtils]: 37: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:58,026 INFO L290 TraceCheckUtils]: 36: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:58,026 INFO L290 TraceCheckUtils]: 35: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:58,026 INFO L290 TraceCheckUtils]: 34: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:58,026 INFO L290 TraceCheckUtils]: 33: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:58,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:58,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:58,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:58,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-08 10:10:58,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {137594#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {137371#false} is VALID [2022-04-08 10:10:58,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {137598#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137594#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:58,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {137602#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137598#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:58,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {137606#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137602#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:58,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {137610#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137606#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:58,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {137614#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137610#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:58,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {137618#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137614#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:58,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {137622#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137618#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:58,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {137626#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} ~z~0 := ~y~0; {137622#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:10:58,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {137626#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~x~0 % 4294967296 > 0); {137626#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:10:58,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {137633#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137626#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:10:58,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {137637#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137633#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:58,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {137641#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137637#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:58,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {137645#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137641#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:58,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {137649#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137645#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:58,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {137653#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137649#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:58,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {137657#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137653#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:58,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {137661#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137657#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:58,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {137665#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137661#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:58,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {137669#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137665#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:10:58,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {137673#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137669#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:10:58,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {137677#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137673#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:10:58,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {137681#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137677#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:58,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {137370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {137681#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:10:58,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {137370#true} call #t~ret11 := main(); {137370#true} is VALID [2022-04-08 10:10:58,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137370#true} {137370#true} #61#return; {137370#true} is VALID [2022-04-08 10:10:58,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {137370#true} assume true; {137370#true} is VALID [2022-04-08 10:10:58,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {137370#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {137370#true} is VALID [2022-04-08 10:10:58,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {137370#true} call ULTIMATE.init(); {137370#true} is VALID [2022-04-08 10:10:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:10:58,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987981781] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:58,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:58,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-08 10:10:58,043 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:58,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1799049978] [2022-04-08 10:10:58,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1799049978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:58,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:58,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:10:58,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666596761] [2022-04-08 10:10:58,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:58,043 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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 47 [2022-04-08 10:10:58,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:58,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:10:58,079 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-08 10:10:58,079 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:10:58,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:58,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:10:58,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1899, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:10:58,080 INFO L87 Difference]: Start difference. First operand 212 states and 273 transitions. Second operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:11:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:01,341 INFO L93 Difference]: Finished difference Result 247 states and 308 transitions. [2022-04-08 10:11:01,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-08 10:11:01,341 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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 47 [2022-04-08 10:11:01,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:11:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 86 transitions. [2022-04-08 10:11:01,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:11:01,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 86 transitions. [2022-04-08 10:11:01,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 86 transitions. [2022-04-08 10:11:01,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:01,413 INFO L225 Difference]: With dead ends: 247 [2022-04-08 10:11:01,413 INFO L226 Difference]: Without dead ends: 228 [2022-04-08 10:11:01,414 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1216, Invalid=5590, Unknown=0, NotChecked=0, Total=6806 [2022-04-08 10:11:01,414 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:01,414 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 102 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:11:01,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-04-08 10:11:02,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 213. [2022-04-08 10:11:02,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:02,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 228 states. Second operand has 213 states, 208 states have (on average 1.2980769230769231) internal successors, (270), 208 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:02,230 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand has 213 states, 208 states have (on average 1.2980769230769231) internal successors, (270), 208 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:02,230 INFO L87 Difference]: Start difference. First operand 228 states. Second operand has 213 states, 208 states have (on average 1.2980769230769231) internal successors, (270), 208 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:02,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:02,232 INFO L93 Difference]: Finished difference Result 228 states and 289 transitions. [2022-04-08 10:11:02,232 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 289 transitions. [2022-04-08 10:11:02,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:02,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:02,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 208 states have (on average 1.2980769230769231) internal successors, (270), 208 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 228 states. [2022-04-08 10:11:02,233 INFO L87 Difference]: Start difference. First operand has 213 states, 208 states have (on average 1.2980769230769231) internal successors, (270), 208 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 228 states. [2022-04-08 10:11:02,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:02,235 INFO L93 Difference]: Finished difference Result 228 states and 289 transitions. [2022-04-08 10:11:02,235 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 289 transitions. [2022-04-08 10:11:02,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:02,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:02,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:02,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:02,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 208 states have (on average 1.2980769230769231) internal successors, (270), 208 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:02,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 274 transitions. [2022-04-08 10:11:02,238 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 274 transitions. Word has length 47 [2022-04-08 10:11:02,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:02,238 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 274 transitions. [2022-04-08 10:11:02,238 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:11:02,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 274 transitions. [2022-04-08 10:11:02,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 274 transitions. [2022-04-08 10:11:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 10:11:02,988 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:02,988 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:03,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Ended with exit code 0 [2022-04-08 10:11:03,191 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable117 [2022-04-08 10:11:03,191 INFO L403 AbstractCegarLoop]: === Iteration 119 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:03,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:03,192 INFO L85 PathProgramCache]: Analyzing trace with hash 733969647, now seen corresponding path program 227 times [2022-04-08 10:11:03,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:03,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1935224884] [2022-04-08 10:11:03,195 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:03,195 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:03,195 INFO L85 PathProgramCache]: Analyzing trace with hash 733969647, now seen corresponding path program 228 times [2022-04-08 10:11:03,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:03,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595562249] [2022-04-08 10:11:03,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:03,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:03,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:03,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {139174#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {139148#true} is VALID [2022-04-08 10:11:03,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {139148#true} assume true; {139148#true} is VALID [2022-04-08 10:11:03,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {139148#true} {139148#true} #61#return; {139148#true} is VALID [2022-04-08 10:11:03,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {139148#true} call ULTIMATE.init(); {139174#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:03,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {139174#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {139148#true} is VALID [2022-04-08 10:11:03,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {139148#true} assume true; {139148#true} is VALID [2022-04-08 10:11:03,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139148#true} {139148#true} #61#return; {139148#true} is VALID [2022-04-08 10:11:03,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {139148#true} call #t~ret11 := main(); {139148#true} is VALID [2022-04-08 10:11:03,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {139148#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {139153#(= main_~y~0 0)} is VALID [2022-04-08 10:11:03,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {139153#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139154#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:03,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {139154#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139155#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:03,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {139155#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139156#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:03,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {139156#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139157#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:03,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {139157#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139158#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:03,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {139158#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139159#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:03,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {139159#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139160#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:03,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {139160#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139161#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:03,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {139161#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139162#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:03,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {139162#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139163#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:03,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {139163#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139164#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:03,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {139164#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139165#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:03,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {139165#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139166#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:03,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {139166#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139167#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:03,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {139167#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {139167#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:03,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {139167#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {139168#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:11:03,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {139168#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139169#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:11:03,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {139169#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139170#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:11:03,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {139170#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139171#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:11:03,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {139171#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139172#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:11:03,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {139172#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139173#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:11:03,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {139173#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {139149#false} is VALID [2022-04-08 10:11:03,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:03,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:03,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:03,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:03,548 INFO L290 TraceCheckUtils]: 32: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:03,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:03,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:03,548 INFO L290 TraceCheckUtils]: 35: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:03,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:03,548 INFO L290 TraceCheckUtils]: 37: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:03,548 INFO L290 TraceCheckUtils]: 38: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:03,548 INFO L290 TraceCheckUtils]: 39: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:03,548 INFO L290 TraceCheckUtils]: 40: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:03,548 INFO L290 TraceCheckUtils]: 41: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:03,548 INFO L290 TraceCheckUtils]: 42: Hoare triple {139149#false} assume !(~y~0 % 4294967296 > 0); {139149#false} is VALID [2022-04-08 10:11:03,549 INFO L272 TraceCheckUtils]: 43: Hoare triple {139149#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {139149#false} is VALID [2022-04-08 10:11:03,549 INFO L290 TraceCheckUtils]: 44: Hoare triple {139149#false} ~cond := #in~cond; {139149#false} is VALID [2022-04-08 10:11:03,549 INFO L290 TraceCheckUtils]: 45: Hoare triple {139149#false} assume 0 == ~cond; {139149#false} is VALID [2022-04-08 10:11:03,549 INFO L290 TraceCheckUtils]: 46: Hoare triple {139149#false} assume !false; {139149#false} is VALID [2022-04-08 10:11:03,549 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:11:03,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:03,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595562249] [2022-04-08 10:11:03,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595562249] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:03,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227445639] [2022-04-08 10:11:03,549 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:11:03,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:03,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:03,550 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:03,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2022-04-08 10:11:03,973 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 10:11:03,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:03,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:11:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:03,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:04,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {139148#true} call ULTIMATE.init(); {139148#true} is VALID [2022-04-08 10:11:04,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {139148#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {139148#true} is VALID [2022-04-08 10:11:04,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {139148#true} assume true; {139148#true} is VALID [2022-04-08 10:11:04,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139148#true} {139148#true} #61#return; {139148#true} is VALID [2022-04-08 10:11:04,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {139148#true} call #t~ret11 := main(); {139148#true} is VALID [2022-04-08 10:11:04,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {139148#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {139153#(= main_~y~0 0)} is VALID [2022-04-08 10:11:04,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {139153#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139154#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:04,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {139154#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139155#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:04,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {139155#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139156#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:04,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {139156#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139157#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:04,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {139157#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139158#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:04,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {139158#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139159#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:04,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {139159#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139160#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:04,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {139160#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139161#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:04,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {139161#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139162#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:04,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {139162#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139163#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:04,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {139163#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139164#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:04,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {139164#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139165#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:04,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {139165#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139166#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:04,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {139166#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139167#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:04,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {139167#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {139167#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:04,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {139167#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {139168#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:11:04,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {139168#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139169#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:11:04,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {139169#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139170#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:11:04,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {139170#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139171#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:11:04,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {139171#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139172#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:11:04,347 INFO L290 TraceCheckUtils]: 26: Hoare triple {139172#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139256#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:11:04,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {139256#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {139149#false} is VALID [2022-04-08 10:11:04,348 INFO L290 TraceCheckUtils]: 28: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:04,348 INFO L290 TraceCheckUtils]: 29: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:04,348 INFO L290 TraceCheckUtils]: 30: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:04,348 INFO L290 TraceCheckUtils]: 31: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:04,348 INFO L290 TraceCheckUtils]: 32: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:04,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:04,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:04,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:04,348 INFO L290 TraceCheckUtils]: 36: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:04,348 INFO L290 TraceCheckUtils]: 37: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:04,348 INFO L290 TraceCheckUtils]: 38: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:04,349 INFO L290 TraceCheckUtils]: 39: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:04,349 INFO L290 TraceCheckUtils]: 40: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:04,349 INFO L290 TraceCheckUtils]: 41: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:04,349 INFO L290 TraceCheckUtils]: 42: Hoare triple {139149#false} assume !(~y~0 % 4294967296 > 0); {139149#false} is VALID [2022-04-08 10:11:04,349 INFO L272 TraceCheckUtils]: 43: Hoare triple {139149#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {139149#false} is VALID [2022-04-08 10:11:04,349 INFO L290 TraceCheckUtils]: 44: Hoare triple {139149#false} ~cond := #in~cond; {139149#false} is VALID [2022-04-08 10:11:04,349 INFO L290 TraceCheckUtils]: 45: Hoare triple {139149#false} assume 0 == ~cond; {139149#false} is VALID [2022-04-08 10:11:04,349 INFO L290 TraceCheckUtils]: 46: Hoare triple {139149#false} assume !false; {139149#false} is VALID [2022-04-08 10:11:04,349 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:11:04,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:05,177 INFO L290 TraceCheckUtils]: 46: Hoare triple {139149#false} assume !false; {139149#false} is VALID [2022-04-08 10:11:05,177 INFO L290 TraceCheckUtils]: 45: Hoare triple {139149#false} assume 0 == ~cond; {139149#false} is VALID [2022-04-08 10:11:05,177 INFO L290 TraceCheckUtils]: 44: Hoare triple {139149#false} ~cond := #in~cond; {139149#false} is VALID [2022-04-08 10:11:05,177 INFO L272 TraceCheckUtils]: 43: Hoare triple {139149#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {139149#false} is VALID [2022-04-08 10:11:05,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {139149#false} assume !(~y~0 % 4294967296 > 0); {139149#false} is VALID [2022-04-08 10:11:05,177 INFO L290 TraceCheckUtils]: 41: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:05,177 INFO L290 TraceCheckUtils]: 40: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:05,177 INFO L290 TraceCheckUtils]: 39: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:05,177 INFO L290 TraceCheckUtils]: 38: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:05,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:05,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:05,177 INFO L290 TraceCheckUtils]: 35: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:05,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:05,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:05,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:05,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:05,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:05,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:05,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-08 10:11:05,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {139374#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {139149#false} is VALID [2022-04-08 10:11:05,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {139378#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139374#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:05,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {139382#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139378#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:05,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {139386#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139382#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:05,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {139390#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139386#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:11:05,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {139394#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139390#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:11:05,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {139398#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {139394#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:11:05,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {139398#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {139398#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:05,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {139405#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139398#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:05,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {139409#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139405#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:05,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {139413#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139409#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:11:05,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {139417#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139413#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:05,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {139421#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139417#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:05,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {139425#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139421#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:05,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {139429#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139425#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:11:05,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {139433#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139429#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:11:05,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {139437#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139433#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:11:05,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {139441#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139437#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:11:05,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {139445#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139441#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:05,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {139449#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139445#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:11:05,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {139453#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139449#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:05,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {139457#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139453#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:11:05,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {139148#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {139457#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:11:05,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {139148#true} call #t~ret11 := main(); {139148#true} is VALID [2022-04-08 10:11:05,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139148#true} {139148#true} #61#return; {139148#true} is VALID [2022-04-08 10:11:05,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {139148#true} assume true; {139148#true} is VALID [2022-04-08 10:11:05,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {139148#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {139148#true} is VALID [2022-04-08 10:11:05,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {139148#true} call ULTIMATE.init(); {139148#true} is VALID [2022-04-08 10:11:05,192 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:11:05,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227445639] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:05,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:05,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-08 10:11:05,192 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:05,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1935224884] [2022-04-08 10:11:05,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1935224884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:05,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:05,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:11:05,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920327750] [2022-04-08 10:11:05,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:05,193 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-08 10:11:05,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:05,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:05,217 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-08 10:11:05,217 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:11:05,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:05,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:11:05,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1714, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:11:05,218 INFO L87 Difference]: Start difference. First operand 213 states and 274 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:08,464 INFO L93 Difference]: Finished difference Result 250 states and 311 transitions. [2022-04-08 10:11:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-08 10:11:08,465 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-08 10:11:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 89 transitions. [2022-04-08 10:11:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:08,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 89 transitions. [2022-04-08 10:11:08,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 89 transitions. [2022-04-08 10:11:08,536 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-08 10:11:08,538 INFO L225 Difference]: With dead ends: 250 [2022-04-08 10:11:08,539 INFO L226 Difference]: Without dead ends: 230 [2022-04-08 10:11:08,539 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1149, Invalid=5013, Unknown=0, NotChecked=0, Total=6162 [2022-04-08 10:11:08,539 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:08,539 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 114 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:11:08,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-04-08 10:11:09,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 214. [2022-04-08 10:11:09,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:09,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand has 214 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 209 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:09,353 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand has 214 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 209 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:09,353 INFO L87 Difference]: Start difference. First operand 230 states. Second operand has 214 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 209 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:09,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:09,356 INFO L93 Difference]: Finished difference Result 230 states and 291 transitions. [2022-04-08 10:11:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 291 transitions. [2022-04-08 10:11:09,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:09,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:09,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 209 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 230 states. [2022-04-08 10:11:09,356 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 209 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 230 states. [2022-04-08 10:11:09,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:09,359 INFO L93 Difference]: Finished difference Result 230 states and 291 transitions. [2022-04-08 10:11:09,359 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 291 transitions. [2022-04-08 10:11:09,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:09,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:09,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:09,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 209 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 275 transitions. [2022-04-08 10:11:09,362 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 275 transitions. Word has length 47 [2022-04-08 10:11:09,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:09,362 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 275 transitions. [2022-04-08 10:11:09,362 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:09,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 275 transitions. [2022-04-08 10:11:10,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:10,106 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 275 transitions. [2022-04-08 10:11:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 10:11:10,107 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:10,107 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:10,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:10,307 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118,117 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:10,307 INFO L403 AbstractCegarLoop]: === Iteration 120 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:10,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:10,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1751323009, now seen corresponding path program 229 times [2022-04-08 10:11:10,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:10,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1184874703] [2022-04-08 10:11:10,310 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:10,310 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:10,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1751323009, now seen corresponding path program 230 times [2022-04-08 10:11:10,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:10,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71411990] [2022-04-08 10:11:10,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:10,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:10,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:10,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {140957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {140932#true} is VALID [2022-04-08 10:11:10,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {140932#true} assume true; {140932#true} is VALID [2022-04-08 10:11:10,646 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {140932#true} {140932#true} #61#return; {140932#true} is VALID [2022-04-08 10:11:10,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {140932#true} call ULTIMATE.init(); {140957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:10,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {140957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {140932#true} is VALID [2022-04-08 10:11:10,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {140932#true} assume true; {140932#true} is VALID [2022-04-08 10:11:10,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {140932#true} {140932#true} #61#return; {140932#true} is VALID [2022-04-08 10:11:10,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {140932#true} call #t~ret11 := main(); {140932#true} is VALID [2022-04-08 10:11:10,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {140932#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {140937#(= main_~y~0 0)} is VALID [2022-04-08 10:11:10,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {140937#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140938#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:10,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {140938#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140939#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:10,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {140939#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140940#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:10,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {140940#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140941#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:10,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {140941#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140942#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:10,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {140942#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140943#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:10,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {140943#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140944#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:10,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {140944#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140945#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:10,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {140945#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140946#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:10,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {140946#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140947#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:10,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {140947#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140948#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:10,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {140948#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140949#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:10,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {140949#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140950#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:10,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {140950#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140951#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:10,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {140951#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140952#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:10,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {140952#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {140952#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:10,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {140952#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {140953#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:11:10,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {140953#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {140954#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:11:10,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {140954#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {140955#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:11:10,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {140955#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {140956#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-08 10:11:10,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {140956#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {140933#false} is VALID [2022-04-08 10:11:10,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:10,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:10,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:10,661 INFO L290 TraceCheckUtils]: 30: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:10,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:10,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:10,661 INFO L290 TraceCheckUtils]: 33: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:10,661 INFO L290 TraceCheckUtils]: 34: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:10,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:10,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:10,661 INFO L290 TraceCheckUtils]: 37: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:10,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:10,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:10,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:10,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:10,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {140933#false} assume !(~y~0 % 4294967296 > 0); {140933#false} is VALID [2022-04-08 10:11:10,662 INFO L272 TraceCheckUtils]: 43: Hoare triple {140933#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {140933#false} is VALID [2022-04-08 10:11:10,662 INFO L290 TraceCheckUtils]: 44: Hoare triple {140933#false} ~cond := #in~cond; {140933#false} is VALID [2022-04-08 10:11:10,662 INFO L290 TraceCheckUtils]: 45: Hoare triple {140933#false} assume 0 == ~cond; {140933#false} is VALID [2022-04-08 10:11:10,662 INFO L290 TraceCheckUtils]: 46: Hoare triple {140933#false} assume !false; {140933#false} is VALID [2022-04-08 10:11:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 10:11:10,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:10,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71411990] [2022-04-08 10:11:10,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71411990] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:10,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715056701] [2022-04-08 10:11:10,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:11:10,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:10,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:10,663 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:10,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2022-04-08 10:11:10,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:11:10,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:10,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 10:11:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:10,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:11,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {140932#true} call ULTIMATE.init(); {140932#true} is VALID [2022-04-08 10:11:11,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {140932#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {140932#true} is VALID [2022-04-08 10:11:11,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {140932#true} assume true; {140932#true} is VALID [2022-04-08 10:11:11,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {140932#true} {140932#true} #61#return; {140932#true} is VALID [2022-04-08 10:11:11,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {140932#true} call #t~ret11 := main(); {140932#true} is VALID [2022-04-08 10:11:11,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {140932#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {140937#(= main_~y~0 0)} is VALID [2022-04-08 10:11:11,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {140937#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140938#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:11,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {140938#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140939#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:11,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {140939#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140940#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:11,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {140940#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140941#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:11,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {140941#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140942#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:11,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {140942#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140943#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:11,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {140943#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140944#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:11,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {140944#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140945#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:11,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {140945#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140946#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:11,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {140946#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140947#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:11,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {140947#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140948#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:11,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {140948#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140949#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:11,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {140949#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140950#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:11,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {140950#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140951#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:11,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {140951#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140952#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:11,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {140952#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {140952#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:11,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {140952#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {140953#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:11:11,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {140953#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {140954#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:11:11,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {140954#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {140955#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:11:11,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {140955#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {141036#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:11:11,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {141036#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {140933#false} is VALID [2022-04-08 10:11:11,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,067 INFO L290 TraceCheckUtils]: 30: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,067 INFO L290 TraceCheckUtils]: 32: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,067 INFO L290 TraceCheckUtils]: 34: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,067 INFO L290 TraceCheckUtils]: 35: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,067 INFO L290 TraceCheckUtils]: 36: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,067 INFO L290 TraceCheckUtils]: 37: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,067 INFO L290 TraceCheckUtils]: 38: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,067 INFO L290 TraceCheckUtils]: 39: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,067 INFO L290 TraceCheckUtils]: 40: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,067 INFO L290 TraceCheckUtils]: 41: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,068 INFO L290 TraceCheckUtils]: 42: Hoare triple {140933#false} assume !(~y~0 % 4294967296 > 0); {140933#false} is VALID [2022-04-08 10:11:11,068 INFO L272 TraceCheckUtils]: 43: Hoare triple {140933#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {140933#false} is VALID [2022-04-08 10:11:11,068 INFO L290 TraceCheckUtils]: 44: Hoare triple {140933#false} ~cond := #in~cond; {140933#false} is VALID [2022-04-08 10:11:11,068 INFO L290 TraceCheckUtils]: 45: Hoare triple {140933#false} assume 0 == ~cond; {140933#false} is VALID [2022-04-08 10:11:11,068 INFO L290 TraceCheckUtils]: 46: Hoare triple {140933#false} assume !false; {140933#false} is VALID [2022-04-08 10:11:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 10:11:11,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:11,734 INFO L290 TraceCheckUtils]: 46: Hoare triple {140933#false} assume !false; {140933#false} is VALID [2022-04-08 10:11:11,734 INFO L290 TraceCheckUtils]: 45: Hoare triple {140933#false} assume 0 == ~cond; {140933#false} is VALID [2022-04-08 10:11:11,734 INFO L290 TraceCheckUtils]: 44: Hoare triple {140933#false} ~cond := #in~cond; {140933#false} is VALID [2022-04-08 10:11:11,734 INFO L272 TraceCheckUtils]: 43: Hoare triple {140933#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {140933#false} is VALID [2022-04-08 10:11:11,735 INFO L290 TraceCheckUtils]: 42: Hoare triple {140933#false} assume !(~y~0 % 4294967296 > 0); {140933#false} is VALID [2022-04-08 10:11:11,735 INFO L290 TraceCheckUtils]: 41: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,735 INFO L290 TraceCheckUtils]: 40: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,735 INFO L290 TraceCheckUtils]: 39: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,735 INFO L290 TraceCheckUtils]: 38: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,735 INFO L290 TraceCheckUtils]: 27: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-08 10:11:11,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {141160#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {140933#false} is VALID [2022-04-08 10:11:11,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {141164#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {141160#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:11,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {141168#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {141164#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:11,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {141172#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {141168#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:11,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {141176#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {141172#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:11:11,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {141176#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {141176#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:11:11,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {141183#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {141176#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:11:11,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {141187#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {141183#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:11,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {141191#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {141187#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:11,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {141195#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {141191#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:11,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {141199#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {141195#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:11:11,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {141203#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {141199#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:11:11,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {141207#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {141203#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:11:11,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {141211#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {141207#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:11:11,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {141215#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {141211#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:11,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {141219#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {141215#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:11:11,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {141223#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {141219#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:11,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {141227#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {141223#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:11:11,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {141231#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {141227#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:11:11,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {141235#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {141231#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:11:11,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {141239#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {141235#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:11:11,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {140932#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {141239#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:11:11,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {140932#true} call #t~ret11 := main(); {140932#true} is VALID [2022-04-08 10:11:11,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {140932#true} {140932#true} #61#return; {140932#true} is VALID [2022-04-08 10:11:11,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {140932#true} assume true; {140932#true} is VALID [2022-04-08 10:11:11,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {140932#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {140932#true} is VALID [2022-04-08 10:11:11,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {140932#true} call ULTIMATE.init(); {140932#true} is VALID [2022-04-08 10:11:11,750 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 10:11:11,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715056701] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:11,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:11,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-08 10:11:11,751 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:11,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1184874703] [2022-04-08 10:11:11,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1184874703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:11,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:11,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:11:11,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124329326] [2022-04-08 10:11:11,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:11,751 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-08 10:11:11,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:11,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:11,772 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-08 10:11:11,772 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:11:11,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:11,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:11:11,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1531, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:11:11,773 INFO L87 Difference]: Start difference. First operand 214 states and 275 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:14,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:14,830 INFO L93 Difference]: Finished difference Result 253 states and 314 transitions. [2022-04-08 10:11:14,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 10:11:14,830 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-08 10:11:14,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 87 transitions. [2022-04-08 10:11:14,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 87 transitions. [2022-04-08 10:11:14,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 87 transitions. [2022-04-08 10:11:14,900 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-08 10:11:14,904 INFO L225 Difference]: With dead ends: 253 [2022-04-08 10:11:14,904 INFO L226 Difference]: Without dead ends: 232 [2022-04-08 10:11:14,904 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=949, Invalid=3881, Unknown=0, NotChecked=0, Total=4830 [2022-04-08 10:11:14,904 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:14,904 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 122 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:11:14,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-04-08 10:11:15,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 215. [2022-04-08 10:11:15,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:15,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:15,729 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:15,730 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:15,732 INFO L93 Difference]: Finished difference Result 232 states and 293 transitions. [2022-04-08 10:11:15,732 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 293 transitions. [2022-04-08 10:11:15,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:15,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:15,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 232 states. [2022-04-08 10:11:15,733 INFO L87 Difference]: Start difference. First operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 232 states. [2022-04-08 10:11:15,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:15,735 INFO L93 Difference]: Finished difference Result 232 states and 293 transitions. [2022-04-08 10:11:15,735 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 293 transitions. [2022-04-08 10:11:15,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:15,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:15,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:15,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:15,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 276 transitions. [2022-04-08 10:11:15,738 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 276 transitions. Word has length 47 [2022-04-08 10:11:15,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:15,738 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 276 transitions. [2022-04-08 10:11:15,738 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:15,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 215 states and 276 transitions. [2022-04-08 10:11:16,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:16,490 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 276 transitions. [2022-04-08 10:11:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 10:11:16,490 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:16,490 INFO L499 BasicCegarLoop]: trace histogram [30, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:16,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Ended with exit code 0 [2022-04-08 10:11:16,690 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,118 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:16,691 INFO L403 AbstractCegarLoop]: === Iteration 121 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:16,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:16,691 INFO L85 PathProgramCache]: Analyzing trace with hash -276285137, now seen corresponding path program 231 times [2022-04-08 10:11:16,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:16,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [352601091] [2022-04-08 10:11:16,694 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:16,694 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:16,694 INFO L85 PathProgramCache]: Analyzing trace with hash -276285137, now seen corresponding path program 232 times [2022-04-08 10:11:16,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:16,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502352637] [2022-04-08 10:11:16,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:16,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:17,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:17,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {142750#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {142712#true} is VALID [2022-04-08 10:11:17,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {142712#true} assume true; {142712#true} is VALID [2022-04-08 10:11:17,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142712#true} {142712#true} #61#return; {142712#true} is VALID [2022-04-08 10:11:17,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {142712#true} call ULTIMATE.init(); {142750#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:17,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {142750#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {142712#true} is VALID [2022-04-08 10:11:17,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {142712#true} assume true; {142712#true} is VALID [2022-04-08 10:11:17,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142712#true} {142712#true} #61#return; {142712#true} is VALID [2022-04-08 10:11:17,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {142712#true} call #t~ret11 := main(); {142712#true} is VALID [2022-04-08 10:11:17,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {142712#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {142717#(= main_~y~0 0)} is VALID [2022-04-08 10:11:17,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {142717#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142718#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:17,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {142718#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142719#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:17,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {142719#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142720#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:17,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {142720#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142721#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:17,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {142721#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142722#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:17,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {142722#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142723#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:17,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {142723#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142724#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:17,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {142724#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142725#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:17,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {142725#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142726#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:17,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {142726#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142727#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:17,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {142727#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142728#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:17,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {142728#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142729#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:17,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {142729#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142730#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:17,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {142730#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142731#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:17,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {142731#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142732#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:17,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {142732#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142733#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:17,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {142733#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142734#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:11:17,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {142734#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142735#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:11:17,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {142735#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142736#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:11:17,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {142736#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142737#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:11:17,389 INFO L290 TraceCheckUtils]: 26: Hoare triple {142737#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142738#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:11:17,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {142738#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142739#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:11:17,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {142739#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142740#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:11:17,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {142740#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142741#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:11:17,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {142741#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142742#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:11:17,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {142742#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142743#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:11:17,392 INFO L290 TraceCheckUtils]: 32: Hoare triple {142743#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142744#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:11:17,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {142744#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142745#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-08 10:11:17,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {142745#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142746#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-08 10:11:17,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {142746#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142747#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-08 10:11:17,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {142747#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {142747#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-08 10:11:17,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {142747#(and (<= main_~y~0 30) (<= 30 main_~y~0))} ~z~0 := ~y~0; {142748#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-08 10:11:17,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {142748#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142749#(and (<= (div main_~z~0 4294967296) 0) (<= 29 main_~z~0))} is VALID [2022-04-08 10:11:17,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {142749#(and (<= (div main_~z~0 4294967296) 0) (<= 29 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {142713#false} is VALID [2022-04-08 10:11:17,396 INFO L290 TraceCheckUtils]: 40: Hoare triple {142713#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {142713#false} is VALID [2022-04-08 10:11:17,396 INFO L290 TraceCheckUtils]: 41: Hoare triple {142713#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {142713#false} is VALID [2022-04-08 10:11:17,396 INFO L290 TraceCheckUtils]: 42: Hoare triple {142713#false} assume !(~y~0 % 4294967296 > 0); {142713#false} is VALID [2022-04-08 10:11:17,396 INFO L272 TraceCheckUtils]: 43: Hoare triple {142713#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {142713#false} is VALID [2022-04-08 10:11:17,396 INFO L290 TraceCheckUtils]: 44: Hoare triple {142713#false} ~cond := #in~cond; {142713#false} is VALID [2022-04-08 10:11:17,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {142713#false} assume 0 == ~cond; {142713#false} is VALID [2022-04-08 10:11:17,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {142713#false} assume !false; {142713#false} is VALID [2022-04-08 10:11:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 466 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:11:17,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:17,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502352637] [2022-04-08 10:11:17,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502352637] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:17,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062729872] [2022-04-08 10:11:17,396 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:11:17,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:17,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:17,397 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:17,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2022-04-08 10:11:17,450 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:11:17,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:17,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-08 10:11:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:17,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:17,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {142712#true} call ULTIMATE.init(); {142712#true} is VALID [2022-04-08 10:11:17,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {142712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {142712#true} is VALID [2022-04-08 10:11:17,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {142712#true} assume true; {142712#true} is VALID [2022-04-08 10:11:17,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142712#true} {142712#true} #61#return; {142712#true} is VALID [2022-04-08 10:11:17,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {142712#true} call #t~ret11 := main(); {142712#true} is VALID [2022-04-08 10:11:17,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {142712#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {142717#(= main_~y~0 0)} is VALID [2022-04-08 10:11:17,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {142717#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142718#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:17,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {142718#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142719#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:17,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {142719#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142720#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:17,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {142720#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142721#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:17,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {142721#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142722#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:17,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {142722#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142723#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:17,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {142723#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142724#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:17,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {142724#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142725#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:17,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {142725#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142726#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:17,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {142726#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142727#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:17,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {142727#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142728#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:17,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {142728#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142729#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:17,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {142729#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142730#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:17,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {142730#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142731#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:17,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {142731#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142732#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:17,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {142732#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142733#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:17,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {142733#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142734#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:11:17,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {142734#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142735#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:11:17,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {142735#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142736#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:11:17,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {142736#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142737#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:11:17,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {142737#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142738#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:11:17,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {142738#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142739#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:11:17,921 INFO L290 TraceCheckUtils]: 28: Hoare triple {142739#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142740#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:11:17,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {142740#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142741#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:11:17,922 INFO L290 TraceCheckUtils]: 30: Hoare triple {142741#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142742#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:11:17,922 INFO L290 TraceCheckUtils]: 31: Hoare triple {142742#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142743#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:11:17,923 INFO L290 TraceCheckUtils]: 32: Hoare triple {142743#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142744#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:11:17,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {142744#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142745#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-08 10:11:17,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {142745#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142746#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-08 10:11:17,925 INFO L290 TraceCheckUtils]: 35: Hoare triple {142746#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142747#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-08 10:11:17,925 INFO L290 TraceCheckUtils]: 36: Hoare triple {142747#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {142747#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-08 10:11:17,925 INFO L290 TraceCheckUtils]: 37: Hoare triple {142747#(and (<= main_~y~0 30) (<= 30 main_~y~0))} ~z~0 := ~y~0; {142748#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-08 10:11:17,926 INFO L290 TraceCheckUtils]: 38: Hoare triple {142748#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142868#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-08 10:11:17,926 INFO L290 TraceCheckUtils]: 39: Hoare triple {142868#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {142713#false} is VALID [2022-04-08 10:11:17,926 INFO L290 TraceCheckUtils]: 40: Hoare triple {142713#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {142713#false} is VALID [2022-04-08 10:11:17,926 INFO L290 TraceCheckUtils]: 41: Hoare triple {142713#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {142713#false} is VALID [2022-04-08 10:11:17,926 INFO L290 TraceCheckUtils]: 42: Hoare triple {142713#false} assume !(~y~0 % 4294967296 > 0); {142713#false} is VALID [2022-04-08 10:11:17,926 INFO L272 TraceCheckUtils]: 43: Hoare triple {142713#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {142713#false} is VALID [2022-04-08 10:11:17,926 INFO L290 TraceCheckUtils]: 44: Hoare triple {142713#false} ~cond := #in~cond; {142713#false} is VALID [2022-04-08 10:11:17,927 INFO L290 TraceCheckUtils]: 45: Hoare triple {142713#false} assume 0 == ~cond; {142713#false} is VALID [2022-04-08 10:11:17,927 INFO L290 TraceCheckUtils]: 46: Hoare triple {142713#false} assume !false; {142713#false} is VALID [2022-04-08 10:11:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 466 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:11:17,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:19,545 INFO L290 TraceCheckUtils]: 46: Hoare triple {142713#false} assume !false; {142713#false} is VALID [2022-04-08 10:11:19,545 INFO L290 TraceCheckUtils]: 45: Hoare triple {142713#false} assume 0 == ~cond; {142713#false} is VALID [2022-04-08 10:11:19,546 INFO L290 TraceCheckUtils]: 44: Hoare triple {142713#false} ~cond := #in~cond; {142713#false} is VALID [2022-04-08 10:11:19,546 INFO L272 TraceCheckUtils]: 43: Hoare triple {142713#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {142713#false} is VALID [2022-04-08 10:11:19,546 INFO L290 TraceCheckUtils]: 42: Hoare triple {142713#false} assume !(~y~0 % 4294967296 > 0); {142713#false} is VALID [2022-04-08 10:11:19,546 INFO L290 TraceCheckUtils]: 41: Hoare triple {142713#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {142713#false} is VALID [2022-04-08 10:11:19,546 INFO L290 TraceCheckUtils]: 40: Hoare triple {142713#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {142713#false} is VALID [2022-04-08 10:11:19,546 INFO L290 TraceCheckUtils]: 39: Hoare triple {142914#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {142713#false} is VALID [2022-04-08 10:11:19,547 INFO L290 TraceCheckUtils]: 38: Hoare triple {142918#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142914#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:19,547 INFO L290 TraceCheckUtils]: 37: Hoare triple {142922#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {142918#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:19,547 INFO L290 TraceCheckUtils]: 36: Hoare triple {142922#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {142922#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:19,548 INFO L290 TraceCheckUtils]: 35: Hoare triple {142929#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142922#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:19,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {142933#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142929#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:19,549 INFO L290 TraceCheckUtils]: 33: Hoare triple {142937#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142933#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:11:19,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {142941#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142937#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:11:19,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {142945#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142941#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:11:19,551 INFO L290 TraceCheckUtils]: 30: Hoare triple {142949#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142945#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:11:19,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {142953#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142949#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:19,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {142957#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142953#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:11:19,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {142961#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142957#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:19,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {142965#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142961#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:11:19,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {142969#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142965#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:11:19,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {142973#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142969#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:11:19,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {142977#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142973#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:11:19,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {142981#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142977#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:11:19,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {142985#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142981#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:11:19,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {142989#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142985#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:11:19,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {142993#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142989#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:11:19,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {142997#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142993#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:11:19,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {143001#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142997#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:11:19,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {143005#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143001#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:11:19,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {143009#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143005#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:19,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {143013#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143009#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:11:19,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {143017#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143013#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:11:19,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {143021#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143017#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-08 10:11:19,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {143025#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143021#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:19,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {143029#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143025#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-08 10:11:19,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {143033#(< 0 (mod (+ main_~y~0 26) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143029#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-08 10:11:19,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {143037#(< 0 (mod (+ main_~y~0 27) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143033#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-08 10:11:19,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {143041#(< 0 (mod (+ main_~y~0 28) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143037#(< 0 (mod (+ main_~y~0 27) 4294967296))} is VALID [2022-04-08 10:11:19,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {143045#(< 0 (mod (+ 29 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143041#(< 0 (mod (+ main_~y~0 28) 4294967296))} is VALID [2022-04-08 10:11:19,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {142712#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {143045#(< 0 (mod (+ 29 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:19,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {142712#true} call #t~ret11 := main(); {142712#true} is VALID [2022-04-08 10:11:19,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142712#true} {142712#true} #61#return; {142712#true} is VALID [2022-04-08 10:11:19,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {142712#true} assume true; {142712#true} is VALID [2022-04-08 10:11:19,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {142712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {142712#true} is VALID [2022-04-08 10:11:19,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {142712#true} call ULTIMATE.init(); {142712#true} is VALID [2022-04-08 10:11:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 466 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:11:19,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062729872] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:19,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:19,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 70 [2022-04-08 10:11:19,568 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:19,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [352601091] [2022-04-08 10:11:19,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [352601091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:19,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:19,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-08 10:11:19,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244738056] [2022-04-08 10:11:19,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:19,568 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-08 10:11:19,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:19,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:19,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:19,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-08 10:11:19,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:19,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-08 10:11:19,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1104, Invalid=3726, Unknown=0, NotChecked=0, Total=4830 [2022-04-08 10:11:19,596 INFO L87 Difference]: Start difference. First operand 215 states and 276 transitions. Second operand has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:27,602 INFO L93 Difference]: Finished difference Result 345 states and 504 transitions. [2022-04-08 10:11:27,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-08 10:11:27,602 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-08 10:11:27,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:27,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 200 transitions. [2022-04-08 10:11:27,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 200 transitions. [2022-04-08 10:11:27,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 200 transitions. [2022-04-08 10:11:27,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:27,768 INFO L225 Difference]: With dead ends: 345 [2022-04-08 10:11:27,769 INFO L226 Difference]: Without dead ends: 337 [2022-04-08 10:11:27,769 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2306, Invalid=8406, Unknown=0, NotChecked=0, Total=10712 [2022-04-08 10:11:27,769 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 171 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 4648 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 4779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 4648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:27,770 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 230 Invalid, 4779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 4648 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-08 10:11:27,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-08 10:11:28,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 221. [2022-04-08 10:11:28,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:28,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:28,621 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:28,621 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:28,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:28,625 INFO L93 Difference]: Finished difference Result 337 states and 410 transitions. [2022-04-08 10:11:28,625 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 410 transitions. [2022-04-08 10:11:28,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:28,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:28,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 337 states. [2022-04-08 10:11:28,626 INFO L87 Difference]: Start difference. First operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 337 states. [2022-04-08 10:11:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:28,630 INFO L93 Difference]: Finished difference Result 337 states and 410 transitions. [2022-04-08 10:11:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 410 transitions. [2022-04-08 10:11:28,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:28,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:28,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:28,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:28,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 284 transitions. [2022-04-08 10:11:28,633 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 284 transitions. Word has length 47 [2022-04-08 10:11:28,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:28,633 INFO L478 AbstractCegarLoop]: Abstraction has 221 states and 284 transitions. [2022-04-08 10:11:28,633 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:28,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 221 states and 284 transitions. [2022-04-08 10:11:29,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 284 edges. 284 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:29,398 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 284 transitions. [2022-04-08 10:11:29,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 10:11:29,398 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:29,398 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:29,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:29,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,119 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:29,603 INFO L403 AbstractCegarLoop]: === Iteration 122 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:29,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:29,604 INFO L85 PathProgramCache]: Analyzing trace with hash 609074559, now seen corresponding path program 233 times [2022-04-08 10:11:29,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:29,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [568198400] [2022-04-08 10:11:29,606 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:29,606 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:29,606 INFO L85 PathProgramCache]: Analyzing trace with hash 609074559, now seen corresponding path program 234 times [2022-04-08 10:11:29,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:29,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266798448] [2022-04-08 10:11:29,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:29,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:30,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:30,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {144969#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {144940#true} is VALID [2022-04-08 10:11:30,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {144940#true} assume true; {144940#true} is VALID [2022-04-08 10:11:30,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {144940#true} {144940#true} #61#return; {144940#true} is VALID [2022-04-08 10:11:30,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {144940#true} call ULTIMATE.init(); {144969#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:30,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {144969#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {144940#true} is VALID [2022-04-08 10:11:30,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {144940#true} assume true; {144940#true} is VALID [2022-04-08 10:11:30,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144940#true} {144940#true} #61#return; {144940#true} is VALID [2022-04-08 10:11:30,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {144940#true} call #t~ret11 := main(); {144940#true} is VALID [2022-04-08 10:11:30,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {144940#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {144945#(= main_~y~0 0)} is VALID [2022-04-08 10:11:30,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {144945#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144946#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:30,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {144946#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144947#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:30,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {144947#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144948#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:30,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {144948#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144949#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:30,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {144949#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144950#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:30,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {144950#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144951#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:30,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {144951#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144952#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:30,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {144952#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144953#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:30,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {144953#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144954#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:30,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {144954#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144955#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:30,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {144955#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144956#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:30,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {144956#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {144956#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:30,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {144956#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {144957#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:11:30,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {144957#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144958#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:11:30,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {144958#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144959#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:11:30,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {144959#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144960#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:11:30,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {144960#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144961#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:11:30,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {144961#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144962#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:11:30,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {144962#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144963#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:11:30,035 INFO L290 TraceCheckUtils]: 25: Hoare triple {144963#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144964#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:11:30,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {144964#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144965#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:11:30,036 INFO L290 TraceCheckUtils]: 27: Hoare triple {144965#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144966#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:11:30,036 INFO L290 TraceCheckUtils]: 28: Hoare triple {144966#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144967#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:11:30,037 INFO L290 TraceCheckUtils]: 29: Hoare triple {144967#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144968#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:11:30,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {144968#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144941#false} is VALID [2022-04-08 10:11:30,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {144941#false} assume !(~z~0 % 4294967296 > 0); {144941#false} is VALID [2022-04-08 10:11:30,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:30,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:30,038 INFO L290 TraceCheckUtils]: 34: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:30,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:30,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:30,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:30,038 INFO L290 TraceCheckUtils]: 38: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:30,038 INFO L290 TraceCheckUtils]: 39: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:30,038 INFO L290 TraceCheckUtils]: 40: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:30,038 INFO L290 TraceCheckUtils]: 41: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:30,038 INFO L290 TraceCheckUtils]: 42: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:30,038 INFO L290 TraceCheckUtils]: 43: Hoare triple {144941#false} assume !(~y~0 % 4294967296 > 0); {144941#false} is VALID [2022-04-08 10:11:30,038 INFO L272 TraceCheckUtils]: 44: Hoare triple {144941#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {144941#false} is VALID [2022-04-08 10:11:30,038 INFO L290 TraceCheckUtils]: 45: Hoare triple {144941#false} ~cond := #in~cond; {144941#false} is VALID [2022-04-08 10:11:30,038 INFO L290 TraceCheckUtils]: 46: Hoare triple {144941#false} assume 0 == ~cond; {144941#false} is VALID [2022-04-08 10:11:30,038 INFO L290 TraceCheckUtils]: 47: Hoare triple {144941#false} assume !false; {144941#false} is VALID [2022-04-08 10:11:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:11:30,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:30,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266798448] [2022-04-08 10:11:30,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266798448] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:30,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113900818] [2022-04-08 10:11:30,039 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:11:30,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:30,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:30,040 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:30,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2022-04-08 10:11:30,377 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:11:30,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:30,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-08 10:11:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:30,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:30,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {144940#true} call ULTIMATE.init(); {144940#true} is VALID [2022-04-08 10:11:30,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {144940#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {144940#true} is VALID [2022-04-08 10:11:30,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {144940#true} assume true; {144940#true} is VALID [2022-04-08 10:11:30,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144940#true} {144940#true} #61#return; {144940#true} is VALID [2022-04-08 10:11:30,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {144940#true} call #t~ret11 := main(); {144940#true} is VALID [2022-04-08 10:11:30,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {144940#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {144945#(= main_~y~0 0)} is VALID [2022-04-08 10:11:30,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {144945#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144946#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:30,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {144946#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144947#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:30,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {144947#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144948#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:30,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {144948#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144949#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:30,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {144949#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144950#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:30,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {144950#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144951#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:30,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {144951#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144952#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:30,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {144952#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144953#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:30,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {144953#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144954#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:30,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {144954#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144955#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:30,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {144955#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144956#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:30,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {144956#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {144956#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:30,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {144956#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {145027#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:30,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {145027#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145031#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:11:30,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {145031#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145035#(and (<= main_~y~0 11) (= main_~y~0 (+ main_~z~0 2)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:30,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {145035#(and (<= main_~y~0 11) (= main_~y~0 (+ main_~z~0 2)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145039#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-08 10:11:30,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {145039#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145043#(and (<= main_~y~0 11) (= main_~y~0 (+ main_~z~0 4)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:30,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {145043#(and (<= main_~y~0 11) (= main_~y~0 (+ main_~z~0 4)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145047#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:30,996 INFO L290 TraceCheckUtils]: 24: Hoare triple {145047#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145051#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:30,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {145051#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145055#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:30,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {145055#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145059#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:30,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {145059#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145063#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:30,998 INFO L290 TraceCheckUtils]: 28: Hoare triple {145063#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145067#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= (+ (- 9) main_~y~0) (+ main_~z~0 1)))} is VALID [2022-04-08 10:11:30,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {145067#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= (+ (- 9) main_~y~0) (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145071#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 10))) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:31,000 INFO L290 TraceCheckUtils]: 30: Hoare triple {145071#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 10))) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144941#false} is VALID [2022-04-08 10:11:31,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {144941#false} assume !(~z~0 % 4294967296 > 0); {144941#false} is VALID [2022-04-08 10:11:31,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:31,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:31,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:31,000 INFO L290 TraceCheckUtils]: 35: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:31,000 INFO L290 TraceCheckUtils]: 36: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:31,000 INFO L290 TraceCheckUtils]: 37: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:31,000 INFO L290 TraceCheckUtils]: 38: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:31,000 INFO L290 TraceCheckUtils]: 39: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:31,000 INFO L290 TraceCheckUtils]: 40: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:31,000 INFO L290 TraceCheckUtils]: 41: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:31,000 INFO L290 TraceCheckUtils]: 42: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-08 10:11:31,000 INFO L290 TraceCheckUtils]: 43: Hoare triple {144941#false} assume !(~y~0 % 4294967296 > 0); {144941#false} is VALID [2022-04-08 10:11:31,000 INFO L272 TraceCheckUtils]: 44: Hoare triple {144941#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {144941#false} is VALID [2022-04-08 10:11:31,001 INFO L290 TraceCheckUtils]: 45: Hoare triple {144941#false} ~cond := #in~cond; {144941#false} is VALID [2022-04-08 10:11:31,001 INFO L290 TraceCheckUtils]: 46: Hoare triple {144941#false} assume 0 == ~cond; {144941#false} is VALID [2022-04-08 10:11:31,001 INFO L290 TraceCheckUtils]: 47: Hoare triple {144941#false} assume !false; {144941#false} is VALID [2022-04-08 10:11:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:11:31,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:32,059 INFO L290 TraceCheckUtils]: 47: Hoare triple {144941#false} assume !false; {144941#false} is VALID [2022-04-08 10:11:32,059 INFO L290 TraceCheckUtils]: 46: Hoare triple {144941#false} assume 0 == ~cond; {144941#false} is VALID [2022-04-08 10:11:32,060 INFO L290 TraceCheckUtils]: 45: Hoare triple {144941#false} ~cond := #in~cond; {144941#false} is VALID [2022-04-08 10:11:32,060 INFO L272 TraceCheckUtils]: 44: Hoare triple {144941#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {144941#false} is VALID [2022-04-08 10:11:32,060 INFO L290 TraceCheckUtils]: 43: Hoare triple {145138#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {144941#false} is VALID [2022-04-08 10:11:32,061 INFO L290 TraceCheckUtils]: 42: Hoare triple {145142#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145138#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:32,062 INFO L290 TraceCheckUtils]: 41: Hoare triple {145146#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145142#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:32,062 INFO L290 TraceCheckUtils]: 40: Hoare triple {145150#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145146#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:32,063 INFO L290 TraceCheckUtils]: 39: Hoare triple {145154#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145150#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:11:32,063 INFO L290 TraceCheckUtils]: 38: Hoare triple {145158#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145154#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:32,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {145162#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145158#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:32,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {145166#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145162#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:32,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {145170#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145166#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:11:32,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {145174#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145170#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:32,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {145178#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145174#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:11:32,068 INFO L290 TraceCheckUtils]: 32: Hoare triple {145182#(< 0 (mod (+ main_~y~0 4294967285) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145178#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} is VALID [2022-04-08 10:11:32,068 INFO L290 TraceCheckUtils]: 31: Hoare triple {145182#(< 0 (mod (+ main_~y~0 4294967285) 4294967296))} assume !(~z~0 % 4294967296 > 0); {145182#(< 0 (mod (+ main_~y~0 4294967285) 4294967296))} is VALID [2022-04-08 10:11:32,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {145189#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145182#(< 0 (mod (+ main_~y~0 4294967285) 4294967296))} is VALID [2022-04-08 10:11:32,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {145193#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967285) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145189#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-08 10:11:32,070 INFO L290 TraceCheckUtils]: 28: Hoare triple {145197#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145193#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967285) 4294967296)))} is VALID [2022-04-08 10:11:32,071 INFO L290 TraceCheckUtils]: 27: Hoare triple {145201#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145197#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:11:32,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {145205#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145201#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-08 10:11:32,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {145209#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145205#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:11:32,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {145213#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145209#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:11:32,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {145217#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145213#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:11:32,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {145221#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145217#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-08 10:11:32,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {145225#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145221#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:11:32,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {145229#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967286) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145225#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))))} is VALID [2022-04-08 10:11:32,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {145233#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967285) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145229#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967286) 4294967296))))} is VALID [2022-04-08 10:11:32,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {144940#true} ~z~0 := ~y~0; {145233#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967285) 4294967296))))} is VALID [2022-04-08 10:11:32,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {144940#true} assume !(~x~0 % 4294967296 > 0); {144940#true} is VALID [2022-04-08 10:11:32,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {144940#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144940#true} is VALID [2022-04-08 10:11:32,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {144940#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144940#true} is VALID [2022-04-08 10:11:32,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {144940#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144940#true} is VALID [2022-04-08 10:11:32,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {144940#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144940#true} is VALID [2022-04-08 10:11:32,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {144940#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144940#true} is VALID [2022-04-08 10:11:32,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {144940#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144940#true} is VALID [2022-04-08 10:11:32,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {144940#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144940#true} is VALID [2022-04-08 10:11:32,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {144940#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144940#true} is VALID [2022-04-08 10:11:32,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {144940#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144940#true} is VALID [2022-04-08 10:11:32,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {144940#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144940#true} is VALID [2022-04-08 10:11:32,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {144940#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144940#true} is VALID [2022-04-08 10:11:32,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {144940#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {144940#true} is VALID [2022-04-08 10:11:32,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {144940#true} call #t~ret11 := main(); {144940#true} is VALID [2022-04-08 10:11:32,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144940#true} {144940#true} #61#return; {144940#true} is VALID [2022-04-08 10:11:32,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {144940#true} assume true; {144940#true} is VALID [2022-04-08 10:11:32,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {144940#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {144940#true} is VALID [2022-04-08 10:11:32,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {144940#true} call ULTIMATE.init(); {144940#true} is VALID [2022-04-08 10:11:32,080 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 10:11:32,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113900818] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:32,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:32,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 63 [2022-04-08 10:11:32,080 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:32,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [568198400] [2022-04-08 10:11:32,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [568198400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:32,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:32,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-08 10:11:32,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226509426] [2022-04-08 10:11:32,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:32,080 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-08 10:11:32,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:32,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:32,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:32,106 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-08 10:11:32,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:32,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-08 10:11:32,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=3327, Unknown=0, NotChecked=0, Total=3906 [2022-04-08 10:11:32,106 INFO L87 Difference]: Start difference. First operand 221 states and 284 transitions. Second operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:34,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:34,602 INFO L93 Difference]: Finished difference Result 238 states and 300 transitions. [2022-04-08 10:11:34,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 10:11:34,602 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-08 10:11:34,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 51 transitions. [2022-04-08 10:11:34,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 51 transitions. [2022-04-08 10:11:34,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 51 transitions. [2022-04-08 10:11:34,640 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-08 10:11:34,642 INFO L225 Difference]: With dead ends: 238 [2022-04-08 10:11:34,642 INFO L226 Difference]: Without dead ends: 207 [2022-04-08 10:11:34,643 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1119, Invalid=6363, Unknown=0, NotChecked=0, Total=7482 [2022-04-08 10:11:34,643 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:34,643 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 136 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:11:34,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-08 10:11:35,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-04-08 10:11:35,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:35,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 207 states, 202 states have (on average 1.306930693069307) internal successors, (264), 202 states have internal predecessors, (264), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:35,418 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 207 states, 202 states have (on average 1.306930693069307) internal successors, (264), 202 states have internal predecessors, (264), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:35,418 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 207 states, 202 states have (on average 1.306930693069307) internal successors, (264), 202 states have internal predecessors, (264), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:35,421 INFO L93 Difference]: Finished difference Result 207 states and 268 transitions. [2022-04-08 10:11:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 268 transitions. [2022-04-08 10:11:35,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:35,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:35,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 202 states have (on average 1.306930693069307) internal successors, (264), 202 states have internal predecessors, (264), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 207 states. [2022-04-08 10:11:35,422 INFO L87 Difference]: Start difference. First operand has 207 states, 202 states have (on average 1.306930693069307) internal successors, (264), 202 states have internal predecessors, (264), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 207 states. [2022-04-08 10:11:35,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:35,425 INFO L93 Difference]: Finished difference Result 207 states and 268 transitions. [2022-04-08 10:11:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 268 transitions. [2022-04-08 10:11:35,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:35,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:35,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:35,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:35,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.306930693069307) internal successors, (264), 202 states have internal predecessors, (264), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 268 transitions. [2022-04-08 10:11:35,430 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 268 transitions. Word has length 48 [2022-04-08 10:11:35,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:35,430 INFO L478 AbstractCegarLoop]: Abstraction has 207 states and 268 transitions. [2022-04-08 10:11:35,430 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:35,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 268 transitions. [2022-04-08 10:11:36,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:36,146 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 268 transitions. [2022-04-08 10:11:36,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 10:11:36,147 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:36,147 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:36,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Ended with exit code 0 [2022-04-08 10:11:36,347 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,120 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:36,347 INFO L403 AbstractCegarLoop]: === Iteration 123 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:36,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:36,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1707131277, now seen corresponding path program 235 times [2022-04-08 10:11:36,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:36,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1087202258] [2022-04-08 10:11:36,350 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:36,350 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:36,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1707131277, now seen corresponding path program 236 times [2022-04-08 10:11:36,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:36,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768752492] [2022-04-08 10:11:36,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:36,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:36,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:36,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {146674#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {146645#true} is VALID [2022-04-08 10:11:36,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {146645#true} assume true; {146645#true} is VALID [2022-04-08 10:11:36,778 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {146645#true} {146645#true} #61#return; {146645#true} is VALID [2022-04-08 10:11:36,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {146645#true} call ULTIMATE.init(); {146674#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:36,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {146674#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {146645#true} is VALID [2022-04-08 10:11:36,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {146645#true} assume true; {146645#true} is VALID [2022-04-08 10:11:36,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146645#true} {146645#true} #61#return; {146645#true} is VALID [2022-04-08 10:11:36,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {146645#true} call #t~ret11 := main(); {146645#true} is VALID [2022-04-08 10:11:36,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {146645#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {146650#(= main_~y~0 0)} is VALID [2022-04-08 10:11:36,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {146650#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146651#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:36,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {146651#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146652#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:36,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {146652#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146653#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:36,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {146653#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146654#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:36,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {146654#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146655#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:36,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {146655#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146656#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:36,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {146656#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146657#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:36,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {146657#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146658#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:36,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {146658#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146659#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:36,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {146659#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146660#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:36,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {146660#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146661#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:36,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {146661#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146662#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:36,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {146662#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {146662#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:36,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {146662#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {146663#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:11:36,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {146663#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146664#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:11:36,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {146664#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146665#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:11:36,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {146665#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146666#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:11:36,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {146666#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146667#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:11:36,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {146667#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146668#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:11:36,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {146668#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146669#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:11:36,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {146669#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146670#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:11:36,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {146670#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146671#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:11:36,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {146671#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146672#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:11:36,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {146672#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146673#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:11:36,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {146673#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {146646#false} is VALID [2022-04-08 10:11:36,791 INFO L290 TraceCheckUtils]: 31: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:36,791 INFO L290 TraceCheckUtils]: 32: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:36,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:36,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:36,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:36,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:36,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:36,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:36,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:36,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:36,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:36,792 INFO L290 TraceCheckUtils]: 42: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:36,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {146646#false} assume !(~y~0 % 4294967296 > 0); {146646#false} is VALID [2022-04-08 10:11:36,792 INFO L272 TraceCheckUtils]: 44: Hoare triple {146646#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {146646#false} is VALID [2022-04-08 10:11:36,792 INFO L290 TraceCheckUtils]: 45: Hoare triple {146646#false} ~cond := #in~cond; {146646#false} is VALID [2022-04-08 10:11:36,792 INFO L290 TraceCheckUtils]: 46: Hoare triple {146646#false} assume 0 == ~cond; {146646#false} is VALID [2022-04-08 10:11:36,792 INFO L290 TraceCheckUtils]: 47: Hoare triple {146646#false} assume !false; {146646#false} is VALID [2022-04-08 10:11:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:11:36,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:36,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768752492] [2022-04-08 10:11:36,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768752492] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:36,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128385660] [2022-04-08 10:11:36,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:11:36,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:36,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:36,793 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:36,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2022-04-08 10:11:36,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:11:36,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:36,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 70 conjunts are in the unsatisfiable core [2022-04-08 10:11:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:36,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:37,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {146645#true} call ULTIMATE.init(); {146645#true} is VALID [2022-04-08 10:11:37,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {146645#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {146645#true} is VALID [2022-04-08 10:11:37,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {146645#true} assume true; {146645#true} is VALID [2022-04-08 10:11:37,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146645#true} {146645#true} #61#return; {146645#true} is VALID [2022-04-08 10:11:37,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {146645#true} call #t~ret11 := main(); {146645#true} is VALID [2022-04-08 10:11:37,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {146645#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {146650#(= main_~y~0 0)} is VALID [2022-04-08 10:11:37,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {146650#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146651#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:37,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {146651#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146652#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:37,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {146652#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146653#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:37,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {146653#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146654#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:37,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {146654#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146655#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:37,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {146655#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146656#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:37,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {146656#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146657#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:37,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {146657#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146658#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:37,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {146658#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146659#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:37,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {146659#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146660#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:37,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {146660#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146661#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:37,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {146661#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146662#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:37,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {146662#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {146662#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:37,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {146662#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {146735#(and (<= 12 main_~y~0) (= main_~z~0 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:37,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {146735#(and (<= 12 main_~y~0) (= main_~z~0 main_~y~0) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146739#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:11:37,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {146739#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146743#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:11:37,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {146743#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146747#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:37,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {146747#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146751#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:37,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {146751#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146755#(and (<= 12 main_~y~0) (= (+ (- 1) main_~y~0) (+ main_~z~0 4)) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:37,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {146755#(and (<= 12 main_~y~0) (= (+ (- 1) main_~y~0) (+ main_~z~0 4)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146759#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:37,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {146759#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146763#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:37,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {146763#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146767#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:37,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {146767#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146771#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:37,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {146771#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146775#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ (- 9) main_~y~0) (+ main_~z~0 1)))} is VALID [2022-04-08 10:11:37,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {146775#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ (- 9) main_~y~0) (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {146646#false} is VALID [2022-04-08 10:11:37,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:37,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:37,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:37,435 INFO L290 TraceCheckUtils]: 34: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:37,435 INFO L290 TraceCheckUtils]: 35: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:37,435 INFO L290 TraceCheckUtils]: 36: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:37,435 INFO L290 TraceCheckUtils]: 37: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:37,435 INFO L290 TraceCheckUtils]: 38: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:37,435 INFO L290 TraceCheckUtils]: 39: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:37,435 INFO L290 TraceCheckUtils]: 40: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:37,435 INFO L290 TraceCheckUtils]: 41: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:37,435 INFO L290 TraceCheckUtils]: 42: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:37,436 INFO L290 TraceCheckUtils]: 43: Hoare triple {146646#false} assume !(~y~0 % 4294967296 > 0); {146646#false} is VALID [2022-04-08 10:11:37,436 INFO L272 TraceCheckUtils]: 44: Hoare triple {146646#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {146646#false} is VALID [2022-04-08 10:11:37,436 INFO L290 TraceCheckUtils]: 45: Hoare triple {146646#false} ~cond := #in~cond; {146646#false} is VALID [2022-04-08 10:11:37,436 INFO L290 TraceCheckUtils]: 46: Hoare triple {146646#false} assume 0 == ~cond; {146646#false} is VALID [2022-04-08 10:11:37,436 INFO L290 TraceCheckUtils]: 47: Hoare triple {146646#false} assume !false; {146646#false} is VALID [2022-04-08 10:11:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:11:37,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:38,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {146646#false} assume !false; {146646#false} is VALID [2022-04-08 10:11:38,392 INFO L290 TraceCheckUtils]: 46: Hoare triple {146646#false} assume 0 == ~cond; {146646#false} is VALID [2022-04-08 10:11:38,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {146646#false} ~cond := #in~cond; {146646#false} is VALID [2022-04-08 10:11:38,392 INFO L272 TraceCheckUtils]: 44: Hoare triple {146646#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {146646#false} is VALID [2022-04-08 10:11:38,392 INFO L290 TraceCheckUtils]: 43: Hoare triple {146646#false} assume !(~y~0 % 4294967296 > 0); {146646#false} is VALID [2022-04-08 10:11:38,392 INFO L290 TraceCheckUtils]: 42: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:38,392 INFO L290 TraceCheckUtils]: 41: Hoare triple {146848#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-08 10:11:38,393 INFO L290 TraceCheckUtils]: 40: Hoare triple {146852#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146848#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:11:38,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {146856#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146852#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:11:38,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {146860#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146856#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:11:38,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {146864#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146860#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:11:38,396 INFO L290 TraceCheckUtils]: 36: Hoare triple {146868#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146864#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:11:38,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {146872#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146868#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:11:38,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {146876#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146872#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:11:38,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {146880#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146876#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:11:38,399 INFO L290 TraceCheckUtils]: 32: Hoare triple {146884#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146880#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:11:38,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {146888#(not (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146884#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} is VALID [2022-04-08 10:11:38,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {146892#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {146888#(not (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-08 10:11:38,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {146896#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146892#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-08 10:11:38,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {146900#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146896#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:11:38,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {146904#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146900#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-08 10:11:38,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {146908#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146904#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:11:38,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {146912#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146908#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-08 10:11:38,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {146916#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146912#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-08 10:11:38,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {146920#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146916#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:11:38,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {146924#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146920#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:11:38,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {146928#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146924#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:11:38,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {146932#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146928#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-08 10:11:38,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {146645#true} ~z~0 := ~y~0; {146932#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} is VALID [2022-04-08 10:11:38,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {146645#true} assume !(~x~0 % 4294967296 > 0); {146645#true} is VALID [2022-04-08 10:11:38,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {146645#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146645#true} is VALID [2022-04-08 10:11:38,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {146645#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146645#true} is VALID [2022-04-08 10:11:38,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {146645#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146645#true} is VALID [2022-04-08 10:11:38,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {146645#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146645#true} is VALID [2022-04-08 10:11:38,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {146645#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146645#true} is VALID [2022-04-08 10:11:38,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {146645#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146645#true} is VALID [2022-04-08 10:11:38,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {146645#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146645#true} is VALID [2022-04-08 10:11:38,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {146645#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146645#true} is VALID [2022-04-08 10:11:38,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {146645#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146645#true} is VALID [2022-04-08 10:11:38,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {146645#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146645#true} is VALID [2022-04-08 10:11:38,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {146645#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146645#true} is VALID [2022-04-08 10:11:38,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {146645#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146645#true} is VALID [2022-04-08 10:11:38,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {146645#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {146645#true} is VALID [2022-04-08 10:11:38,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {146645#true} call #t~ret11 := main(); {146645#true} is VALID [2022-04-08 10:11:38,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146645#true} {146645#true} #61#return; {146645#true} is VALID [2022-04-08 10:11:38,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {146645#true} assume true; {146645#true} is VALID [2022-04-08 10:11:38,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {146645#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {146645#true} is VALID [2022-04-08 10:11:38,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {146645#true} call ULTIMATE.init(); {146645#true} is VALID [2022-04-08 10:11:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 22 proven. 110 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-04-08 10:11:38,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128385660] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:38,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:38,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 24] total 60 [2022-04-08 10:11:38,410 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:38,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1087202258] [2022-04-08 10:11:38,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1087202258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:38,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:38,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-08 10:11:38,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181088322] [2022-04-08 10:11:38,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:38,410 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-08 10:11:38,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:38,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:38,435 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-08 10:11:38,435 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-08 10:11:38,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:38,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-08 10:11:38,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=3132, Unknown=0, NotChecked=0, Total=3540 [2022-04-08 10:11:38,436 INFO L87 Difference]: Start difference. First operand 207 states and 268 transitions. Second operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:41,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:41,096 INFO L93 Difference]: Finished difference Result 240 states and 301 transitions. [2022-04-08 10:11:41,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 10:11:41,096 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-08 10:11:41,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:41,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 66 transitions. [2022-04-08 10:11:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 66 transitions. [2022-04-08 10:11:41,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 66 transitions. [2022-04-08 10:11:41,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:41,153 INFO L225 Difference]: With dead ends: 240 [2022-04-08 10:11:41,153 INFO L226 Difference]: Without dead ends: 222 [2022-04-08 10:11:41,153 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=682, Invalid=6290, Unknown=0, NotChecked=0, Total=6972 [2022-04-08 10:11:41,153 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:41,153 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 93 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:11:41,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-08 10:11:41,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 208. [2022-04-08 10:11:41,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:41,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 208 states, 203 states have (on average 1.3054187192118227) internal successors, (265), 203 states have internal predecessors, (265), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:41,930 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 208 states, 203 states have (on average 1.3054187192118227) internal successors, (265), 203 states have internal predecessors, (265), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:41,931 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 208 states, 203 states have (on average 1.3054187192118227) internal successors, (265), 203 states have internal predecessors, (265), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:41,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:41,933 INFO L93 Difference]: Finished difference Result 222 states and 283 transitions. [2022-04-08 10:11:41,933 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 283 transitions. [2022-04-08 10:11:41,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:41,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:41,933 INFO L74 IsIncluded]: Start isIncluded. First operand has 208 states, 203 states have (on average 1.3054187192118227) internal successors, (265), 203 states have internal predecessors, (265), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-08 10:11:41,933 INFO L87 Difference]: Start difference. First operand has 208 states, 203 states have (on average 1.3054187192118227) internal successors, (265), 203 states have internal predecessors, (265), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-08 10:11:41,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:41,936 INFO L93 Difference]: Finished difference Result 222 states and 283 transitions. [2022-04-08 10:11:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 283 transitions. [2022-04-08 10:11:41,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:41,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:41,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:41,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:41,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 203 states have (on average 1.3054187192118227) internal successors, (265), 203 states have internal predecessors, (265), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:41,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 269 transitions. [2022-04-08 10:11:41,938 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 269 transitions. Word has length 48 [2022-04-08 10:11:41,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:41,939 INFO L478 AbstractCegarLoop]: Abstraction has 208 states and 269 transitions. [2022-04-08 10:11:41,939 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:41,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 208 states and 269 transitions. [2022-04-08 10:11:42,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 269 transitions. [2022-04-08 10:11:42,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 10:11:42,632 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:42,632 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:42,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:42,833 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 121 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122 [2022-04-08 10:11:42,833 INFO L403 AbstractCegarLoop]: === Iteration 124 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:42,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:42,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1475687295, now seen corresponding path program 237 times [2022-04-08 10:11:42,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:42,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [947834018] [2022-04-08 10:11:42,835 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:42,835 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:42,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1475687295, now seen corresponding path program 238 times [2022-04-08 10:11:42,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:42,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98728023] [2022-04-08 10:11:42,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:42,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:43,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:43,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {148411#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {148383#true} is VALID [2022-04-08 10:11:43,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {148383#true} assume true; {148383#true} is VALID [2022-04-08 10:11:43,239 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {148383#true} {148383#true} #61#return; {148383#true} is VALID [2022-04-08 10:11:43,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {148383#true} call ULTIMATE.init(); {148411#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:43,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {148411#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {148383#true} is VALID [2022-04-08 10:11:43,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {148383#true} assume true; {148383#true} is VALID [2022-04-08 10:11:43,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {148383#true} {148383#true} #61#return; {148383#true} is VALID [2022-04-08 10:11:43,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {148383#true} call #t~ret11 := main(); {148383#true} is VALID [2022-04-08 10:11:43,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {148383#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {148388#(= main_~y~0 0)} is VALID [2022-04-08 10:11:43,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {148388#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148389#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:43,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {148389#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148390#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:43,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {148390#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148391#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:43,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {148391#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148392#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:43,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {148392#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148393#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:43,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {148393#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148394#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:43,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {148394#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148395#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:43,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {148395#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148396#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:43,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {148396#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148397#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:43,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {148397#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148398#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:43,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {148398#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148399#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:43,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {148399#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148400#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:43,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {148400#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148401#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:43,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {148401#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {148401#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:43,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {148401#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {148402#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:11:43,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {148402#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148403#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:11:43,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {148403#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148404#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:11:43,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {148404#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148405#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:11:43,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {148405#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148406#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:11:43,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {148406#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148407#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:11:43,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {148407#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148408#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:11:43,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {148408#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148409#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:11:43,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {148409#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148410#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:11:43,252 INFO L290 TraceCheckUtils]: 29: Hoare triple {148410#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {148384#false} is VALID [2022-04-08 10:11:43,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,252 INFO L290 TraceCheckUtils]: 31: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,252 INFO L290 TraceCheckUtils]: 32: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,252 INFO L290 TraceCheckUtils]: 33: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,252 INFO L290 TraceCheckUtils]: 34: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,252 INFO L290 TraceCheckUtils]: 35: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,252 INFO L290 TraceCheckUtils]: 36: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,252 INFO L290 TraceCheckUtils]: 37: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,253 INFO L290 TraceCheckUtils]: 41: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,253 INFO L290 TraceCheckUtils]: 42: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,253 INFO L290 TraceCheckUtils]: 43: Hoare triple {148384#false} assume !(~y~0 % 4294967296 > 0); {148384#false} is VALID [2022-04-08 10:11:43,253 INFO L272 TraceCheckUtils]: 44: Hoare triple {148384#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {148384#false} is VALID [2022-04-08 10:11:43,253 INFO L290 TraceCheckUtils]: 45: Hoare triple {148384#false} ~cond := #in~cond; {148384#false} is VALID [2022-04-08 10:11:43,253 INFO L290 TraceCheckUtils]: 46: Hoare triple {148384#false} assume 0 == ~cond; {148384#false} is VALID [2022-04-08 10:11:43,253 INFO L290 TraceCheckUtils]: 47: Hoare triple {148384#false} assume !false; {148384#false} is VALID [2022-04-08 10:11:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:11:43,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:43,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98728023] [2022-04-08 10:11:43,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98728023] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:43,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897140565] [2022-04-08 10:11:43,253 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:11:43,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:43,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:43,254 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:43,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2022-04-08 10:11:43,307 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:11:43,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:43,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 10:11:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:43,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:43,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {148383#true} call ULTIMATE.init(); {148383#true} is VALID [2022-04-08 10:11:43,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {148383#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {148383#true} is VALID [2022-04-08 10:11:43,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {148383#true} assume true; {148383#true} is VALID [2022-04-08 10:11:43,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {148383#true} {148383#true} #61#return; {148383#true} is VALID [2022-04-08 10:11:43,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {148383#true} call #t~ret11 := main(); {148383#true} is VALID [2022-04-08 10:11:43,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {148383#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {148388#(= main_~y~0 0)} is VALID [2022-04-08 10:11:43,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {148388#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148389#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:43,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {148389#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148390#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:43,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {148390#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148391#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:43,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {148391#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148392#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:43,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {148392#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148393#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:43,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {148393#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148394#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:43,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {148394#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148395#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:43,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {148395#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148396#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:43,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {148396#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148397#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:43,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {148397#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148398#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:43,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {148398#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148399#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:43,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {148399#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148400#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:43,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {148400#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148401#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:43,669 INFO L290 TraceCheckUtils]: 19: Hoare triple {148401#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {148401#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:43,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {148401#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {148402#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:11:43,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {148402#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148403#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:11:43,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {148403#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148404#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:11:43,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {148404#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148405#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:11:43,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {148405#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148406#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:11:43,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {148406#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148407#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:11:43,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {148407#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148408#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:11:43,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {148408#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148409#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:11:43,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {148409#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148499#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:11:43,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {148499#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {148384#false} is VALID [2022-04-08 10:11:43,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,674 INFO L290 TraceCheckUtils]: 35: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,674 INFO L290 TraceCheckUtils]: 36: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,674 INFO L290 TraceCheckUtils]: 37: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,674 INFO L290 TraceCheckUtils]: 38: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,674 INFO L290 TraceCheckUtils]: 39: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,674 INFO L290 TraceCheckUtils]: 40: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,674 INFO L290 TraceCheckUtils]: 41: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:43,675 INFO L290 TraceCheckUtils]: 43: Hoare triple {148384#false} assume !(~y~0 % 4294967296 > 0); {148384#false} is VALID [2022-04-08 10:11:43,675 INFO L272 TraceCheckUtils]: 44: Hoare triple {148384#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {148384#false} is VALID [2022-04-08 10:11:43,675 INFO L290 TraceCheckUtils]: 45: Hoare triple {148384#false} ~cond := #in~cond; {148384#false} is VALID [2022-04-08 10:11:43,675 INFO L290 TraceCheckUtils]: 46: Hoare triple {148384#false} assume 0 == ~cond; {148384#false} is VALID [2022-04-08 10:11:43,675 INFO L290 TraceCheckUtils]: 47: Hoare triple {148384#false} assume !false; {148384#false} is VALID [2022-04-08 10:11:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:11:43,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:44,477 INFO L290 TraceCheckUtils]: 47: Hoare triple {148384#false} assume !false; {148384#false} is VALID [2022-04-08 10:11:44,477 INFO L290 TraceCheckUtils]: 46: Hoare triple {148384#false} assume 0 == ~cond; {148384#false} is VALID [2022-04-08 10:11:44,477 INFO L290 TraceCheckUtils]: 45: Hoare triple {148384#false} ~cond := #in~cond; {148384#false} is VALID [2022-04-08 10:11:44,477 INFO L272 TraceCheckUtils]: 44: Hoare triple {148384#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {148384#false} is VALID [2022-04-08 10:11:44,477 INFO L290 TraceCheckUtils]: 43: Hoare triple {148384#false} assume !(~y~0 % 4294967296 > 0); {148384#false} is VALID [2022-04-08 10:11:44,477 INFO L290 TraceCheckUtils]: 42: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:44,477 INFO L290 TraceCheckUtils]: 41: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:44,477 INFO L290 TraceCheckUtils]: 40: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:44,477 INFO L290 TraceCheckUtils]: 39: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:44,477 INFO L290 TraceCheckUtils]: 38: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:44,477 INFO L290 TraceCheckUtils]: 37: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:44,477 INFO L290 TraceCheckUtils]: 36: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:44,478 INFO L290 TraceCheckUtils]: 35: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:44,478 INFO L290 TraceCheckUtils]: 34: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:44,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:44,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:44,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:44,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-08 10:11:44,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {148611#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {148384#false} is VALID [2022-04-08 10:11:44,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {148615#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148611#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:44,480 INFO L290 TraceCheckUtils]: 27: Hoare triple {148619#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148615#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:44,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {148623#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148619#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:44,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {148627#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148623#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:11:44,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {148631#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148627#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:11:44,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {148635#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148631#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:11:44,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {148639#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148635#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:11:44,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {148643#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148639#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:11:44,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {148647#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} ~z~0 := ~y~0; {148643#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-08 10:11:44,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {148647#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {148647#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:44,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {148654#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148647#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:44,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {148658#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148654#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:11:44,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {148662#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148658#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:44,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {148666#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148662#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:44,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {148670#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148666#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:44,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {148674#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148670#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:11:44,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {148678#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148674#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:44,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {148682#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148678#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:44,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {148686#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148682#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:44,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {148690#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148686#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:11:44,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {148694#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148690#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:11:44,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {148698#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148694#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:11:44,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {148702#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {148698#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:11:44,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {148383#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {148702#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:44,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {148383#true} call #t~ret11 := main(); {148383#true} is VALID [2022-04-08 10:11:44,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {148383#true} {148383#true} #61#return; {148383#true} is VALID [2022-04-08 10:11:44,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {148383#true} assume true; {148383#true} is VALID [2022-04-08 10:11:44,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {148383#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {148383#true} is VALID [2022-04-08 10:11:44,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {148383#true} call ULTIMATE.init(); {148383#true} is VALID [2022-04-08 10:11:44,493 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:11:44,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897140565] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:44,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:44,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-08 10:11:44,494 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:44,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [947834018] [2022-04-08 10:11:44,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [947834018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:44,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:44,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 10:11:44,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809103072] [2022-04-08 10:11:44,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:44,494 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-08 10:11:44,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:44,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:44,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:44,518 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 10:11:44,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:44,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 10:11:44,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=2075, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:11:44,519 INFO L87 Difference]: Start difference. First operand 208 states and 269 transitions. Second operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:47,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:47,731 INFO L93 Difference]: Finished difference Result 243 states and 304 transitions. [2022-04-08 10:11:47,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 10:11:47,731 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-08 10:11:47,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:47,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:47,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 78 transitions. [2022-04-08 10:11:47,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:47,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 78 transitions. [2022-04-08 10:11:47,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 78 transitions. [2022-04-08 10:11:47,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:47,798 INFO L225 Difference]: With dead ends: 243 [2022-04-08 10:11:47,798 INFO L226 Difference]: Without dead ends: 224 [2022-04-08 10:11:47,799 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1127, Invalid=5353, Unknown=0, NotChecked=0, Total=6480 [2022-04-08 10:11:47,799 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:47,799 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 120 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:11:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-04-08 10:11:48,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 209. [2022-04-08 10:11:48,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:48,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 224 states. Second operand has 209 states, 204 states have (on average 1.303921568627451) internal successors, (266), 204 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:48,576 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand has 209 states, 204 states have (on average 1.303921568627451) internal successors, (266), 204 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:48,576 INFO L87 Difference]: Start difference. First operand 224 states. Second operand has 209 states, 204 states have (on average 1.303921568627451) internal successors, (266), 204 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:48,578 INFO L93 Difference]: Finished difference Result 224 states and 285 transitions. [2022-04-08 10:11:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 285 transitions. [2022-04-08 10:11:48,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:48,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:48,579 INFO L74 IsIncluded]: Start isIncluded. First operand has 209 states, 204 states have (on average 1.303921568627451) internal successors, (266), 204 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 224 states. [2022-04-08 10:11:48,579 INFO L87 Difference]: Start difference. First operand has 209 states, 204 states have (on average 1.303921568627451) internal successors, (266), 204 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 224 states. [2022-04-08 10:11:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:48,583 INFO L93 Difference]: Finished difference Result 224 states and 285 transitions. [2022-04-08 10:11:48,583 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 285 transitions. [2022-04-08 10:11:48,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:48,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:48,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:48,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:48,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 204 states have (on average 1.303921568627451) internal successors, (266), 204 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:48,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 270 transitions. [2022-04-08 10:11:48,587 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 270 transitions. Word has length 48 [2022-04-08 10:11:48,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:48,587 INFO L478 AbstractCegarLoop]: Abstraction has 209 states and 270 transitions. [2022-04-08 10:11:48,588 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:48,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 209 states and 270 transitions. [2022-04-08 10:11:49,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:49,311 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 270 transitions. [2022-04-08 10:11:49,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 10:11:49,312 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:49,312 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:49,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Ended with exit code 0 [2022-04-08 10:11:49,523 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 122 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable123 [2022-04-08 10:11:49,523 INFO L403 AbstractCegarLoop]: === Iteration 125 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:49,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:49,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1539800179, now seen corresponding path program 239 times [2022-04-08 10:11:49,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:49,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1451849681] [2022-04-08 10:11:49,526 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:49,526 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:49,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1539800179, now seen corresponding path program 240 times [2022-04-08 10:11:49,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:49,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378583624] [2022-04-08 10:11:49,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:49,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:49,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:49,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {150164#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {150137#true} is VALID [2022-04-08 10:11:49,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {150137#true} assume true; {150137#true} is VALID [2022-04-08 10:11:49,903 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {150137#true} {150137#true} #61#return; {150137#true} is VALID [2022-04-08 10:11:49,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {150137#true} call ULTIMATE.init(); {150164#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:49,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {150164#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {150137#true} is VALID [2022-04-08 10:11:49,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {150137#true} assume true; {150137#true} is VALID [2022-04-08 10:11:49,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150137#true} {150137#true} #61#return; {150137#true} is VALID [2022-04-08 10:11:49,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {150137#true} call #t~ret11 := main(); {150137#true} is VALID [2022-04-08 10:11:49,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {150137#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {150142#(= main_~y~0 0)} is VALID [2022-04-08 10:11:49,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {150142#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150143#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:49,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {150143#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150144#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:49,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {150144#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150145#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:49,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {150145#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150146#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:49,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {150146#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150147#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:49,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {150147#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150148#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:49,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {150148#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150149#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:49,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {150149#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150150#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:49,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {150150#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150151#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:49,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {150151#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150152#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:49,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {150152#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150153#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:49,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {150153#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150154#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:49,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {150154#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150155#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:49,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {150155#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150156#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:49,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {150156#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {150156#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:49,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {150156#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {150157#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:11:49,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {150157#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150158#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:11:49,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {150158#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150159#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:11:49,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {150159#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150160#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:11:49,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {150160#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150161#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:11:49,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {150161#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150162#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:11:49,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {150162#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150163#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:11:49,915 INFO L290 TraceCheckUtils]: 28: Hoare triple {150163#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {150138#false} is VALID [2022-04-08 10:11:49,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:49,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:49,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:49,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:49,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:49,915 INFO L290 TraceCheckUtils]: 34: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:49,916 INFO L290 TraceCheckUtils]: 35: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:49,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:49,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:49,916 INFO L290 TraceCheckUtils]: 38: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:49,916 INFO L290 TraceCheckUtils]: 39: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:49,916 INFO L290 TraceCheckUtils]: 40: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:49,916 INFO L290 TraceCheckUtils]: 41: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:49,916 INFO L290 TraceCheckUtils]: 42: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:49,916 INFO L290 TraceCheckUtils]: 43: Hoare triple {150138#false} assume !(~y~0 % 4294967296 > 0); {150138#false} is VALID [2022-04-08 10:11:49,916 INFO L272 TraceCheckUtils]: 44: Hoare triple {150138#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {150138#false} is VALID [2022-04-08 10:11:49,916 INFO L290 TraceCheckUtils]: 45: Hoare triple {150138#false} ~cond := #in~cond; {150138#false} is VALID [2022-04-08 10:11:49,916 INFO L290 TraceCheckUtils]: 46: Hoare triple {150138#false} assume 0 == ~cond; {150138#false} is VALID [2022-04-08 10:11:49,916 INFO L290 TraceCheckUtils]: 47: Hoare triple {150138#false} assume !false; {150138#false} is VALID [2022-04-08 10:11:49,916 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:11:49,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:49,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378583624] [2022-04-08 10:11:49,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378583624] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:49,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838862241] [2022-04-08 10:11:49,917 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:11:49,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:49,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:49,918 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:49,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2022-04-08 10:11:50,532 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 10:11:50,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:50,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:11:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:50,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:50,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {150137#true} call ULTIMATE.init(); {150137#true} is VALID [2022-04-08 10:11:50,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {150137#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {150137#true} is VALID [2022-04-08 10:11:50,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {150137#true} assume true; {150137#true} is VALID [2022-04-08 10:11:50,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150137#true} {150137#true} #61#return; {150137#true} is VALID [2022-04-08 10:11:50,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {150137#true} call #t~ret11 := main(); {150137#true} is VALID [2022-04-08 10:11:50,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {150137#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {150142#(= main_~y~0 0)} is VALID [2022-04-08 10:11:50,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {150142#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150143#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:50,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {150143#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150144#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:50,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {150144#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150145#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:50,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {150145#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150146#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:50,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {150146#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150147#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:50,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {150147#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150148#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:50,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {150148#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150149#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:50,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {150149#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150150#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:50,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {150150#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150151#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:50,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {150151#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150152#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:50,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {150152#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150153#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:50,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {150153#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150154#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:50,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {150154#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150155#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:50,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {150155#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150156#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:50,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {150156#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {150156#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:50,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {150156#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {150157#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:11:50,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {150157#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150158#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:11:50,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {150158#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150159#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:11:50,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {150159#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150160#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:11:50,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {150160#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150161#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:11:50,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {150161#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150162#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:11:50,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {150162#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150249#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:11:50,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {150249#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {150138#false} is VALID [2022-04-08 10:11:50,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:50,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:50,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:50,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:50,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:50,894 INFO L290 TraceCheckUtils]: 34: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:50,894 INFO L290 TraceCheckUtils]: 35: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:50,894 INFO L290 TraceCheckUtils]: 36: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:50,894 INFO L290 TraceCheckUtils]: 37: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:50,894 INFO L290 TraceCheckUtils]: 38: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:50,894 INFO L290 TraceCheckUtils]: 39: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:50,894 INFO L290 TraceCheckUtils]: 40: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:50,894 INFO L290 TraceCheckUtils]: 41: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:50,894 INFO L290 TraceCheckUtils]: 42: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:50,895 INFO L290 TraceCheckUtils]: 43: Hoare triple {150138#false} assume !(~y~0 % 4294967296 > 0); {150138#false} is VALID [2022-04-08 10:11:50,895 INFO L272 TraceCheckUtils]: 44: Hoare triple {150138#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {150138#false} is VALID [2022-04-08 10:11:50,895 INFO L290 TraceCheckUtils]: 45: Hoare triple {150138#false} ~cond := #in~cond; {150138#false} is VALID [2022-04-08 10:11:50,895 INFO L290 TraceCheckUtils]: 46: Hoare triple {150138#false} assume 0 == ~cond; {150138#false} is VALID [2022-04-08 10:11:50,895 INFO L290 TraceCheckUtils]: 47: Hoare triple {150138#false} assume !false; {150138#false} is VALID [2022-04-08 10:11:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:11:50,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:51,671 INFO L290 TraceCheckUtils]: 47: Hoare triple {150138#false} assume !false; {150138#false} is VALID [2022-04-08 10:11:51,671 INFO L290 TraceCheckUtils]: 46: Hoare triple {150138#false} assume 0 == ~cond; {150138#false} is VALID [2022-04-08 10:11:51,671 INFO L290 TraceCheckUtils]: 45: Hoare triple {150138#false} ~cond := #in~cond; {150138#false} is VALID [2022-04-08 10:11:51,671 INFO L272 TraceCheckUtils]: 44: Hoare triple {150138#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {150138#false} is VALID [2022-04-08 10:11:51,671 INFO L290 TraceCheckUtils]: 43: Hoare triple {150138#false} assume !(~y~0 % 4294967296 > 0); {150138#false} is VALID [2022-04-08 10:11:51,671 INFO L290 TraceCheckUtils]: 42: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:51,671 INFO L290 TraceCheckUtils]: 41: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:51,671 INFO L290 TraceCheckUtils]: 40: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:51,671 INFO L290 TraceCheckUtils]: 39: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:51,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:51,671 INFO L290 TraceCheckUtils]: 37: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:51,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:51,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:51,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:51,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:51,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:51,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:51,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:51,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-08 10:11:51,672 INFO L290 TraceCheckUtils]: 28: Hoare triple {150367#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {150138#false} is VALID [2022-04-08 10:11:51,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {150371#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150367#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:51,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {150375#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150371#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:51,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {150379#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150375#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:51,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {150383#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150379#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:11:51,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {150387#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150383#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:11:51,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {150391#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150387#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:11:51,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {150395#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {150391#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:11:51,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {150395#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {150395#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:51,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {150402#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150395#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:51,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {150406#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150402#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:51,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {150410#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150406#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:51,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {150414#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150410#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:11:51,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {150418#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150414#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:51,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {150422#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150418#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:51,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {150426#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150422#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:51,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {150430#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150426#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:11:51,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {150434#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150430#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:11:51,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {150438#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150434#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:11:51,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {150442#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150438#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:11:51,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {150446#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150442#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:51,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {150450#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150446#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:11:51,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {150454#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150450#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:51,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {150137#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {150454#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:11:51,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {150137#true} call #t~ret11 := main(); {150137#true} is VALID [2022-04-08 10:11:51,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150137#true} {150137#true} #61#return; {150137#true} is VALID [2022-04-08 10:11:51,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {150137#true} assume true; {150137#true} is VALID [2022-04-08 10:11:51,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {150137#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {150137#true} is VALID [2022-04-08 10:11:51,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {150137#true} call ULTIMATE.init(); {150137#true} is VALID [2022-04-08 10:11:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:11:51,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838862241] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:51,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:51,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-08 10:11:51,687 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:51,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1451849681] [2022-04-08 10:11:51,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1451849681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:51,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:51,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:11:51,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686790276] [2022-04-08 10:11:51,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:51,687 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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 48 [2022-04-08 10:11:51,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:51,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:11:51,711 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-08 10:11:51,711 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:11:51,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:51,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:11:51,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=1882, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:11:51,712 INFO L87 Difference]: Start difference. First operand 209 states and 270 transitions. Second operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:11:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:55,023 INFO L93 Difference]: Finished difference Result 246 states and 307 transitions. [2022-04-08 10:11:55,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-08 10:11:55,023 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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 48 [2022-04-08 10:11:55,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:55,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:11:55,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 85 transitions. [2022-04-08 10:11:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:11:55,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 85 transitions. [2022-04-08 10:11:55,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 85 transitions. [2022-04-08 10:11:55,095 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-08 10:11:55,098 INFO L225 Difference]: With dead ends: 246 [2022-04-08 10:11:55,098 INFO L226 Difference]: Without dead ends: 226 [2022-04-08 10:11:55,098 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1186, Invalid=5294, Unknown=0, NotChecked=0, Total=6480 [2022-04-08 10:11:55,098 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:55,098 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 117 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:11:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-04-08 10:11:55,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 210. [2022-04-08 10:11:55,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:55,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 210 states, 205 states have (on average 1.302439024390244) internal successors, (267), 205 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:55,891 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 210 states, 205 states have (on average 1.302439024390244) internal successors, (267), 205 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:55,891 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 210 states, 205 states have (on average 1.302439024390244) internal successors, (267), 205 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:55,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:55,893 INFO L93 Difference]: Finished difference Result 226 states and 287 transitions. [2022-04-08 10:11:55,893 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 287 transitions. [2022-04-08 10:11:55,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:55,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:55,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 210 states, 205 states have (on average 1.302439024390244) internal successors, (267), 205 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 226 states. [2022-04-08 10:11:55,894 INFO L87 Difference]: Start difference. First operand has 210 states, 205 states have (on average 1.302439024390244) internal successors, (267), 205 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 226 states. [2022-04-08 10:11:55,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:55,896 INFO L93 Difference]: Finished difference Result 226 states and 287 transitions. [2022-04-08 10:11:55,896 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 287 transitions. [2022-04-08 10:11:55,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:55,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:55,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:55,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.302439024390244) internal successors, (267), 205 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 271 transitions. [2022-04-08 10:11:55,899 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 271 transitions. Word has length 48 [2022-04-08 10:11:55,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:55,899 INFO L478 AbstractCegarLoop]: Abstraction has 210 states and 271 transitions. [2022-04-08 10:11:55,899 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:11:55,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 210 states and 271 transitions. [2022-04-08 10:11:56,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:56,602 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 271 transitions. [2022-04-08 10:11:56,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 10:11:56,602 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:56,602 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:56,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:56,802 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124,123 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:56,803 INFO L403 AbstractCegarLoop]: === Iteration 126 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:56,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:56,803 INFO L85 PathProgramCache]: Analyzing trace with hash -950650497, now seen corresponding path program 241 times [2022-04-08 10:11:56,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:56,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [489545895] [2022-04-08 10:11:56,805 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:56,805 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:56,805 INFO L85 PathProgramCache]: Analyzing trace with hash -950650497, now seen corresponding path program 242 times [2022-04-08 10:11:56,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:56,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768783361] [2022-04-08 10:11:56,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:56,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:57,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:57,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {151931#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {151905#true} is VALID [2022-04-08 10:11:57,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {151905#true} assume true; {151905#true} is VALID [2022-04-08 10:11:57,178 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {151905#true} {151905#true} #61#return; {151905#true} is VALID [2022-04-08 10:11:57,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {151905#true} call ULTIMATE.init(); {151931#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:57,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {151931#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {151905#true} is VALID [2022-04-08 10:11:57,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {151905#true} assume true; {151905#true} is VALID [2022-04-08 10:11:57,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151905#true} {151905#true} #61#return; {151905#true} is VALID [2022-04-08 10:11:57,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {151905#true} call #t~ret11 := main(); {151905#true} is VALID [2022-04-08 10:11:57,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {151905#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {151910#(= main_~y~0 0)} is VALID [2022-04-08 10:11:57,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {151910#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151911#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:57,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {151911#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151912#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:57,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {151912#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151913#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:57,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {151913#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151914#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:57,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {151914#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:57,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {151915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151916#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:57,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {151916#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151917#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:57,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {151917#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151918#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:57,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {151918#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151919#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:57,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {151919#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151920#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:57,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {151920#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151921#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:57,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {151921#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151922#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:57,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {151922#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151923#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:57,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {151923#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151924#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:57,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {151924#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151925#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:57,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {151925#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {151925#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:57,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {151925#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {151926#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:11:57,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {151926#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {151927#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:11:57,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {151927#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {151928#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:11:57,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {151928#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {151929#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:11:57,189 INFO L290 TraceCheckUtils]: 26: Hoare triple {151929#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {151930#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-08 10:11:57,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {151930#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {151906#false} is VALID [2022-04-08 10:11:57,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,190 INFO L290 TraceCheckUtils]: 33: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,190 INFO L290 TraceCheckUtils]: 36: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,190 INFO L290 TraceCheckUtils]: 37: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,190 INFO L290 TraceCheckUtils]: 38: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,191 INFO L290 TraceCheckUtils]: 39: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,191 INFO L290 TraceCheckUtils]: 40: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,191 INFO L290 TraceCheckUtils]: 41: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,191 INFO L290 TraceCheckUtils]: 42: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {151906#false} assume !(~y~0 % 4294967296 > 0); {151906#false} is VALID [2022-04-08 10:11:57,191 INFO L272 TraceCheckUtils]: 44: Hoare triple {151906#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {151906#false} is VALID [2022-04-08 10:11:57,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {151906#false} ~cond := #in~cond; {151906#false} is VALID [2022-04-08 10:11:57,191 INFO L290 TraceCheckUtils]: 46: Hoare triple {151906#false} assume 0 == ~cond; {151906#false} is VALID [2022-04-08 10:11:57,191 INFO L290 TraceCheckUtils]: 47: Hoare triple {151906#false} assume !false; {151906#false} is VALID [2022-04-08 10:11:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 10:11:57,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:57,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768783361] [2022-04-08 10:11:57,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768783361] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:57,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803740362] [2022-04-08 10:11:57,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:11:57,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:57,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:57,192 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:57,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2022-04-08 10:11:57,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:11:57,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:57,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:11:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:57,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:57,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {151905#true} call ULTIMATE.init(); {151905#true} is VALID [2022-04-08 10:11:57,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {151905#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {151905#true} is VALID [2022-04-08 10:11:57,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {151905#true} assume true; {151905#true} is VALID [2022-04-08 10:11:57,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151905#true} {151905#true} #61#return; {151905#true} is VALID [2022-04-08 10:11:57,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {151905#true} call #t~ret11 := main(); {151905#true} is VALID [2022-04-08 10:11:57,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {151905#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {151910#(= main_~y~0 0)} is VALID [2022-04-08 10:11:57,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {151910#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151911#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:57,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {151911#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151912#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:57,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {151912#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151913#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:57,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {151913#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151914#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:57,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {151914#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:57,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {151915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151916#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:57,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {151916#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151917#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:57,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {151917#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151918#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:57,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {151918#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151919#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:57,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {151919#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151920#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:57,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {151920#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151921#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:57,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {151921#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151922#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:57,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {151922#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151923#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:57,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {151923#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151924#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:57,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {151924#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151925#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:57,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {151925#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {151925#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:57,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {151925#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {151926#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:11:57,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {151926#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {151927#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:11:57,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {151927#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {151928#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:11:57,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {151928#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {151929#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:11:57,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {151929#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {152013#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:11:57,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {152013#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {151906#false} is VALID [2022-04-08 10:11:57,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,592 INFO L290 TraceCheckUtils]: 32: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,592 INFO L290 TraceCheckUtils]: 38: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,593 INFO L290 TraceCheckUtils]: 40: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,593 INFO L290 TraceCheckUtils]: 42: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:57,593 INFO L290 TraceCheckUtils]: 43: Hoare triple {151906#false} assume !(~y~0 % 4294967296 > 0); {151906#false} is VALID [2022-04-08 10:11:57,593 INFO L272 TraceCheckUtils]: 44: Hoare triple {151906#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {151906#false} is VALID [2022-04-08 10:11:57,593 INFO L290 TraceCheckUtils]: 45: Hoare triple {151906#false} ~cond := #in~cond; {151906#false} is VALID [2022-04-08 10:11:57,593 INFO L290 TraceCheckUtils]: 46: Hoare triple {151906#false} assume 0 == ~cond; {151906#false} is VALID [2022-04-08 10:11:57,593 INFO L290 TraceCheckUtils]: 47: Hoare triple {151906#false} assume !false; {151906#false} is VALID [2022-04-08 10:11:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 10:11:57,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:58,314 INFO L290 TraceCheckUtils]: 47: Hoare triple {151906#false} assume !false; {151906#false} is VALID [2022-04-08 10:11:58,314 INFO L290 TraceCheckUtils]: 46: Hoare triple {151906#false} assume 0 == ~cond; {151906#false} is VALID [2022-04-08 10:11:58,314 INFO L290 TraceCheckUtils]: 45: Hoare triple {151906#false} ~cond := #in~cond; {151906#false} is VALID [2022-04-08 10:11:58,314 INFO L272 TraceCheckUtils]: 44: Hoare triple {151906#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {151906#false} is VALID [2022-04-08 10:11:58,314 INFO L290 TraceCheckUtils]: 43: Hoare triple {151906#false} assume !(~y~0 % 4294967296 > 0); {151906#false} is VALID [2022-04-08 10:11:58,314 INFO L290 TraceCheckUtils]: 42: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:58,314 INFO L290 TraceCheckUtils]: 41: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:58,314 INFO L290 TraceCheckUtils]: 40: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:58,314 INFO L290 TraceCheckUtils]: 39: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:58,314 INFO L290 TraceCheckUtils]: 38: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:58,314 INFO L290 TraceCheckUtils]: 37: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:58,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:58,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:58,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:58,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:58,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:58,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:58,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:58,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:58,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-08 10:11:58,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {152137#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {151906#false} is VALID [2022-04-08 10:11:58,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {152141#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {152137#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:58,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {152145#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {152141#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:58,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {152149#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {152145#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:58,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {152153#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {152149#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:11:58,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {152157#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {152153#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:11:58,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {152157#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {152157#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:58,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {152164#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {152157#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:58,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {152168#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {152164#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:11:58,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {152172#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {152168#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:58,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {152176#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {152172#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:58,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {152180#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {152176#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:58,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {152184#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {152180#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:11:58,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {152188#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {152184#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:11:58,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {152192#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {152188#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:11:58,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {152196#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {152192#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:11:58,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {152200#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {152196#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:58,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {152204#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {152200#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:11:58,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {152208#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {152204#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:58,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {152212#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {152208#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:11:58,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {152216#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {152212#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:11:58,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {152220#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {152216#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:11:58,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {151905#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {152220#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:11:58,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {151905#true} call #t~ret11 := main(); {151905#true} is VALID [2022-04-08 10:11:58,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151905#true} {151905#true} #61#return; {151905#true} is VALID [2022-04-08 10:11:58,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {151905#true} assume true; {151905#true} is VALID [2022-04-08 10:11:58,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {151905#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {151905#true} is VALID [2022-04-08 10:11:58,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {151905#true} call ULTIMATE.init(); {151905#true} is VALID [2022-04-08 10:11:58,329 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 10:11:58,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803740362] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:58,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:58,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-08 10:11:58,330 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:58,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [489545895] [2022-04-08 10:11:58,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [489545895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:58,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:58,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:11:58,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464030712] [2022-04-08 10:11:58,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:58,330 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-08 10:11:58,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:58,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:58,352 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-08 10:11:58,352 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:11:58,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:58,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:11:58,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=1695, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:11:58,353 INFO L87 Difference]: Start difference. First operand 210 states and 271 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:01,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:01,480 INFO L93 Difference]: Finished difference Result 249 states and 310 transitions. [2022-04-08 10:12:01,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 10:12:01,480 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-08 10:12:01,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:01,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:01,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 87 transitions. [2022-04-08 10:12:01,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:01,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 87 transitions. [2022-04-08 10:12:01,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 87 transitions. [2022-04-08 10:12:01,552 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-08 10:12:01,554 INFO L225 Difference]: With dead ends: 249 [2022-04-08 10:12:01,554 INFO L226 Difference]: Without dead ends: 228 [2022-04-08 10:12:01,555 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1088, Invalid=4612, Unknown=0, NotChecked=0, Total=5700 [2022-04-08 10:12:01,555 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:01,555 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 114 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:12:01,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-04-08 10:12:02,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 211. [2022-04-08 10:12:02,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:02,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 228 states. Second operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:02,363 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:02,363 INFO L87 Difference]: Start difference. First operand 228 states. Second operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:02,365 INFO L93 Difference]: Finished difference Result 228 states and 289 transitions. [2022-04-08 10:12:02,365 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 289 transitions. [2022-04-08 10:12:02,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:02,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:02,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 228 states. [2022-04-08 10:12:02,366 INFO L87 Difference]: Start difference. First operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 228 states. [2022-04-08 10:12:02,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:02,368 INFO L93 Difference]: Finished difference Result 228 states and 289 transitions. [2022-04-08 10:12:02,368 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 289 transitions. [2022-04-08 10:12:02,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:02,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:02,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:02,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:02,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 272 transitions. [2022-04-08 10:12:02,371 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 272 transitions. Word has length 48 [2022-04-08 10:12:02,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:02,371 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 272 transitions. [2022-04-08 10:12:02,371 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:02,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 272 transitions. [2022-04-08 10:12:03,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 272 edges. 272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:03,085 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 272 transitions. [2022-04-08 10:12:03,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 10:12:03,085 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:03,085 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:03,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Ended with exit code 0 [2022-04-08 10:12:03,285 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 124 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2022-04-08 10:12:03,286 INFO L403 AbstractCegarLoop]: === Iteration 127 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:03,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:03,286 INFO L85 PathProgramCache]: Analyzing trace with hash 535213453, now seen corresponding path program 243 times [2022-04-08 10:12:03,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:03,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1694660472] [2022-04-08 10:12:03,288 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:03,288 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:03,288 INFO L85 PathProgramCache]: Analyzing trace with hash 535213453, now seen corresponding path program 244 times [2022-04-08 10:12:03,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:03,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276292581] [2022-04-08 10:12:03,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:03,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:03,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:03,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {153702#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {153677#true} is VALID [2022-04-08 10:12:03,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {153677#true} assume true; {153677#true} is VALID [2022-04-08 10:12:03,608 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {153677#true} {153677#true} #61#return; {153677#true} is VALID [2022-04-08 10:12:03,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {153677#true} call ULTIMATE.init(); {153702#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:03,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {153702#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {153677#true} is VALID [2022-04-08 10:12:03,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {153677#true} assume true; {153677#true} is VALID [2022-04-08 10:12:03,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {153677#true} {153677#true} #61#return; {153677#true} is VALID [2022-04-08 10:12:03,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {153677#true} call #t~ret11 := main(); {153677#true} is VALID [2022-04-08 10:12:03,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {153677#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {153682#(= main_~y~0 0)} is VALID [2022-04-08 10:12:03,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {153682#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153683#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:03,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {153683#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153684#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:03,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {153684#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153685#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:03,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {153685#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153686#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:03,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {153686#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153687#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:03,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {153687#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153688#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:03,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {153688#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153689#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:03,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {153689#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153690#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:03,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {153690#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153691#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:03,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {153691#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153692#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:03,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {153692#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153693#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:03,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {153693#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153694#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:03,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {153694#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153695#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:12:03,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {153695#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153696#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:12:03,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {153696#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153697#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:12:03,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {153697#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:12:03,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {153698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {153698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:12:03,618 INFO L290 TraceCheckUtils]: 23: Hoare triple {153698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {153699#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:12:03,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {153699#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {153700#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:12:03,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {153700#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {153701#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:12:03,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {153701#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {153678#false} is VALID [2022-04-08 10:12:03,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:03,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:03,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:03,619 INFO L290 TraceCheckUtils]: 30: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:03,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:03,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:03,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:03,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:03,620 INFO L290 TraceCheckUtils]: 35: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:03,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:03,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:03,620 INFO L290 TraceCheckUtils]: 38: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:03,620 INFO L290 TraceCheckUtils]: 39: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:03,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:03,620 INFO L290 TraceCheckUtils]: 41: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:03,620 INFO L290 TraceCheckUtils]: 42: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:03,620 INFO L290 TraceCheckUtils]: 43: Hoare triple {153678#false} assume !(~y~0 % 4294967296 > 0); {153678#false} is VALID [2022-04-08 10:12:03,620 INFO L272 TraceCheckUtils]: 44: Hoare triple {153678#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {153678#false} is VALID [2022-04-08 10:12:03,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {153678#false} ~cond := #in~cond; {153678#false} is VALID [2022-04-08 10:12:03,620 INFO L290 TraceCheckUtils]: 46: Hoare triple {153678#false} assume 0 == ~cond; {153678#false} is VALID [2022-04-08 10:12:03,620 INFO L290 TraceCheckUtils]: 47: Hoare triple {153678#false} assume !false; {153678#false} is VALID [2022-04-08 10:12:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-08 10:12:03,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:03,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276292581] [2022-04-08 10:12:03,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276292581] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:03,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638823480] [2022-04-08 10:12:03,621 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:12:03,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:03,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:03,622 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:03,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2022-04-08 10:12:03,675 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:12:03,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:03,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 10:12:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:03,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:03,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {153677#true} call ULTIMATE.init(); {153677#true} is VALID [2022-04-08 10:12:03,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {153677#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {153677#true} is VALID [2022-04-08 10:12:03,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {153677#true} assume true; {153677#true} is VALID [2022-04-08 10:12:04,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {153677#true} {153677#true} #61#return; {153677#true} is VALID [2022-04-08 10:12:04,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {153677#true} call #t~ret11 := main(); {153677#true} is VALID [2022-04-08 10:12:04,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {153677#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {153682#(= main_~y~0 0)} is VALID [2022-04-08 10:12:04,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {153682#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153683#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:04,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {153683#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153684#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:04,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {153684#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153685#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:04,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {153685#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153686#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:04,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {153686#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153687#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:04,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {153687#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153688#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:04,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {153688#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153689#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:04,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {153689#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153690#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:04,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {153690#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153691#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:04,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {153691#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153692#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:04,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {153692#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153693#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:04,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {153693#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153694#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:04,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {153694#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153695#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:12:04,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {153695#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153696#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:12:04,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {153696#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153697#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:12:04,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {153697#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:12:04,008 INFO L290 TraceCheckUtils]: 22: Hoare triple {153698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {153698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:12:04,008 INFO L290 TraceCheckUtils]: 23: Hoare triple {153698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {153699#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:12:04,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {153699#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {153700#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:12:04,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {153700#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {153781#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:12:04,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {153781#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !(~z~0 % 4294967296 > 0); {153678#false} is VALID [2022-04-08 10:12:04,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,010 INFO L290 TraceCheckUtils]: 30: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,010 INFO L290 TraceCheckUtils]: 31: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,010 INFO L290 TraceCheckUtils]: 32: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,010 INFO L290 TraceCheckUtils]: 34: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,010 INFO L290 TraceCheckUtils]: 35: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,011 INFO L290 TraceCheckUtils]: 39: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,011 INFO L290 TraceCheckUtils]: 40: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,011 INFO L290 TraceCheckUtils]: 41: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,011 INFO L290 TraceCheckUtils]: 42: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,011 INFO L290 TraceCheckUtils]: 43: Hoare triple {153678#false} assume !(~y~0 % 4294967296 > 0); {153678#false} is VALID [2022-04-08 10:12:04,011 INFO L272 TraceCheckUtils]: 44: Hoare triple {153678#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {153678#false} is VALID [2022-04-08 10:12:04,011 INFO L290 TraceCheckUtils]: 45: Hoare triple {153678#false} ~cond := #in~cond; {153678#false} is VALID [2022-04-08 10:12:04,011 INFO L290 TraceCheckUtils]: 46: Hoare triple {153678#false} assume 0 == ~cond; {153678#false} is VALID [2022-04-08 10:12:04,011 INFO L290 TraceCheckUtils]: 47: Hoare triple {153678#false} assume !false; {153678#false} is VALID [2022-04-08 10:12:04,011 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-08 10:12:04,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:04,692 INFO L290 TraceCheckUtils]: 47: Hoare triple {153678#false} assume !false; {153678#false} is VALID [2022-04-08 10:12:04,693 INFO L290 TraceCheckUtils]: 46: Hoare triple {153678#false} assume 0 == ~cond; {153678#false} is VALID [2022-04-08 10:12:04,693 INFO L290 TraceCheckUtils]: 45: Hoare triple {153678#false} ~cond := #in~cond; {153678#false} is VALID [2022-04-08 10:12:04,693 INFO L272 TraceCheckUtils]: 44: Hoare triple {153678#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {153678#false} is VALID [2022-04-08 10:12:04,693 INFO L290 TraceCheckUtils]: 43: Hoare triple {153678#false} assume !(~y~0 % 4294967296 > 0); {153678#false} is VALID [2022-04-08 10:12:04,693 INFO L290 TraceCheckUtils]: 42: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,693 INFO L290 TraceCheckUtils]: 41: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,693 INFO L290 TraceCheckUtils]: 40: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,693 INFO L290 TraceCheckUtils]: 39: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,693 INFO L290 TraceCheckUtils]: 38: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,693 INFO L290 TraceCheckUtils]: 37: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,693 INFO L290 TraceCheckUtils]: 36: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,693 INFO L290 TraceCheckUtils]: 35: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,693 INFO L290 TraceCheckUtils]: 34: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-08 10:12:04,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {153911#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {153678#false} is VALID [2022-04-08 10:12:04,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {153915#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {153911#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:04,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {153919#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {153915#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:04,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {153923#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {153919#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:12:04,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {153923#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {153923#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:12:04,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {153930#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153923#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:12:04,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {153934#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153930#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:04,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {153938#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153934#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:12:04,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {153942#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153938#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:12:04,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {153946#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153942#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:12:04,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {153950#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153946#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:12:04,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {153954#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153950#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:12:04,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {153958#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153954#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:04,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {153962#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153958#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:12:04,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {153966#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153962#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:04,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {153970#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153966#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:12:04,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {153974#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153970#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:12:04,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {153978#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153974#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:12:04,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {153982#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153978#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:12:04,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {153986#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153982#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:12:04,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {153990#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {153986#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:12:04,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {153677#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {153990#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:12:04,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {153677#true} call #t~ret11 := main(); {153677#true} is VALID [2022-04-08 10:12:04,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {153677#true} {153677#true} #61#return; {153677#true} is VALID [2022-04-08 10:12:04,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {153677#true} assume true; {153677#true} is VALID [2022-04-08 10:12:04,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {153677#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {153677#true} is VALID [2022-04-08 10:12:04,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {153677#true} call ULTIMATE.init(); {153677#true} is VALID [2022-04-08 10:12:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-08 10:12:04,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638823480] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:04,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:04,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-08 10:12:04,708 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:04,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1694660472] [2022-04-08 10:12:04,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1694660472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:04,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:04,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:12:04,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915985047] [2022-04-08 10:12:04,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:04,708 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-08 10:12:04,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:04,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:04,729 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-08 10:12:04,729 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:12:04,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:04,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:12:04,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1506, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:12:04,730 INFO L87 Difference]: Start difference. First operand 211 states and 272 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:07,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:07,707 INFO L93 Difference]: Finished difference Result 252 states and 313 transitions. [2022-04-08 10:12:07,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 10:12:07,708 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-08 10:12:07,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 85 transitions. [2022-04-08 10:12:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 85 transitions. [2022-04-08 10:12:07,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 85 transitions. [2022-04-08 10:12:07,779 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-08 10:12:07,782 INFO L225 Difference]: With dead ends: 252 [2022-04-08 10:12:07,782 INFO L226 Difference]: Without dead ends: 230 [2022-04-08 10:12:07,782 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=902, Invalid=3520, Unknown=0, NotChecked=0, Total=4422 [2022-04-08 10:12:07,782 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:07,782 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 121 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:12:07,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-04-08 10:12:08,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 212. [2022-04-08 10:12:08,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:08,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:08,597 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:08,597 INFO L87 Difference]: Start difference. First operand 230 states. Second operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:08,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:08,600 INFO L93 Difference]: Finished difference Result 230 states and 291 transitions. [2022-04-08 10:12:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 291 transitions. [2022-04-08 10:12:08,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:08,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:08,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 230 states. [2022-04-08 10:12:08,600 INFO L87 Difference]: Start difference. First operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 230 states. [2022-04-08 10:12:08,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:08,602 INFO L93 Difference]: Finished difference Result 230 states and 291 transitions. [2022-04-08 10:12:08,602 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 291 transitions. [2022-04-08 10:12:08,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:08,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:08,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:08,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 273 transitions. [2022-04-08 10:12:08,605 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 273 transitions. Word has length 48 [2022-04-08 10:12:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:08,605 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 273 transitions. [2022-04-08 10:12:08,605 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:08,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 212 states and 273 transitions. [2022-04-08 10:12:09,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:09,335 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 273 transitions. [2022-04-08 10:12:09,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 10:12:09,335 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:09,335 INFO L499 BasicCegarLoop]: trace histogram [31, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:09,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Forceful destruction successful, exit code 0 [2022-04-08 10:12:09,549 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 125 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable126 [2022-04-08 10:12:09,549 INFO L403 AbstractCegarLoop]: === Iteration 128 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:09,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:09,550 INFO L85 PathProgramCache]: Analyzing trace with hash -518455826, now seen corresponding path program 245 times [2022-04-08 10:12:09,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:09,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [999437178] [2022-04-08 10:12:09,553 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:09,553 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:09,553 INFO L85 PathProgramCache]: Analyzing trace with hash -518455826, now seen corresponding path program 246 times [2022-04-08 10:12:09,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:09,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084187306] [2022-04-08 10:12:09,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:09,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:10,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:10,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {155484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {155445#true} is VALID [2022-04-08 10:12:10,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {155445#true} assume true; {155445#true} is VALID [2022-04-08 10:12:10,267 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {155445#true} {155445#true} #61#return; {155445#true} is VALID [2022-04-08 10:12:10,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {155445#true} call ULTIMATE.init(); {155484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:10,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {155484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {155445#true} is VALID [2022-04-08 10:12:10,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {155445#true} assume true; {155445#true} is VALID [2022-04-08 10:12:10,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155445#true} {155445#true} #61#return; {155445#true} is VALID [2022-04-08 10:12:10,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {155445#true} call #t~ret11 := main(); {155445#true} is VALID [2022-04-08 10:12:10,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {155445#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {155450#(= main_~y~0 0)} is VALID [2022-04-08 10:12:10,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {155450#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155451#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:10,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {155451#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155452#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:10,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {155452#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155453#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:10,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {155453#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155454#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:10,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {155454#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155455#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:10,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {155455#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155456#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:10,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {155456#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155457#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:10,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {155457#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155458#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:10,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {155458#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155459#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:10,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {155459#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155460#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:10,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {155460#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155461#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:10,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {155461#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155462#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:10,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {155462#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155463#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:12:10,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {155463#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155464#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:12:10,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {155464#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155465#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:12:10,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {155465#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155466#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:12:10,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {155466#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155467#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:12:10,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {155467#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155468#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:12:10,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {155468#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155469#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:12:10,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {155469#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155470#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:12:10,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {155470#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155471#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:12:10,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {155471#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155472#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:12:10,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {155472#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155473#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:12:10,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {155473#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155474#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:12:10,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {155474#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155475#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:12:10,280 INFO L290 TraceCheckUtils]: 31: Hoare triple {155475#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155476#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:12:10,281 INFO L290 TraceCheckUtils]: 32: Hoare triple {155476#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155477#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:12:10,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {155477#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155478#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-08 10:12:10,282 INFO L290 TraceCheckUtils]: 34: Hoare triple {155478#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155479#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-08 10:12:10,282 INFO L290 TraceCheckUtils]: 35: Hoare triple {155479#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155480#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-08 10:12:10,283 INFO L290 TraceCheckUtils]: 36: Hoare triple {155480#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155481#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-08 10:12:10,283 INFO L290 TraceCheckUtils]: 37: Hoare triple {155481#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {155481#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-08 10:12:10,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {155481#(and (<= main_~y~0 31) (<= 31 main_~y~0))} ~z~0 := ~y~0; {155482#(and (<= 31 main_~z~0) (<= main_~z~0 31))} is VALID [2022-04-08 10:12:10,284 INFO L290 TraceCheckUtils]: 39: Hoare triple {155482#(and (<= 31 main_~z~0) (<= main_~z~0 31))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155483#(and (<= 30 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:12:10,285 INFO L290 TraceCheckUtils]: 40: Hoare triple {155483#(and (<= 30 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {155446#false} is VALID [2022-04-08 10:12:10,285 INFO L290 TraceCheckUtils]: 41: Hoare triple {155446#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {155446#false} is VALID [2022-04-08 10:12:10,285 INFO L290 TraceCheckUtils]: 42: Hoare triple {155446#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {155446#false} is VALID [2022-04-08 10:12:10,285 INFO L290 TraceCheckUtils]: 43: Hoare triple {155446#false} assume !(~y~0 % 4294967296 > 0); {155446#false} is VALID [2022-04-08 10:12:10,285 INFO L272 TraceCheckUtils]: 44: Hoare triple {155446#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {155446#false} is VALID [2022-04-08 10:12:10,285 INFO L290 TraceCheckUtils]: 45: Hoare triple {155446#false} ~cond := #in~cond; {155446#false} is VALID [2022-04-08 10:12:10,285 INFO L290 TraceCheckUtils]: 46: Hoare triple {155446#false} assume 0 == ~cond; {155446#false} is VALID [2022-04-08 10:12:10,285 INFO L290 TraceCheckUtils]: 47: Hoare triple {155446#false} assume !false; {155446#false} is VALID [2022-04-08 10:12:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:12:10,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:10,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084187306] [2022-04-08 10:12:10,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084187306] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:10,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209424529] [2022-04-08 10:12:10,286 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:12:10,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:10,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:10,287 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:10,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2022-04-08 10:12:10,335 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:12:10,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:10,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 10:12:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:10,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:10,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {155445#true} call ULTIMATE.init(); {155445#true} is VALID [2022-04-08 10:12:10,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {155445#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {155445#true} is VALID [2022-04-08 10:12:10,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {155445#true} assume true; {155445#true} is VALID [2022-04-08 10:12:10,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155445#true} {155445#true} #61#return; {155445#true} is VALID [2022-04-08 10:12:10,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {155445#true} call #t~ret11 := main(); {155445#true} is VALID [2022-04-08 10:12:10,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {155445#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {155445#true} is VALID [2022-04-08 10:12:10,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,552 INFO L290 TraceCheckUtils]: 32: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,552 INFO L290 TraceCheckUtils]: 33: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,553 INFO L290 TraceCheckUtils]: 36: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,553 INFO L290 TraceCheckUtils]: 37: Hoare triple {155445#true} assume !(~x~0 % 4294967296 > 0); {155445#true} is VALID [2022-04-08 10:12:10,553 INFO L290 TraceCheckUtils]: 38: Hoare triple {155445#true} ~z~0 := ~y~0; {155602#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:12:10,553 INFO L290 TraceCheckUtils]: 39: Hoare triple {155602#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155606#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:12:10,554 INFO L290 TraceCheckUtils]: 40: Hoare triple {155606#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {155610#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:12:10,556 INFO L290 TraceCheckUtils]: 41: Hoare triple {155610#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {155614#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:12:10,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {155614#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {155446#false} is VALID [2022-04-08 10:12:10,557 INFO L290 TraceCheckUtils]: 43: Hoare triple {155446#false} assume !(~y~0 % 4294967296 > 0); {155446#false} is VALID [2022-04-08 10:12:10,557 INFO L272 TraceCheckUtils]: 44: Hoare triple {155446#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {155446#false} is VALID [2022-04-08 10:12:10,557 INFO L290 TraceCheckUtils]: 45: Hoare triple {155446#false} ~cond := #in~cond; {155446#false} is VALID [2022-04-08 10:12:10,557 INFO L290 TraceCheckUtils]: 46: Hoare triple {155446#false} assume 0 == ~cond; {155446#false} is VALID [2022-04-08 10:12:10,557 INFO L290 TraceCheckUtils]: 47: Hoare triple {155446#false} assume !false; {155446#false} is VALID [2022-04-08 10:12:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-08 10:12:10,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:10,729 INFO L290 TraceCheckUtils]: 47: Hoare triple {155446#false} assume !false; {155446#false} is VALID [2022-04-08 10:12:10,729 INFO L290 TraceCheckUtils]: 46: Hoare triple {155446#false} assume 0 == ~cond; {155446#false} is VALID [2022-04-08 10:12:10,729 INFO L290 TraceCheckUtils]: 45: Hoare triple {155446#false} ~cond := #in~cond; {155446#false} is VALID [2022-04-08 10:12:10,729 INFO L272 TraceCheckUtils]: 44: Hoare triple {155446#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {155446#false} is VALID [2022-04-08 10:12:10,729 INFO L290 TraceCheckUtils]: 43: Hoare triple {155446#false} assume !(~y~0 % 4294967296 > 0); {155446#false} is VALID [2022-04-08 10:12:10,730 INFO L290 TraceCheckUtils]: 42: Hoare triple {155614#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {155446#false} is VALID [2022-04-08 10:12:10,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {155610#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {155614#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:12:10,731 INFO L290 TraceCheckUtils]: 40: Hoare triple {155654#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {155610#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:12:10,732 INFO L290 TraceCheckUtils]: 39: Hoare triple {155658#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155654#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:12:10,732 INFO L290 TraceCheckUtils]: 38: Hoare triple {155445#true} ~z~0 := ~y~0; {155658#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:12:10,732 INFO L290 TraceCheckUtils]: 37: Hoare triple {155445#true} assume !(~x~0 % 4294967296 > 0); {155445#true} is VALID [2022-04-08 10:12:10,732 INFO L290 TraceCheckUtils]: 36: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {155445#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155445#true} is VALID [2022-04-08 10:12:10,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {155445#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {155445#true} is VALID [2022-04-08 10:12:10,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {155445#true} call #t~ret11 := main(); {155445#true} is VALID [2022-04-08 10:12:10,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155445#true} {155445#true} #61#return; {155445#true} is VALID [2022-04-08 10:12:10,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {155445#true} assume true; {155445#true} is VALID [2022-04-08 10:12:10,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {155445#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {155445#true} is VALID [2022-04-08 10:12:10,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {155445#true} call ULTIMATE.init(); {155445#true} is VALID [2022-04-08 10:12:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-08 10:12:10,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209424529] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:10,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:10,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 6, 6] total 43 [2022-04-08 10:12:10,735 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:10,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [999437178] [2022-04-08 10:12:10,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [999437178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:10,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:10,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-08 10:12:10,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111997627] [2022-04-08 10:12:10,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:10,736 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 36 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 48 [2022-04-08 10:12:10,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:10,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 36 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-08 10:12:10,764 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-08 10:12:10,764 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-08 10:12:10,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:10,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-08 10:12:10,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1710, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 10:12:10,765 INFO L87 Difference]: Start difference. First operand 212 states and 273 transitions. Second operand has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 36 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-08 10:12:19,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:19,353 INFO L93 Difference]: Finished difference Result 343 states and 503 transitions. [2022-04-08 10:12:19,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-08 10:12:19,353 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 36 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 48 [2022-04-08 10:12:19,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:19,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 36 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-08 10:12:19,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 203 transitions. [2022-04-08 10:12:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 36 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-08 10:12:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 203 transitions. [2022-04-08 10:12:19,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 203 transitions. [2022-04-08 10:12:19,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:19,525 INFO L225 Difference]: With dead ends: 343 [2022-04-08 10:12:19,525 INFO L226 Difference]: Without dead ends: 335 [2022-04-08 10:12:19,526 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=255, Invalid=5751, Unknown=0, NotChecked=0, Total=6006 [2022-04-08 10:12:19,526 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 171 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 5007 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 5142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 5007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:19,526 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 240 Invalid, 5142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 5007 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-08 10:12:19,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-04-08 10:12:20,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 218. [2022-04-08 10:12:20,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:20,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 335 states. Second operand has 218 states, 213 states have (on average 1.300469483568075) internal successors, (277), 213 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:20,365 INFO L74 IsIncluded]: Start isIncluded. First operand 335 states. Second operand has 218 states, 213 states have (on average 1.300469483568075) internal successors, (277), 213 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:20,366 INFO L87 Difference]: Start difference. First operand 335 states. Second operand has 218 states, 213 states have (on average 1.300469483568075) internal successors, (277), 213 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:20,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:20,370 INFO L93 Difference]: Finished difference Result 335 states and 408 transitions. [2022-04-08 10:12:20,370 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 408 transitions. [2022-04-08 10:12:20,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:20,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:20,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 218 states, 213 states have (on average 1.300469483568075) internal successors, (277), 213 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 335 states. [2022-04-08 10:12:20,370 INFO L87 Difference]: Start difference. First operand has 218 states, 213 states have (on average 1.300469483568075) internal successors, (277), 213 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 335 states. [2022-04-08 10:12:20,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:20,375 INFO L93 Difference]: Finished difference Result 335 states and 408 transitions. [2022-04-08 10:12:20,375 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 408 transitions. [2022-04-08 10:12:20,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:20,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:20,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:20,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 213 states have (on average 1.300469483568075) internal successors, (277), 213 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 281 transitions. [2022-04-08 10:12:20,380 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 281 transitions. Word has length 48 [2022-04-08 10:12:20,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:20,380 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 281 transitions. [2022-04-08 10:12:20,380 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 36 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-08 10:12:20,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 218 states and 281 transitions. [2022-04-08 10:12:21,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:21,223 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 281 transitions. [2022-04-08 10:12:21,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 10:12:21,224 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:21,224 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:21,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Forceful destruction successful, exit code 0 [2022-04-08 10:12:21,428 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable127 [2022-04-08 10:12:21,428 INFO L403 AbstractCegarLoop]: === Iteration 129 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:21,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:21,429 INFO L85 PathProgramCache]: Analyzing trace with hash -195947921, now seen corresponding path program 247 times [2022-04-08 10:12:21,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:21,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1568970219] [2022-04-08 10:12:21,431 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:21,431 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:21,431 INFO L85 PathProgramCache]: Analyzing trace with hash -195947921, now seen corresponding path program 248 times [2022-04-08 10:12:21,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:21,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123175215] [2022-04-08 10:12:21,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:21,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:21,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:21,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {157670#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {157640#true} is VALID [2022-04-08 10:12:21,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {157640#true} assume true; {157640#true} is VALID [2022-04-08 10:12:21,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {157640#true} {157640#true} #61#return; {157640#true} is VALID [2022-04-08 10:12:21,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {157640#true} call ULTIMATE.init(); {157670#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:21,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {157670#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {157640#true} is VALID [2022-04-08 10:12:21,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {157640#true} assume true; {157640#true} is VALID [2022-04-08 10:12:21,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157640#true} {157640#true} #61#return; {157640#true} is VALID [2022-04-08 10:12:21,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {157640#true} call #t~ret11 := main(); {157640#true} is VALID [2022-04-08 10:12:21,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {157640#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {157645#(= main_~y~0 0)} is VALID [2022-04-08 10:12:21,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {157645#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157646#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:21,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {157646#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157647#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:21,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {157647#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157648#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:21,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {157648#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157649#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:21,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {157649#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157650#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:21,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {157650#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157651#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:21,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {157651#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157652#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:21,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {157652#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157653#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:21,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {157653#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157654#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:21,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {157654#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157655#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:21,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {157655#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157656#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:21,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {157656#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157657#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:21,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {157657#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {157657#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:21,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {157657#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {157658#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:12:21,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {157658#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157659#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:12:21,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {157659#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157660#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:12:21,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {157660#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157661#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:12:21,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {157661#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157662#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:12:21,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {157662#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157663#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:12:21,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {157663#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157664#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:12:21,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {157664#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157665#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:12:21,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {157665#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157666#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:12:21,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {157666#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157667#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:12:21,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {157667#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157668#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:12:21,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {157668#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157669#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:12:21,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {157669#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {157641#false} is VALID [2022-04-08 10:12:21,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:21,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:21,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:21,885 INFO L290 TraceCheckUtils]: 35: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:21,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:21,885 INFO L290 TraceCheckUtils]: 37: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:21,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:21,885 INFO L290 TraceCheckUtils]: 39: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:21,886 INFO L290 TraceCheckUtils]: 40: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:21,886 INFO L290 TraceCheckUtils]: 41: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:21,886 INFO L290 TraceCheckUtils]: 42: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:21,886 INFO L290 TraceCheckUtils]: 43: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:21,886 INFO L290 TraceCheckUtils]: 44: Hoare triple {157641#false} assume !(~y~0 % 4294967296 > 0); {157641#false} is VALID [2022-04-08 10:12:21,886 INFO L272 TraceCheckUtils]: 45: Hoare triple {157641#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {157641#false} is VALID [2022-04-08 10:12:21,886 INFO L290 TraceCheckUtils]: 46: Hoare triple {157641#false} ~cond := #in~cond; {157641#false} is VALID [2022-04-08 10:12:21,886 INFO L290 TraceCheckUtils]: 47: Hoare triple {157641#false} assume 0 == ~cond; {157641#false} is VALID [2022-04-08 10:12:21,886 INFO L290 TraceCheckUtils]: 48: Hoare triple {157641#false} assume !false; {157641#false} is VALID [2022-04-08 10:12:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:12:21,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:21,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123175215] [2022-04-08 10:12:21,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123175215] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:21,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717192824] [2022-04-08 10:12:21,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:12:21,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:21,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:21,888 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:21,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2022-04-08 10:12:21,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:12:21,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:21,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 74 conjunts are in the unsatisfiable core [2022-04-08 10:12:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:21,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:22,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {157640#true} call ULTIMATE.init(); {157640#true} is VALID [2022-04-08 10:12:22,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {157640#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {157640#true} is VALID [2022-04-08 10:12:22,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {157640#true} assume true; {157640#true} is VALID [2022-04-08 10:12:22,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157640#true} {157640#true} #61#return; {157640#true} is VALID [2022-04-08 10:12:22,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {157640#true} call #t~ret11 := main(); {157640#true} is VALID [2022-04-08 10:12:22,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {157640#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {157645#(= main_~y~0 0)} is VALID [2022-04-08 10:12:22,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {157645#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157646#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:22,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {157646#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157647#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:22,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {157647#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157648#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:22,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {157648#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157649#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:22,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {157649#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157650#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:22,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {157650#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157651#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:22,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {157651#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157652#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:22,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {157652#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157653#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:22,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {157653#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157654#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:22,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {157654#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157655#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:22,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {157655#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157656#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:22,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {157656#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157657#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:22,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {157657#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {157657#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:22,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {157657#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {157731#(and (<= 12 main_~y~0) (= main_~z~0 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:22,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {157731#(and (<= 12 main_~y~0) (= main_~z~0 main_~y~0) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157735#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:12:22,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {157735#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157739#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:12:22,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {157739#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157743#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:22,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {157743#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157747#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:22,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {157747#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157751#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:22,569 INFO L290 TraceCheckUtils]: 25: Hoare triple {157751#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157755#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:22,569 INFO L290 TraceCheckUtils]: 26: Hoare triple {157755#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157759#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~y~0 (- 4)) (+ main_~z~0 3)))} is VALID [2022-04-08 10:12:22,570 INFO L290 TraceCheckUtils]: 27: Hoare triple {157759#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~y~0 (- 4)) (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157763#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:22,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {157763#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157767#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 7))) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:22,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {157767#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 7))) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157771#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ (- 9) main_~y~0) (+ main_~z~0 1)))} is VALID [2022-04-08 10:12:22,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {157771#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ (- 9) main_~y~0) (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157775#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 10))) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:22,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {157775#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 10))) (<= main_~y~0 12))} assume !(~z~0 % 4294967296 > 0); {157641#false} is VALID [2022-04-08 10:12:22,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:22,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:22,573 INFO L290 TraceCheckUtils]: 34: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:22,573 INFO L290 TraceCheckUtils]: 35: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:22,573 INFO L290 TraceCheckUtils]: 36: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:22,573 INFO L290 TraceCheckUtils]: 37: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:22,573 INFO L290 TraceCheckUtils]: 38: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:22,573 INFO L290 TraceCheckUtils]: 39: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:22,573 INFO L290 TraceCheckUtils]: 40: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:22,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:22,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:22,573 INFO L290 TraceCheckUtils]: 43: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:22,573 INFO L290 TraceCheckUtils]: 44: Hoare triple {157641#false} assume !(~y~0 % 4294967296 > 0); {157641#false} is VALID [2022-04-08 10:12:22,573 INFO L272 TraceCheckUtils]: 45: Hoare triple {157641#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {157641#false} is VALID [2022-04-08 10:12:22,573 INFO L290 TraceCheckUtils]: 46: Hoare triple {157641#false} ~cond := #in~cond; {157641#false} is VALID [2022-04-08 10:12:22,573 INFO L290 TraceCheckUtils]: 47: Hoare triple {157641#false} assume 0 == ~cond; {157641#false} is VALID [2022-04-08 10:12:22,573 INFO L290 TraceCheckUtils]: 48: Hoare triple {157641#false} assume !false; {157641#false} is VALID [2022-04-08 10:12:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:12:22,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:23,647 INFO L290 TraceCheckUtils]: 48: Hoare triple {157641#false} assume !false; {157641#false} is VALID [2022-04-08 10:12:23,647 INFO L290 TraceCheckUtils]: 47: Hoare triple {157641#false} assume 0 == ~cond; {157641#false} is VALID [2022-04-08 10:12:23,647 INFO L290 TraceCheckUtils]: 46: Hoare triple {157641#false} ~cond := #in~cond; {157641#false} is VALID [2022-04-08 10:12:23,647 INFO L272 TraceCheckUtils]: 45: Hoare triple {157641#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {157641#false} is VALID [2022-04-08 10:12:23,647 INFO L290 TraceCheckUtils]: 44: Hoare triple {157641#false} assume !(~y~0 % 4294967296 > 0); {157641#false} is VALID [2022-04-08 10:12:23,648 INFO L290 TraceCheckUtils]: 43: Hoare triple {157845#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-08 10:12:23,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {157849#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157845#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:12:23,649 INFO L290 TraceCheckUtils]: 41: Hoare triple {157853#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157849#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:12:23,650 INFO L290 TraceCheckUtils]: 40: Hoare triple {157857#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157853#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:12:23,651 INFO L290 TraceCheckUtils]: 39: Hoare triple {157861#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157857#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:12:23,652 INFO L290 TraceCheckUtils]: 38: Hoare triple {157865#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157861#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:12:23,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {157869#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157865#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:12:23,653 INFO L290 TraceCheckUtils]: 36: Hoare triple {157873#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157869#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:12:23,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {157877#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157873#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:12:23,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {157881#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157877#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:12:23,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {157885#(not (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157881#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} is VALID [2022-04-08 10:12:23,657 INFO L290 TraceCheckUtils]: 32: Hoare triple {157889#(not (< 0 (mod (+ main_~y~0 4294967285) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157885#(not (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-08 10:12:23,657 INFO L290 TraceCheckUtils]: 31: Hoare triple {157893#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {157889#(not (< 0 (mod (+ main_~y~0 4294967285) 4294967296)))} is VALID [2022-04-08 10:12:23,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {157897#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157893#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:12:23,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {157901#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157897#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:12:23,660 INFO L290 TraceCheckUtils]: 28: Hoare triple {157905#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157901#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:12:23,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {157909#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157905#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:12:23,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {157913#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157909#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:12:23,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {157917#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157913#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:12:23,663 INFO L290 TraceCheckUtils]: 24: Hoare triple {157921#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157917#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:12:23,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {157925#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157921#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:12:23,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {157929#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157925#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:12:23,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {157933#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157929#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-08 10:12:23,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {157937#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967285) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157933#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} is VALID [2022-04-08 10:12:23,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {157640#true} ~z~0 := ~y~0; {157937#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967285) 4294967296)))} is VALID [2022-04-08 10:12:23,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {157640#true} assume !(~x~0 % 4294967296 > 0); {157640#true} is VALID [2022-04-08 10:12:23,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {157640#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157640#true} is VALID [2022-04-08 10:12:23,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {157640#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157640#true} is VALID [2022-04-08 10:12:23,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {157640#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157640#true} is VALID [2022-04-08 10:12:23,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {157640#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157640#true} is VALID [2022-04-08 10:12:23,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {157640#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157640#true} is VALID [2022-04-08 10:12:23,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {157640#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157640#true} is VALID [2022-04-08 10:12:23,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {157640#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157640#true} is VALID [2022-04-08 10:12:23,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {157640#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157640#true} is VALID [2022-04-08 10:12:23,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {157640#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157640#true} is VALID [2022-04-08 10:12:23,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {157640#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157640#true} is VALID [2022-04-08 10:12:23,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {157640#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157640#true} is VALID [2022-04-08 10:12:23,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {157640#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157640#true} is VALID [2022-04-08 10:12:23,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {157640#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {157640#true} is VALID [2022-04-08 10:12:23,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {157640#true} call #t~ret11 := main(); {157640#true} is VALID [2022-04-08 10:12:23,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157640#true} {157640#true} #61#return; {157640#true} is VALID [2022-04-08 10:12:23,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {157640#true} assume true; {157640#true} is VALID [2022-04-08 10:12:23,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {157640#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {157640#true} is VALID [2022-04-08 10:12:23,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {157640#true} call ULTIMATE.init(); {157640#true} is VALID [2022-04-08 10:12:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:12:23,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717192824] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:23,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:23,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 26] total 64 [2022-04-08 10:12:23,668 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:23,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1568970219] [2022-04-08 10:12:23,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1568970219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:23,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:23,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-08 10:12:23,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377678644] [2022-04-08 10:12:23,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:23,668 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 10:12:23,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:23,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:23,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:23,693 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-08 10:12:23,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:23,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-08 10:12:23,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=3569, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 10:12:23,694 INFO L87 Difference]: Start difference. First operand 218 states and 281 transitions. Second operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:26,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:26,755 INFO L93 Difference]: Finished difference Result 251 states and 314 transitions. [2022-04-08 10:12:26,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 10:12:26,756 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 10:12:26,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 67 transitions. [2022-04-08 10:12:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 67 transitions. [2022-04-08 10:12:26,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 67 transitions. [2022-04-08 10:12:26,812 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-08 10:12:26,815 INFO L225 Difference]: With dead ends: 251 [2022-04-08 10:12:26,815 INFO L226 Difference]: Without dead ends: 233 [2022-04-08 10:12:26,816 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1352 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=767, Invalid=7065, Unknown=0, NotChecked=0, Total=7832 [2022-04-08 10:12:26,816 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:26,816 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 113 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:12:26,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-04-08 10:12:27,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 219. [2022-04-08 10:12:27,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:27,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand has 219 states, 214 states have (on average 1.2990654205607477) internal successors, (278), 214 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:27,653 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand has 219 states, 214 states have (on average 1.2990654205607477) internal successors, (278), 214 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:27,654 INFO L87 Difference]: Start difference. First operand 233 states. Second operand has 219 states, 214 states have (on average 1.2990654205607477) internal successors, (278), 214 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:27,656 INFO L93 Difference]: Finished difference Result 233 states and 296 transitions. [2022-04-08 10:12:27,656 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 296 transitions. [2022-04-08 10:12:27,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:27,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:27,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 219 states, 214 states have (on average 1.2990654205607477) internal successors, (278), 214 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 233 states. [2022-04-08 10:12:27,657 INFO L87 Difference]: Start difference. First operand has 219 states, 214 states have (on average 1.2990654205607477) internal successors, (278), 214 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 233 states. [2022-04-08 10:12:27,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:27,659 INFO L93 Difference]: Finished difference Result 233 states and 296 transitions. [2022-04-08 10:12:27,659 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 296 transitions. [2022-04-08 10:12:27,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:27,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:27,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:27,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:27,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 214 states have (on average 1.2990654205607477) internal successors, (278), 214 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 282 transitions. [2022-04-08 10:12:27,662 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 282 transitions. Word has length 49 [2022-04-08 10:12:27,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:27,662 INFO L478 AbstractCegarLoop]: Abstraction has 219 states and 282 transitions. [2022-04-08 10:12:27,662 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:27,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 219 states and 282 transitions. [2022-04-08 10:12:28,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 282 transitions. [2022-04-08 10:12:28,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 10:12:28,409 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:28,410 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:28,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Forceful destruction successful, exit code 0 [2022-04-08 10:12:28,610 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 127 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2022-04-08 10:12:28,610 INFO L403 AbstractCegarLoop]: === Iteration 130 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:28,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:28,610 INFO L85 PathProgramCache]: Analyzing trace with hash 106712255, now seen corresponding path program 249 times [2022-04-08 10:12:28,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:28,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [737972266] [2022-04-08 10:12:28,615 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:28,615 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:28,616 INFO L85 PathProgramCache]: Analyzing trace with hash 106712255, now seen corresponding path program 250 times [2022-04-08 10:12:28,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:28,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639383568] [2022-04-08 10:12:28,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:28,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:29,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:29,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {159485#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {159456#true} is VALID [2022-04-08 10:12:29,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {159456#true} assume true; {159456#true} is VALID [2022-04-08 10:12:29,042 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159456#true} {159456#true} #61#return; {159456#true} is VALID [2022-04-08 10:12:29,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {159456#true} call ULTIMATE.init(); {159485#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:29,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {159485#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {159456#true} is VALID [2022-04-08 10:12:29,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {159456#true} assume true; {159456#true} is VALID [2022-04-08 10:12:29,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159456#true} {159456#true} #61#return; {159456#true} is VALID [2022-04-08 10:12:29,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {159456#true} call #t~ret11 := main(); {159456#true} is VALID [2022-04-08 10:12:29,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {159456#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {159461#(= main_~y~0 0)} is VALID [2022-04-08 10:12:29,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {159461#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159462#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:29,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {159462#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159463#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:29,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {159463#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159464#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:29,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {159464#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159465#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:29,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {159465#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159466#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:29,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {159466#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159467#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:29,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {159467#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159468#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:29,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {159468#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159469#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:29,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {159469#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159470#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:29,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {159470#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159471#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:29,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {159471#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159472#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:29,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {159472#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159473#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:29,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {159473#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159474#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:12:29,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {159474#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {159474#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:12:29,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {159474#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {159475#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:12:29,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {159475#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159476#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:12:29,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {159476#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159477#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:12:29,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {159477#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159478#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:12:29,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {159478#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159479#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:12:29,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {159479#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159480#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:12:29,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {159480#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159481#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:12:29,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {159481#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159482#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:12:29,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {159482#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159483#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:12:29,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {159483#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159484#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:12:29,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {159484#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {159457#false} is VALID [2022-04-08 10:12:29,055 INFO L290 TraceCheckUtils]: 31: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,055 INFO L290 TraceCheckUtils]: 34: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,055 INFO L290 TraceCheckUtils]: 35: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,055 INFO L290 TraceCheckUtils]: 38: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,055 INFO L290 TraceCheckUtils]: 39: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,055 INFO L290 TraceCheckUtils]: 40: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,055 INFO L290 TraceCheckUtils]: 41: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,055 INFO L290 TraceCheckUtils]: 42: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,055 INFO L290 TraceCheckUtils]: 43: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,055 INFO L290 TraceCheckUtils]: 44: Hoare triple {159457#false} assume !(~y~0 % 4294967296 > 0); {159457#false} is VALID [2022-04-08 10:12:29,055 INFO L272 TraceCheckUtils]: 45: Hoare triple {159457#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {159457#false} is VALID [2022-04-08 10:12:29,055 INFO L290 TraceCheckUtils]: 46: Hoare triple {159457#false} ~cond := #in~cond; {159457#false} is VALID [2022-04-08 10:12:29,055 INFO L290 TraceCheckUtils]: 47: Hoare triple {159457#false} assume 0 == ~cond; {159457#false} is VALID [2022-04-08 10:12:29,055 INFO L290 TraceCheckUtils]: 48: Hoare triple {159457#false} assume !false; {159457#false} is VALID [2022-04-08 10:12:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:12:29,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:29,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639383568] [2022-04-08 10:12:29,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639383568] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:29,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495418315] [2022-04-08 10:12:29,056 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:12:29,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:29,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:29,057 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:29,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2022-04-08 10:12:29,112 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:12:29,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:29,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-08 10:12:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:29,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:29,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {159456#true} call ULTIMATE.init(); {159456#true} is VALID [2022-04-08 10:12:29,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {159456#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {159456#true} is VALID [2022-04-08 10:12:29,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {159456#true} assume true; {159456#true} is VALID [2022-04-08 10:12:29,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159456#true} {159456#true} #61#return; {159456#true} is VALID [2022-04-08 10:12:29,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {159456#true} call #t~ret11 := main(); {159456#true} is VALID [2022-04-08 10:12:29,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {159456#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {159461#(= main_~y~0 0)} is VALID [2022-04-08 10:12:29,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {159461#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159462#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:29,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {159462#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159463#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:29,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {159463#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159464#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:29,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {159464#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159465#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:29,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {159465#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159466#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:29,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {159466#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159467#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:29,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {159467#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159468#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:29,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {159468#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159469#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:29,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {159469#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159470#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:29,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {159470#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159471#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:29,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {159471#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159472#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:29,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {159472#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159473#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:29,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {159473#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159474#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:12:29,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {159474#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {159474#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:12:29,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {159474#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {159475#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:12:29,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {159475#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159476#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:12:29,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {159476#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159477#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:12:29,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {159477#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159478#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:12:29,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {159478#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159479#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:12:29,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {159479#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159480#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:12:29,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {159480#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159481#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:12:29,486 INFO L290 TraceCheckUtils]: 27: Hoare triple {159481#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159482#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:12:29,486 INFO L290 TraceCheckUtils]: 28: Hoare triple {159482#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159483#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:12:29,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {159483#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159576#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:12:29,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {159576#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {159457#false} is VALID [2022-04-08 10:12:29,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,488 INFO L290 TraceCheckUtils]: 32: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,488 INFO L290 TraceCheckUtils]: 33: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,488 INFO L290 TraceCheckUtils]: 34: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,488 INFO L290 TraceCheckUtils]: 35: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,488 INFO L290 TraceCheckUtils]: 36: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,488 INFO L290 TraceCheckUtils]: 37: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,488 INFO L290 TraceCheckUtils]: 39: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,488 INFO L290 TraceCheckUtils]: 40: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,488 INFO L290 TraceCheckUtils]: 41: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,488 INFO L290 TraceCheckUtils]: 42: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,488 INFO L290 TraceCheckUtils]: 43: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:29,488 INFO L290 TraceCheckUtils]: 44: Hoare triple {159457#false} assume !(~y~0 % 4294967296 > 0); {159457#false} is VALID [2022-04-08 10:12:29,488 INFO L272 TraceCheckUtils]: 45: Hoare triple {159457#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {159457#false} is VALID [2022-04-08 10:12:29,488 INFO L290 TraceCheckUtils]: 46: Hoare triple {159457#false} ~cond := #in~cond; {159457#false} is VALID [2022-04-08 10:12:29,488 INFO L290 TraceCheckUtils]: 47: Hoare triple {159457#false} assume 0 == ~cond; {159457#false} is VALID [2022-04-08 10:12:29,488 INFO L290 TraceCheckUtils]: 48: Hoare triple {159457#false} assume !false; {159457#false} is VALID [2022-04-08 10:12:29,489 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:12:29,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:30,351 INFO L290 TraceCheckUtils]: 48: Hoare triple {159457#false} assume !false; {159457#false} is VALID [2022-04-08 10:12:30,352 INFO L290 TraceCheckUtils]: 47: Hoare triple {159457#false} assume 0 == ~cond; {159457#false} is VALID [2022-04-08 10:12:30,352 INFO L290 TraceCheckUtils]: 46: Hoare triple {159457#false} ~cond := #in~cond; {159457#false} is VALID [2022-04-08 10:12:30,352 INFO L272 TraceCheckUtils]: 45: Hoare triple {159457#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {159457#false} is VALID [2022-04-08 10:12:30,352 INFO L290 TraceCheckUtils]: 44: Hoare triple {159457#false} assume !(~y~0 % 4294967296 > 0); {159457#false} is VALID [2022-04-08 10:12:30,352 INFO L290 TraceCheckUtils]: 43: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:30,352 INFO L290 TraceCheckUtils]: 42: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:30,352 INFO L290 TraceCheckUtils]: 41: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:30,352 INFO L290 TraceCheckUtils]: 40: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:30,352 INFO L290 TraceCheckUtils]: 39: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:30,352 INFO L290 TraceCheckUtils]: 38: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:30,352 INFO L290 TraceCheckUtils]: 37: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:30,352 INFO L290 TraceCheckUtils]: 36: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:30,352 INFO L290 TraceCheckUtils]: 35: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:30,352 INFO L290 TraceCheckUtils]: 34: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:30,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:30,352 INFO L290 TraceCheckUtils]: 32: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:30,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-08 10:12:30,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {159688#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {159457#false} is VALID [2022-04-08 10:12:30,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {159692#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159688#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:30,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {159696#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159692#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:30,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {159700#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159696#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:12:30,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {159704#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159700#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:12:30,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {159708#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159704#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:12:30,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {159712#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159708#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:12:30,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {159716#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159712#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:12:30,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {159720#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159716#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:12:30,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {159724#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {159720#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-08 10:12:30,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {159728#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} ~z~0 := ~y~0; {159724#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} is VALID [2022-04-08 10:12:30,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {159728#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !(~x~0 % 4294967296 > 0); {159728#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:12:30,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {159735#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159728#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:12:30,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {159739#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159735#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:30,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {159743#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159739#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:12:30,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {159747#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159743#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:30,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {159751#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159747#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:30,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {159755#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159751#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:30,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {159759#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159755#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:12:30,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {159763#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159759#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:12:30,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {159767#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159763#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:30,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {159771#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159767#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:12:30,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {159775#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159771#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:12:30,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {159779#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159775#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:12:30,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {159783#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {159779#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:12:30,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {159456#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {159783#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:12:30,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {159456#true} call #t~ret11 := main(); {159456#true} is VALID [2022-04-08 10:12:30,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159456#true} {159456#true} #61#return; {159456#true} is VALID [2022-04-08 10:12:30,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {159456#true} assume true; {159456#true} is VALID [2022-04-08 10:12:30,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {159456#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {159456#true} is VALID [2022-04-08 10:12:30,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {159456#true} call ULTIMATE.init(); {159456#true} is VALID [2022-04-08 10:12:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:12:30,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495418315] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:30,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:30,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-08 10:12:30,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:30,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [737972266] [2022-04-08 10:12:30,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [737972266] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:30,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:30,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-08 10:12:30,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857472459] [2022-04-08 10:12:30,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:30,370 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 10:12:30,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:30,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:30,394 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-08 10:12:30,394 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-08 10:12:30,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:30,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-08 10:12:30,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=2257, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:12:30,395 INFO L87 Difference]: Start difference. First operand 219 states and 282 transitions. Second operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:33,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:33,673 INFO L93 Difference]: Finished difference Result 254 states and 317 transitions. [2022-04-08 10:12:33,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-08 10:12:33,673 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 10:12:33,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:33,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 80 transitions. [2022-04-08 10:12:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 80 transitions. [2022-04-08 10:12:33,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 80 transitions. [2022-04-08 10:12:33,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:33,747 INFO L225 Difference]: With dead ends: 254 [2022-04-08 10:12:33,747 INFO L226 Difference]: Without dead ends: 235 [2022-04-08 10:12:33,747 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1219, Invalid=5921, Unknown=0, NotChecked=0, Total=7140 [2022-04-08 10:12:33,747 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:33,747 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 105 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:12:33,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-04-08 10:12:34,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 220. [2022-04-08 10:12:34,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:34,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand has 220 states, 215 states have (on average 1.2976744186046512) internal successors, (279), 215 states have internal predecessors, (279), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:34,618 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand has 220 states, 215 states have (on average 1.2976744186046512) internal successors, (279), 215 states have internal predecessors, (279), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:34,618 INFO L87 Difference]: Start difference. First operand 235 states. Second operand has 220 states, 215 states have (on average 1.2976744186046512) internal successors, (279), 215 states have internal predecessors, (279), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:34,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:34,620 INFO L93 Difference]: Finished difference Result 235 states and 298 transitions. [2022-04-08 10:12:34,620 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 298 transitions. [2022-04-08 10:12:34,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:34,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:34,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 220 states, 215 states have (on average 1.2976744186046512) internal successors, (279), 215 states have internal predecessors, (279), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 235 states. [2022-04-08 10:12:34,621 INFO L87 Difference]: Start difference. First operand has 220 states, 215 states have (on average 1.2976744186046512) internal successors, (279), 215 states have internal predecessors, (279), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 235 states. [2022-04-08 10:12:34,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:34,623 INFO L93 Difference]: Finished difference Result 235 states and 298 transitions. [2022-04-08 10:12:34,624 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 298 transitions. [2022-04-08 10:12:34,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:34,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:34,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:34,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:34,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 215 states have (on average 1.2976744186046512) internal successors, (279), 215 states have internal predecessors, (279), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:34,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 283 transitions. [2022-04-08 10:12:34,626 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 283 transitions. Word has length 49 [2022-04-08 10:12:34,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:34,627 INFO L478 AbstractCegarLoop]: Abstraction has 220 states and 283 transitions. [2022-04-08 10:12:34,627 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:34,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 220 states and 283 transitions. [2022-04-08 10:12:35,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:35,379 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 283 transitions. [2022-04-08 10:12:35,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 10:12:35,379 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:35,380 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:35,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Forceful destruction successful, exit code 0 [2022-04-08 10:12:35,583 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129,128 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:35,583 INFO L403 AbstractCegarLoop]: === Iteration 131 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:35,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:35,584 INFO L85 PathProgramCache]: Analyzing trace with hash 987779247, now seen corresponding path program 251 times [2022-04-08 10:12:35,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:35,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1605721648] [2022-04-08 10:12:35,587 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:35,587 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:35,587 INFO L85 PathProgramCache]: Analyzing trace with hash 987779247, now seen corresponding path program 252 times [2022-04-08 10:12:35,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:35,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117274614] [2022-04-08 10:12:35,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:35,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:35,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:35,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {161316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {161288#true} is VALID [2022-04-08 10:12:35,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {161288#true} assume true; {161288#true} is VALID [2022-04-08 10:12:35,991 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161288#true} {161288#true} #61#return; {161288#true} is VALID [2022-04-08 10:12:35,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {161288#true} call ULTIMATE.init(); {161316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:35,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {161316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {161288#true} is VALID [2022-04-08 10:12:35,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {161288#true} assume true; {161288#true} is VALID [2022-04-08 10:12:35,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161288#true} {161288#true} #61#return; {161288#true} is VALID [2022-04-08 10:12:35,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {161288#true} call #t~ret11 := main(); {161288#true} is VALID [2022-04-08 10:12:35,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {161288#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {161293#(= main_~y~0 0)} is VALID [2022-04-08 10:12:35,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {161293#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161294#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:35,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {161294#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161295#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:35,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {161295#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161296#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:35,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {161296#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161297#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:35,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {161297#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161298#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:36,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {161298#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161299#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:36,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {161299#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161300#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:36,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {161300#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161301#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:36,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {161301#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:36,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {161302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161303#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:36,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {161303#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161304#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:36,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {161304#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161305#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:36,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {161305#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161306#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:12:36,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {161306#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161307#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:12:36,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {161307#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {161307#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:12:36,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {161307#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {161308#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:12:36,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {161308#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161309#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:12:36,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {161309#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161310#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:12:36,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {161310#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161311#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:12:36,008 INFO L290 TraceCheckUtils]: 25: Hoare triple {161311#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161312#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:12:36,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {161312#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161313#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:12:36,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {161313#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161314#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:12:36,009 INFO L290 TraceCheckUtils]: 28: Hoare triple {161314#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161315#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:12:36,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {161315#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {161289#false} is VALID [2022-04-08 10:12:36,010 INFO L290 TraceCheckUtils]: 30: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,010 INFO L290 TraceCheckUtils]: 31: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,010 INFO L290 TraceCheckUtils]: 32: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,010 INFO L290 TraceCheckUtils]: 34: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,010 INFO L290 TraceCheckUtils]: 35: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,010 INFO L290 TraceCheckUtils]: 38: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,010 INFO L290 TraceCheckUtils]: 39: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,010 INFO L290 TraceCheckUtils]: 40: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,010 INFO L290 TraceCheckUtils]: 41: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,010 INFO L290 TraceCheckUtils]: 42: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,010 INFO L290 TraceCheckUtils]: 43: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,010 INFO L290 TraceCheckUtils]: 44: Hoare triple {161289#false} assume !(~y~0 % 4294967296 > 0); {161289#false} is VALID [2022-04-08 10:12:36,010 INFO L272 TraceCheckUtils]: 45: Hoare triple {161289#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {161289#false} is VALID [2022-04-08 10:12:36,011 INFO L290 TraceCheckUtils]: 46: Hoare triple {161289#false} ~cond := #in~cond; {161289#false} is VALID [2022-04-08 10:12:36,011 INFO L290 TraceCheckUtils]: 47: Hoare triple {161289#false} assume 0 == ~cond; {161289#false} is VALID [2022-04-08 10:12:36,011 INFO L290 TraceCheckUtils]: 48: Hoare triple {161289#false} assume !false; {161289#false} is VALID [2022-04-08 10:12:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:12:36,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:36,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117274614] [2022-04-08 10:12:36,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117274614] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:36,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283997988] [2022-04-08 10:12:36,011 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:12:36,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:36,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:36,012 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:36,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2022-04-08 10:12:36,475 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 10:12:36,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:36,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 10:12:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:36,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:36,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {161288#true} call ULTIMATE.init(); {161288#true} is VALID [2022-04-08 10:12:36,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {161288#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {161288#true} is VALID [2022-04-08 10:12:36,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {161288#true} assume true; {161288#true} is VALID [2022-04-08 10:12:36,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161288#true} {161288#true} #61#return; {161288#true} is VALID [2022-04-08 10:12:36,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {161288#true} call #t~ret11 := main(); {161288#true} is VALID [2022-04-08 10:12:36,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {161288#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {161293#(= main_~y~0 0)} is VALID [2022-04-08 10:12:36,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {161293#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161294#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:36,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {161294#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161295#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:36,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {161295#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161296#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:36,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {161296#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161297#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:36,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {161297#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161298#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:36,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {161298#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161299#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:36,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {161299#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161300#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:36,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {161300#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161301#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:36,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {161301#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:36,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {161302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161303#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:36,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {161303#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161304#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:36,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {161304#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161305#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:36,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {161305#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161306#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:12:36,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {161306#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161307#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:12:36,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {161307#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {161307#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:12:36,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {161307#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {161308#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:12:36,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {161308#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161309#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:12:36,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {161309#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161310#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:12:36,860 INFO L290 TraceCheckUtils]: 24: Hoare triple {161310#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161311#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:12:36,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {161311#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161312#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:12:36,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {161312#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161313#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:12:36,861 INFO L290 TraceCheckUtils]: 27: Hoare triple {161313#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161314#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:12:36,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {161314#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161404#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:12:36,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {161404#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {161289#false} is VALID [2022-04-08 10:12:36,862 INFO L290 TraceCheckUtils]: 30: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,863 INFO L290 TraceCheckUtils]: 31: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,863 INFO L290 TraceCheckUtils]: 32: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,863 INFO L290 TraceCheckUtils]: 33: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,863 INFO L290 TraceCheckUtils]: 34: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,863 INFO L290 TraceCheckUtils]: 35: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,863 INFO L290 TraceCheckUtils]: 36: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,863 INFO L290 TraceCheckUtils]: 37: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,863 INFO L290 TraceCheckUtils]: 38: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,863 INFO L290 TraceCheckUtils]: 39: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,863 INFO L290 TraceCheckUtils]: 40: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,863 INFO L290 TraceCheckUtils]: 41: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,863 INFO L290 TraceCheckUtils]: 42: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,863 INFO L290 TraceCheckUtils]: 43: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:36,863 INFO L290 TraceCheckUtils]: 44: Hoare triple {161289#false} assume !(~y~0 % 4294967296 > 0); {161289#false} is VALID [2022-04-08 10:12:36,863 INFO L272 TraceCheckUtils]: 45: Hoare triple {161289#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {161289#false} is VALID [2022-04-08 10:12:36,863 INFO L290 TraceCheckUtils]: 46: Hoare triple {161289#false} ~cond := #in~cond; {161289#false} is VALID [2022-04-08 10:12:36,863 INFO L290 TraceCheckUtils]: 47: Hoare triple {161289#false} assume 0 == ~cond; {161289#false} is VALID [2022-04-08 10:12:36,864 INFO L290 TraceCheckUtils]: 48: Hoare triple {161289#false} assume !false; {161289#false} is VALID [2022-04-08 10:12:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:12:36,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:37,720 INFO L290 TraceCheckUtils]: 48: Hoare triple {161289#false} assume !false; {161289#false} is VALID [2022-04-08 10:12:37,721 INFO L290 TraceCheckUtils]: 47: Hoare triple {161289#false} assume 0 == ~cond; {161289#false} is VALID [2022-04-08 10:12:37,721 INFO L290 TraceCheckUtils]: 46: Hoare triple {161289#false} ~cond := #in~cond; {161289#false} is VALID [2022-04-08 10:12:37,721 INFO L272 TraceCheckUtils]: 45: Hoare triple {161289#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {161289#false} is VALID [2022-04-08 10:12:37,721 INFO L290 TraceCheckUtils]: 44: Hoare triple {161289#false} assume !(~y~0 % 4294967296 > 0); {161289#false} is VALID [2022-04-08 10:12:37,721 INFO L290 TraceCheckUtils]: 43: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:37,721 INFO L290 TraceCheckUtils]: 42: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:37,721 INFO L290 TraceCheckUtils]: 41: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:37,721 INFO L290 TraceCheckUtils]: 40: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:37,721 INFO L290 TraceCheckUtils]: 39: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:37,721 INFO L290 TraceCheckUtils]: 38: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:37,721 INFO L290 TraceCheckUtils]: 37: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:37,721 INFO L290 TraceCheckUtils]: 36: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:37,721 INFO L290 TraceCheckUtils]: 35: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:37,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:37,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:37,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:37,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:37,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-08 10:12:37,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {161522#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {161289#false} is VALID [2022-04-08 10:12:37,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {161526#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161522#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:37,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {161530#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161526#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:37,724 INFO L290 TraceCheckUtils]: 26: Hoare triple {161534#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161530#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:12:37,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {161538#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161534#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:12:37,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {161542#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161538#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:12:37,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {161546#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161542#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:12:37,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {161550#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161546#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:12:37,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {161554#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} ~z~0 := ~y~0; {161550#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:12:37,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {161554#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~x~0 % 4294967296 > 0); {161554#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:12:37,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {161561#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161554#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:12:37,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {161565#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161561#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:37,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {161569#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161565#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:37,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {161573#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161569#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:37,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {161577#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161573#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:12:37,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {161581#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161577#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:12:37,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {161585#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161581#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:37,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {161589#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161585#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:12:37,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {161593#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161589#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:12:37,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {161597#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161593#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:12:37,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {161601#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161597#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:12:37,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {161605#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161601#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:12:37,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {161609#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161605#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:37,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {161613#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161609#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:12:37,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {161288#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {161613#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:37,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {161288#true} call #t~ret11 := main(); {161288#true} is VALID [2022-04-08 10:12:37,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161288#true} {161288#true} #61#return; {161288#true} is VALID [2022-04-08 10:12:37,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {161288#true} assume true; {161288#true} is VALID [2022-04-08 10:12:37,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {161288#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {161288#true} is VALID [2022-04-08 10:12:37,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {161288#true} call ULTIMATE.init(); {161288#true} is VALID [2022-04-08 10:12:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:12:37,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283997988] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:37,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:37,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-08 10:12:37,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:37,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1605721648] [2022-04-08 10:12:37,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1605721648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:37,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:37,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 10:12:37,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396601579] [2022-04-08 10:12:37,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:37,739 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 10:12:37,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:37,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:37,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:37,763 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 10:12:37,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:37,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 10:12:37,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=2058, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:12:37,764 INFO L87 Difference]: Start difference. First operand 220 states and 283 transitions. Second operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:41,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:41,557 INFO L93 Difference]: Finished difference Result 257 states and 320 transitions. [2022-04-08 10:12:41,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-08 10:12:41,557 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 10:12:41,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 88 transitions. [2022-04-08 10:12:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 88 transitions. [2022-04-08 10:12:41,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 88 transitions. [2022-04-08 10:12:41,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:41,642 INFO L225 Difference]: With dead ends: 257 [2022-04-08 10:12:41,642 INFO L226 Difference]: Without dead ends: 237 [2022-04-08 10:12:41,643 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1311, Invalid=5999, Unknown=0, NotChecked=0, Total=7310 [2022-04-08 10:12:41,643 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:41,643 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 132 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-08 10:12:41,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-08 10:12:42,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 221. [2022-04-08 10:12:42,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:42,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:42,505 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:42,505 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:42,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:42,508 INFO L93 Difference]: Finished difference Result 237 states and 300 transitions. [2022-04-08 10:12:42,508 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 300 transitions. [2022-04-08 10:12:42,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:42,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:42,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 237 states. [2022-04-08 10:12:42,508 INFO L87 Difference]: Start difference. First operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 237 states. [2022-04-08 10:12:42,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:42,510 INFO L93 Difference]: Finished difference Result 237 states and 300 transitions. [2022-04-08 10:12:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 300 transitions. [2022-04-08 10:12:42,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:42,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:42,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:42,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:42,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 284 transitions. [2022-04-08 10:12:42,513 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 284 transitions. Word has length 49 [2022-04-08 10:12:42,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:42,514 INFO L478 AbstractCegarLoop]: Abstraction has 221 states and 284 transitions. [2022-04-08 10:12:42,514 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:42,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 221 states and 284 transitions. [2022-04-08 10:12:43,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 284 edges. 284 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:43,269 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 284 transitions. [2022-04-08 10:12:43,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 10:12:43,269 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:43,269 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:43,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Forceful destruction successful, exit code 0 [2022-04-08 10:12:43,472 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,129 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:43,472 INFO L403 AbstractCegarLoop]: === Iteration 132 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:43,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:43,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1899606401, now seen corresponding path program 253 times [2022-04-08 10:12:43,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:43,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1918687124] [2022-04-08 10:12:43,475 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:43,475 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:43,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1899606401, now seen corresponding path program 254 times [2022-04-08 10:12:43,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:43,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088129544] [2022-04-08 10:12:43,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:43,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:43,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:43,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {163163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {163136#true} is VALID [2022-04-08 10:12:43,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {163136#true} assume true; {163136#true} is VALID [2022-04-08 10:12:43,852 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {163136#true} {163136#true} #61#return; {163136#true} is VALID [2022-04-08 10:12:43,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {163136#true} call ULTIMATE.init(); {163163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:43,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {163163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {163136#true} is VALID [2022-04-08 10:12:43,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {163136#true} assume true; {163136#true} is VALID [2022-04-08 10:12:43,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163136#true} {163136#true} #61#return; {163136#true} is VALID [2022-04-08 10:12:43,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {163136#true} call #t~ret11 := main(); {163136#true} is VALID [2022-04-08 10:12:43,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {163136#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {163141#(= main_~y~0 0)} is VALID [2022-04-08 10:12:43,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {163141#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163142#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:43,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {163142#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163143#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:43,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {163143#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163144#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:43,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {163144#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163145#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:43,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {163145#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163146#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:43,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {163146#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163147#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:43,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {163147#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163148#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:43,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {163148#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163149#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:43,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {163149#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163150#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:43,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {163150#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163151#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:43,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {163151#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163152#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:43,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {163152#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163153#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:43,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {163153#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163154#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:12:43,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {163154#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163155#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:12:43,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {163155#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163156#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:12:43,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {163156#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {163156#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:12:43,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {163156#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {163157#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:12:43,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {163157#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {163158#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:12:43,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {163158#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {163159#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:12:43,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {163159#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {163160#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:12:43,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {163160#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {163161#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:12:43,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {163161#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {163162#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:12:43,869 INFO L290 TraceCheckUtils]: 28: Hoare triple {163162#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {163137#false} is VALID [2022-04-08 10:12:43,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:43,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:43,869 INFO L290 TraceCheckUtils]: 31: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:43,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:43,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:43,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:43,870 INFO L290 TraceCheckUtils]: 35: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:43,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:43,870 INFO L290 TraceCheckUtils]: 37: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:43,870 INFO L290 TraceCheckUtils]: 38: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:43,870 INFO L290 TraceCheckUtils]: 39: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:43,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:43,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:43,870 INFO L290 TraceCheckUtils]: 42: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:43,870 INFO L290 TraceCheckUtils]: 43: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:43,870 INFO L290 TraceCheckUtils]: 44: Hoare triple {163137#false} assume !(~y~0 % 4294967296 > 0); {163137#false} is VALID [2022-04-08 10:12:43,870 INFO L272 TraceCheckUtils]: 45: Hoare triple {163137#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {163137#false} is VALID [2022-04-08 10:12:43,871 INFO L290 TraceCheckUtils]: 46: Hoare triple {163137#false} ~cond := #in~cond; {163137#false} is VALID [2022-04-08 10:12:43,871 INFO L290 TraceCheckUtils]: 47: Hoare triple {163137#false} assume 0 == ~cond; {163137#false} is VALID [2022-04-08 10:12:43,871 INFO L290 TraceCheckUtils]: 48: Hoare triple {163137#false} assume !false; {163137#false} is VALID [2022-04-08 10:12:43,871 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 10:12:43,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:43,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088129544] [2022-04-08 10:12:43,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088129544] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:43,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875395924] [2022-04-08 10:12:43,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:12:43,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:43,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:43,876 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:43,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2022-04-08 10:12:43,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:12:43,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:43,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:12:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:43,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:44,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {163136#true} call ULTIMATE.init(); {163136#true} is VALID [2022-04-08 10:12:44,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {163136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {163136#true} is VALID [2022-04-08 10:12:44,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {163136#true} assume true; {163136#true} is VALID [2022-04-08 10:12:44,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163136#true} {163136#true} #61#return; {163136#true} is VALID [2022-04-08 10:12:44,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {163136#true} call #t~ret11 := main(); {163136#true} is VALID [2022-04-08 10:12:44,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {163136#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {163141#(= main_~y~0 0)} is VALID [2022-04-08 10:12:44,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {163141#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163142#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:44,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {163142#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163143#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:44,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {163143#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163144#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:44,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {163144#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163145#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:44,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {163145#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163146#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:44,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {163146#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163147#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:44,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {163147#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163148#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:44,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {163148#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163149#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:44,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {163149#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163150#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:44,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {163150#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163151#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:44,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {163151#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163152#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:44,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {163152#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163153#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:44,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {163153#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163154#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:12:44,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {163154#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163155#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:12:44,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {163155#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163156#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:12:44,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {163156#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {163156#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:12:44,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {163156#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {163157#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:12:44,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {163157#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {163158#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:12:44,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {163158#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {163159#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:12:44,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {163159#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {163160#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:12:44,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {163160#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {163161#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:12:44,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {163161#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {163248#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:12:44,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {163248#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {163137#false} is VALID [2022-04-08 10:12:44,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:44,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:44,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:44,291 INFO L290 TraceCheckUtils]: 32: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:44,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:44,291 INFO L290 TraceCheckUtils]: 34: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:44,291 INFO L290 TraceCheckUtils]: 35: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:44,291 INFO L290 TraceCheckUtils]: 36: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:44,291 INFO L290 TraceCheckUtils]: 37: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:44,291 INFO L290 TraceCheckUtils]: 38: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:44,291 INFO L290 TraceCheckUtils]: 39: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:44,291 INFO L290 TraceCheckUtils]: 40: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:44,291 INFO L290 TraceCheckUtils]: 41: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:44,292 INFO L290 TraceCheckUtils]: 42: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:44,292 INFO L290 TraceCheckUtils]: 43: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:44,292 INFO L290 TraceCheckUtils]: 44: Hoare triple {163137#false} assume !(~y~0 % 4294967296 > 0); {163137#false} is VALID [2022-04-08 10:12:44,292 INFO L272 TraceCheckUtils]: 45: Hoare triple {163137#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {163137#false} is VALID [2022-04-08 10:12:44,292 INFO L290 TraceCheckUtils]: 46: Hoare triple {163137#false} ~cond := #in~cond; {163137#false} is VALID [2022-04-08 10:12:44,292 INFO L290 TraceCheckUtils]: 47: Hoare triple {163137#false} assume 0 == ~cond; {163137#false} is VALID [2022-04-08 10:12:44,292 INFO L290 TraceCheckUtils]: 48: Hoare triple {163137#false} assume !false; {163137#false} is VALID [2022-04-08 10:12:44,292 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 10:12:44,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:45,076 INFO L290 TraceCheckUtils]: 48: Hoare triple {163137#false} assume !false; {163137#false} is VALID [2022-04-08 10:12:45,076 INFO L290 TraceCheckUtils]: 47: Hoare triple {163137#false} assume 0 == ~cond; {163137#false} is VALID [2022-04-08 10:12:45,077 INFO L290 TraceCheckUtils]: 46: Hoare triple {163137#false} ~cond := #in~cond; {163137#false} is VALID [2022-04-08 10:12:45,077 INFO L272 TraceCheckUtils]: 45: Hoare triple {163137#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {163137#false} is VALID [2022-04-08 10:12:45,077 INFO L290 TraceCheckUtils]: 44: Hoare triple {163137#false} assume !(~y~0 % 4294967296 > 0); {163137#false} is VALID [2022-04-08 10:12:45,077 INFO L290 TraceCheckUtils]: 43: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:45,077 INFO L290 TraceCheckUtils]: 42: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:45,077 INFO L290 TraceCheckUtils]: 41: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:45,077 INFO L290 TraceCheckUtils]: 40: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:45,077 INFO L290 TraceCheckUtils]: 39: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:45,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:45,077 INFO L290 TraceCheckUtils]: 37: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:45,077 INFO L290 TraceCheckUtils]: 36: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:45,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:45,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:45,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:45,077 INFO L290 TraceCheckUtils]: 32: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:45,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:45,077 INFO L290 TraceCheckUtils]: 30: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:45,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-08 10:12:45,078 INFO L290 TraceCheckUtils]: 28: Hoare triple {163372#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {163137#false} is VALID [2022-04-08 10:12:45,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {163376#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {163372#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:45,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {163380#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {163376#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:45,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {163384#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {163380#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:12:45,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {163388#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {163384#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:12:45,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {163392#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {163388#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:12:45,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {163396#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {163392#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:12:45,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {163396#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {163396#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:45,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {163403#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163396#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:45,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {163407#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163403#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:45,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {163411#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163407#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:12:45,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {163415#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163411#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:12:45,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {163419#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163415#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:45,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {163423#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163419#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:12:45,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {163427#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163423#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:12:45,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {163431#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163427#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:12:45,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {163435#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163431#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:12:45,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {163439#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163435#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:12:45,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {163443#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163439#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:45,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {163447#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163443#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:12:45,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {163451#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163447#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:45,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {163455#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163451#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:12:45,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {163459#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163455#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:12:45,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {163136#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {163459#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:12:45,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {163136#true} call #t~ret11 := main(); {163136#true} is VALID [2022-04-08 10:12:45,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163136#true} {163136#true} #61#return; {163136#true} is VALID [2022-04-08 10:12:45,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {163136#true} assume true; {163136#true} is VALID [2022-04-08 10:12:45,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {163136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {163136#true} is VALID [2022-04-08 10:12:45,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {163136#true} call ULTIMATE.init(); {163136#true} is VALID [2022-04-08 10:12:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 10:12:45,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875395924] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:45,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:45,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-08 10:12:45,092 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:45,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1918687124] [2022-04-08 10:12:45,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1918687124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:45,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:45,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:12:45,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824891231] [2022-04-08 10:12:45,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:45,093 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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 49 [2022-04-08 10:12:45,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:45,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:12:45,115 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-08 10:12:45,115 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:12:45,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:45,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:12:45,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1865, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:12:45,116 INFO L87 Difference]: Start difference. First operand 221 states and 284 transitions. Second operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:12:48,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:48,483 INFO L93 Difference]: Finished difference Result 260 states and 323 transitions. [2022-04-08 10:12:48,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-08 10:12:48,483 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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 49 [2022-04-08 10:12:48,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:12:48,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 91 transitions. [2022-04-08 10:12:48,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:12:48,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 91 transitions. [2022-04-08 10:12:48,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 91 transitions. [2022-04-08 10:12:48,557 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-08 10:12:48,560 INFO L225 Difference]: With dead ends: 260 [2022-04-08 10:12:48,560 INFO L226 Difference]: Without dead ends: 239 [2022-04-08 10:12:48,560 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1237, Invalid=5405, Unknown=0, NotChecked=0, Total=6642 [2022-04-08 10:12:48,560 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:48,560 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 109 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:12:48,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-08 10:12:49,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 222. [2022-04-08 10:12:49,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:49,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 222 states, 217 states have (on average 1.294930875576037) internal successors, (281), 217 states have internal predecessors, (281), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:49,430 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 222 states, 217 states have (on average 1.294930875576037) internal successors, (281), 217 states have internal predecessors, (281), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:49,430 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 222 states, 217 states have (on average 1.294930875576037) internal successors, (281), 217 states have internal predecessors, (281), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:49,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:49,433 INFO L93 Difference]: Finished difference Result 239 states and 302 transitions. [2022-04-08 10:12:49,433 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 302 transitions. [2022-04-08 10:12:49,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:49,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:49,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 217 states have (on average 1.294930875576037) internal successors, (281), 217 states have internal predecessors, (281), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 239 states. [2022-04-08 10:12:49,433 INFO L87 Difference]: Start difference. First operand has 222 states, 217 states have (on average 1.294930875576037) internal successors, (281), 217 states have internal predecessors, (281), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 239 states. [2022-04-08 10:12:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:49,436 INFO L93 Difference]: Finished difference Result 239 states and 302 transitions. [2022-04-08 10:12:49,436 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 302 transitions. [2022-04-08 10:12:49,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:49,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:49,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:49,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.294930875576037) internal successors, (281), 217 states have internal predecessors, (281), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 285 transitions. [2022-04-08 10:12:49,439 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 285 transitions. Word has length 49 [2022-04-08 10:12:49,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:49,439 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 285 transitions. [2022-04-08 10:12:49,439 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:12:49,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 285 transitions. [2022-04-08 10:12:50,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:50,202 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 285 transitions. [2022-04-08 10:12:50,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 10:12:50,202 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:50,202 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:50,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Ended with exit code 0 [2022-04-08 10:12:50,402 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 130 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable131 [2022-04-08 10:12:50,402 INFO L403 AbstractCegarLoop]: === Iteration 133 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:50,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:50,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1634267409, now seen corresponding path program 255 times [2022-04-08 10:12:50,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:50,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1828329604] [2022-04-08 10:12:50,405 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:50,405 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:50,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1634267409, now seen corresponding path program 256 times [2022-04-08 10:12:50,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:50,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493942314] [2022-04-08 10:12:50,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:50,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:50,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:50,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {165016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {164990#true} is VALID [2022-04-08 10:12:50,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {164990#true} assume true; {164990#true} is VALID [2022-04-08 10:12:50,763 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {164990#true} {164990#true} #61#return; {164990#true} is VALID [2022-04-08 10:12:50,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {164990#true} call ULTIMATE.init(); {165016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:50,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {165016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {164990#true} is VALID [2022-04-08 10:12:50,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {164990#true} assume true; {164990#true} is VALID [2022-04-08 10:12:50,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164990#true} {164990#true} #61#return; {164990#true} is VALID [2022-04-08 10:12:50,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {164990#true} call #t~ret11 := main(); {164990#true} is VALID [2022-04-08 10:12:50,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {164990#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {164995#(= main_~y~0 0)} is VALID [2022-04-08 10:12:50,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {164995#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:50,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {164996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:50,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {164997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:50,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {164998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:50,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {164999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:50,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {165000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:50,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {165001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:50,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {165002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:50,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {165003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:50,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {165004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:50,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {165005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:50,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {165006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:50,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {165007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:12:50,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {165008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:12:50,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {165009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:12:50,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {165010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:12:50,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {165011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {165011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:12:50,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {165011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {165012#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:12:50,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {165012#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {165013#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:12:50,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {165013#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {165014#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:12:50,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {165014#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {165015#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:12:50,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {165015#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {164991#false} is VALID [2022-04-08 10:12:50,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:50,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:50,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:50,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:50,774 INFO L290 TraceCheckUtils]: 32: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:50,774 INFO L290 TraceCheckUtils]: 33: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:50,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:50,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:50,775 INFO L290 TraceCheckUtils]: 36: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:50,775 INFO L290 TraceCheckUtils]: 37: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:50,775 INFO L290 TraceCheckUtils]: 38: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:50,775 INFO L290 TraceCheckUtils]: 39: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:50,775 INFO L290 TraceCheckUtils]: 40: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:50,775 INFO L290 TraceCheckUtils]: 41: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:50,775 INFO L290 TraceCheckUtils]: 42: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:50,775 INFO L290 TraceCheckUtils]: 43: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:50,775 INFO L290 TraceCheckUtils]: 44: Hoare triple {164991#false} assume !(~y~0 % 4294967296 > 0); {164991#false} is VALID [2022-04-08 10:12:50,775 INFO L272 TraceCheckUtils]: 45: Hoare triple {164991#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {164991#false} is VALID [2022-04-08 10:12:50,775 INFO L290 TraceCheckUtils]: 46: Hoare triple {164991#false} ~cond := #in~cond; {164991#false} is VALID [2022-04-08 10:12:50,775 INFO L290 TraceCheckUtils]: 47: Hoare triple {164991#false} assume 0 == ~cond; {164991#false} is VALID [2022-04-08 10:12:50,775 INFO L290 TraceCheckUtils]: 48: Hoare triple {164991#false} assume !false; {164991#false} is VALID [2022-04-08 10:12:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-08 10:12:50,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:50,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493942314] [2022-04-08 10:12:50,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493942314] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:50,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16381273] [2022-04-08 10:12:50,776 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:12:50,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:50,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:50,777 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:50,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2022-04-08 10:12:50,837 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:12:50,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:50,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:12:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:50,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:51,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {164990#true} call ULTIMATE.init(); {164990#true} is VALID [2022-04-08 10:12:51,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {164990#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {164990#true} is VALID [2022-04-08 10:12:51,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {164990#true} assume true; {164990#true} is VALID [2022-04-08 10:12:51,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164990#true} {164990#true} #61#return; {164990#true} is VALID [2022-04-08 10:12:51,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {164990#true} call #t~ret11 := main(); {164990#true} is VALID [2022-04-08 10:12:51,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {164990#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {164995#(= main_~y~0 0)} is VALID [2022-04-08 10:12:51,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {164995#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:51,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {164996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:51,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {164997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:51,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {164998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:51,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {164999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:51,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {165000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:51,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {165001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:51,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {165002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:51,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {165003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:51,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {165004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:51,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {165005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:51,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {165006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:51,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {165007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:12:51,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {165008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:12:51,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {165009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:12:51,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {165010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:12:51,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {165011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {165011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:12:51,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {165011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {165012#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:12:51,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {165012#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {165013#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:12:51,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {165013#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {165014#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:12:51,215 INFO L290 TraceCheckUtils]: 26: Hoare triple {165014#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {165098#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:12:51,215 INFO L290 TraceCheckUtils]: 27: Hoare triple {165098#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {164991#false} is VALID [2022-04-08 10:12:51,215 INFO L290 TraceCheckUtils]: 28: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,215 INFO L290 TraceCheckUtils]: 29: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,216 INFO L290 TraceCheckUtils]: 31: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,216 INFO L290 TraceCheckUtils]: 32: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,216 INFO L290 TraceCheckUtils]: 33: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,216 INFO L290 TraceCheckUtils]: 34: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,216 INFO L290 TraceCheckUtils]: 35: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,216 INFO L290 TraceCheckUtils]: 36: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,216 INFO L290 TraceCheckUtils]: 37: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,216 INFO L290 TraceCheckUtils]: 38: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,216 INFO L290 TraceCheckUtils]: 41: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,216 INFO L290 TraceCheckUtils]: 44: Hoare triple {164991#false} assume !(~y~0 % 4294967296 > 0); {164991#false} is VALID [2022-04-08 10:12:51,217 INFO L272 TraceCheckUtils]: 45: Hoare triple {164991#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {164991#false} is VALID [2022-04-08 10:12:51,217 INFO L290 TraceCheckUtils]: 46: Hoare triple {164991#false} ~cond := #in~cond; {164991#false} is VALID [2022-04-08 10:12:51,217 INFO L290 TraceCheckUtils]: 47: Hoare triple {164991#false} assume 0 == ~cond; {164991#false} is VALID [2022-04-08 10:12:51,217 INFO L290 TraceCheckUtils]: 48: Hoare triple {164991#false} assume !false; {164991#false} is VALID [2022-04-08 10:12:51,217 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-08 10:12:51,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:51,948 INFO L290 TraceCheckUtils]: 48: Hoare triple {164991#false} assume !false; {164991#false} is VALID [2022-04-08 10:12:51,948 INFO L290 TraceCheckUtils]: 47: Hoare triple {164991#false} assume 0 == ~cond; {164991#false} is VALID [2022-04-08 10:12:51,948 INFO L290 TraceCheckUtils]: 46: Hoare triple {164991#false} ~cond := #in~cond; {164991#false} is VALID [2022-04-08 10:12:51,948 INFO L272 TraceCheckUtils]: 45: Hoare triple {164991#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {164991#false} is VALID [2022-04-08 10:12:51,948 INFO L290 TraceCheckUtils]: 44: Hoare triple {164991#false} assume !(~y~0 % 4294967296 > 0); {164991#false} is VALID [2022-04-08 10:12:51,948 INFO L290 TraceCheckUtils]: 43: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,948 INFO L290 TraceCheckUtils]: 42: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,948 INFO L290 TraceCheckUtils]: 41: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,948 INFO L290 TraceCheckUtils]: 40: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,948 INFO L290 TraceCheckUtils]: 39: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,949 INFO L290 TraceCheckUtils]: 31: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-08 10:12:51,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {165228#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {164991#false} is VALID [2022-04-08 10:12:51,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {165232#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {165228#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:51,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {165236#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {165232#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:51,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {165240#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {165236#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:12:51,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {165244#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {165240#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:12:51,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {165244#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {165244#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:12:51,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {165251#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165244#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:12:51,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {165255#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165251#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:12:51,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {165259#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165255#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:51,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {165263#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165259#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:12:51,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {165267#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165263#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:12:51,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {165271#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165267#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:12:51,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {165275#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165271#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:12:51,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {165279#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165275#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:12:51,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {165283#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165279#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:51,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {165287#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165283#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:12:51,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {165291#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165287#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:51,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {165295#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165291#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:12:51,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {165299#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165295#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:12:51,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {165303#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165299#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:12:51,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {165307#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165303#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:12:51,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {165311#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165307#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:12:51,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {164990#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {165311#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:12:51,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {164990#true} call #t~ret11 := main(); {164990#true} is VALID [2022-04-08 10:12:51,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164990#true} {164990#true} #61#return; {164990#true} is VALID [2022-04-08 10:12:51,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {164990#true} assume true; {164990#true} is VALID [2022-04-08 10:12:51,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {164990#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {164990#true} is VALID [2022-04-08 10:12:51,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {164990#true} call ULTIMATE.init(); {164990#true} is VALID [2022-04-08 10:12:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-08 10:12:51,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16381273] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:51,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:51,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-08 10:12:51,963 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:51,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1828329604] [2022-04-08 10:12:51,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1828329604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:51,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:51,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:12:51,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914436537] [2022-04-08 10:12:51,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:51,964 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 10:12:51,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:51,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:51,985 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-08 10:12:51,986 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:12:51,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:51,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:12:51,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=1672, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:12:51,986 INFO L87 Difference]: Start difference. First operand 222 states and 285 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:55,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:55,344 INFO L93 Difference]: Finished difference Result 263 states and 326 transitions. [2022-04-08 10:12:55,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-08 10:12:55,345 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 10:12:55,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 89 transitions. [2022-04-08 10:12:55,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 89 transitions. [2022-04-08 10:12:55,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 89 transitions. [2022-04-08 10:12:55,425 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-08 10:12:55,428 INFO L225 Difference]: With dead ends: 263 [2022-04-08 10:12:55,428 INFO L226 Difference]: Without dead ends: 241 [2022-04-08 10:12:55,428 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1033, Invalid=4223, Unknown=0, NotChecked=0, Total=5256 [2022-04-08 10:12:55,428 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:55,428 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 127 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:12:55,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-04-08 10:12:56,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 223. [2022-04-08 10:12:56,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:56,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand has 223 states, 218 states have (on average 1.2935779816513762) internal successors, (282), 218 states have internal predecessors, (282), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:56,307 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand has 223 states, 218 states have (on average 1.2935779816513762) internal successors, (282), 218 states have internal predecessors, (282), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:56,307 INFO L87 Difference]: Start difference. First operand 241 states. Second operand has 223 states, 218 states have (on average 1.2935779816513762) internal successors, (282), 218 states have internal predecessors, (282), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:56,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:56,310 INFO L93 Difference]: Finished difference Result 241 states and 304 transitions. [2022-04-08 10:12:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 304 transitions. [2022-04-08 10:12:56,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:56,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:56,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 223 states, 218 states have (on average 1.2935779816513762) internal successors, (282), 218 states have internal predecessors, (282), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 241 states. [2022-04-08 10:12:56,310 INFO L87 Difference]: Start difference. First operand has 223 states, 218 states have (on average 1.2935779816513762) internal successors, (282), 218 states have internal predecessors, (282), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 241 states. [2022-04-08 10:12:56,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:56,313 INFO L93 Difference]: Finished difference Result 241 states and 304 transitions. [2022-04-08 10:12:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 304 transitions. [2022-04-08 10:12:56,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:56,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:56,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:56,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:56,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 218 states have (on average 1.2935779816513762) internal successors, (282), 218 states have internal predecessors, (282), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 286 transitions. [2022-04-08 10:12:56,316 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 286 transitions. Word has length 49 [2022-04-08 10:12:56,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:56,316 INFO L478 AbstractCegarLoop]: Abstraction has 223 states and 286 transitions. [2022-04-08 10:12:56,316 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:56,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 223 states and 286 transitions. [2022-04-08 10:12:57,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:57,086 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 286 transitions. [2022-04-08 10:12:57,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 10:12:57,086 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:57,086 INFO L499 BasicCegarLoop]: trace histogram [32, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:57,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Forceful destruction successful, exit code 0 [2022-04-08 10:12:57,287 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132,131 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:57,287 INFO L403 AbstractCegarLoop]: === Iteration 134 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:57,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:57,288 INFO L85 PathProgramCache]: Analyzing trace with hash 564187407, now seen corresponding path program 257 times [2022-04-08 10:12:57,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:57,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2145622338] [2022-04-08 10:12:57,290 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:57,290 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:57,290 INFO L85 PathProgramCache]: Analyzing trace with hash 564187407, now seen corresponding path program 258 times [2022-04-08 10:12:57,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:57,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889328864] [2022-04-08 10:12:57,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:57,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:58,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:58,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {166880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {166840#true} is VALID [2022-04-08 10:12:58,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {166840#true} assume true; {166840#true} is VALID [2022-04-08 10:12:58,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {166840#true} {166840#true} #61#return; {166840#true} is VALID [2022-04-08 10:12:58,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {166840#true} call ULTIMATE.init(); {166880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:58,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {166880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {166840#true} is VALID [2022-04-08 10:12:58,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {166840#true} assume true; {166840#true} is VALID [2022-04-08 10:12:58,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166840#true} {166840#true} #61#return; {166840#true} is VALID [2022-04-08 10:12:58,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {166840#true} call #t~ret11 := main(); {166840#true} is VALID [2022-04-08 10:12:58,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {166840#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {166845#(= main_~y~0 0)} is VALID [2022-04-08 10:12:58,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {166845#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166846#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:58,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {166846#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166847#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:58,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {166847#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166848#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:58,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {166848#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166849#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:58,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {166849#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166850#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:58,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {166850#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166851#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:58,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {166851#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166852#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:58,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {166852#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166853#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:58,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {166853#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166854#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:58,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {166854#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166855#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:58,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {166855#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166856#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:58,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {166856#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166857#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:58,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {166857#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166858#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:12:58,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {166858#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166859#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:12:58,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {166859#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166860#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:12:58,018 INFO L290 TraceCheckUtils]: 21: Hoare triple {166860#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166861#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:12:58,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {166861#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166862#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:12:58,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {166862#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166863#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:12:58,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {166863#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166864#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:12:58,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {166864#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166865#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:12:58,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {166865#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166866#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:12:58,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {166866#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166867#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:12:58,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {166867#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166868#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:12:58,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {166868#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166869#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:12:58,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {166869#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166870#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:12:58,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {166870#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166871#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:12:58,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {166871#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166872#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:12:58,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {166872#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166873#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-08 10:12:58,025 INFO L290 TraceCheckUtils]: 34: Hoare triple {166873#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166874#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-08 10:12:58,025 INFO L290 TraceCheckUtils]: 35: Hoare triple {166874#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166875#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-08 10:12:58,026 INFO L290 TraceCheckUtils]: 36: Hoare triple {166875#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166876#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-08 10:12:58,026 INFO L290 TraceCheckUtils]: 37: Hoare triple {166876#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166877#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-08 10:12:58,027 INFO L290 TraceCheckUtils]: 38: Hoare triple {166877#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {166877#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-08 10:12:58,027 INFO L290 TraceCheckUtils]: 39: Hoare triple {166877#(and (<= main_~y~0 32) (<= 32 main_~y~0))} ~z~0 := ~y~0; {166878#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-08 10:12:58,028 INFO L290 TraceCheckUtils]: 40: Hoare triple {166878#(and (<= 32 main_~z~0) (<= main_~z~0 32))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {166879#(and (<= (div main_~z~0 4294967296) 0) (<= 31 main_~z~0))} is VALID [2022-04-08 10:12:58,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {166879#(and (<= (div main_~z~0 4294967296) 0) (<= 31 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {166841#false} is VALID [2022-04-08 10:12:58,028 INFO L290 TraceCheckUtils]: 42: Hoare triple {166841#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {166841#false} is VALID [2022-04-08 10:12:58,028 INFO L290 TraceCheckUtils]: 43: Hoare triple {166841#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {166841#false} is VALID [2022-04-08 10:12:58,028 INFO L290 TraceCheckUtils]: 44: Hoare triple {166841#false} assume !(~y~0 % 4294967296 > 0); {166841#false} is VALID [2022-04-08 10:12:58,028 INFO L272 TraceCheckUtils]: 45: Hoare triple {166841#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {166841#false} is VALID [2022-04-08 10:12:58,028 INFO L290 TraceCheckUtils]: 46: Hoare triple {166841#false} ~cond := #in~cond; {166841#false} is VALID [2022-04-08 10:12:58,028 INFO L290 TraceCheckUtils]: 47: Hoare triple {166841#false} assume 0 == ~cond; {166841#false} is VALID [2022-04-08 10:12:58,028 INFO L290 TraceCheckUtils]: 48: Hoare triple {166841#false} assume !false; {166841#false} is VALID [2022-04-08 10:12:58,029 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:12:58,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:58,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889328864] [2022-04-08 10:12:58,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889328864] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:58,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357168486] [2022-04-08 10:12:58,029 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:12:58,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:58,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:58,030 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:58,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2022-04-08 10:12:58,070 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:12:58,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:58,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 10:12:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:58,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:58,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {166840#true} call ULTIMATE.init(); {166840#true} is VALID [2022-04-08 10:12:58,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {166840#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {166840#true} is VALID [2022-04-08 10:12:58,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {166840#true} assume true; {166840#true} is VALID [2022-04-08 10:12:58,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166840#true} {166840#true} #61#return; {166840#true} is VALID [2022-04-08 10:12:58,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {166840#true} call #t~ret11 := main(); {166840#true} is VALID [2022-04-08 10:12:58,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {166840#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {166840#true} is VALID [2022-04-08 10:12:58,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,359 INFO L290 TraceCheckUtils]: 35: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,359 INFO L290 TraceCheckUtils]: 36: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {166840#true} assume !(~x~0 % 4294967296 > 0); {166840#true} is VALID [2022-04-08 10:12:58,360 INFO L290 TraceCheckUtils]: 39: Hoare triple {166840#true} ~z~0 := ~y~0; {167001#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:12:58,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {167001#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {167005#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:12:58,361 INFO L290 TraceCheckUtils]: 41: Hoare triple {167005#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {167009#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:12:58,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {167009#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {167013#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:12:58,362 INFO L290 TraceCheckUtils]: 43: Hoare triple {167013#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {166841#false} is VALID [2022-04-08 10:12:58,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {166841#false} assume !(~y~0 % 4294967296 > 0); {166841#false} is VALID [2022-04-08 10:12:58,363 INFO L272 TraceCheckUtils]: 45: Hoare triple {166841#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {166841#false} is VALID [2022-04-08 10:12:58,363 INFO L290 TraceCheckUtils]: 46: Hoare triple {166841#false} ~cond := #in~cond; {166841#false} is VALID [2022-04-08 10:12:58,363 INFO L290 TraceCheckUtils]: 47: Hoare triple {166841#false} assume 0 == ~cond; {166841#false} is VALID [2022-04-08 10:12:58,363 INFO L290 TraceCheckUtils]: 48: Hoare triple {166841#false} assume !false; {166841#false} is VALID [2022-04-08 10:12:58,363 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2022-04-08 10:12:58,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:58,549 INFO L290 TraceCheckUtils]: 48: Hoare triple {166841#false} assume !false; {166841#false} is VALID [2022-04-08 10:12:58,549 INFO L290 TraceCheckUtils]: 47: Hoare triple {166841#false} assume 0 == ~cond; {166841#false} is VALID [2022-04-08 10:12:58,549 INFO L290 TraceCheckUtils]: 46: Hoare triple {166841#false} ~cond := #in~cond; {166841#false} is VALID [2022-04-08 10:12:58,549 INFO L272 TraceCheckUtils]: 45: Hoare triple {166841#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {166841#false} is VALID [2022-04-08 10:12:58,549 INFO L290 TraceCheckUtils]: 44: Hoare triple {166841#false} assume !(~y~0 % 4294967296 > 0); {166841#false} is VALID [2022-04-08 10:12:58,549 INFO L290 TraceCheckUtils]: 43: Hoare triple {167013#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {166841#false} is VALID [2022-04-08 10:12:58,550 INFO L290 TraceCheckUtils]: 42: Hoare triple {167009#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {167013#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:12:58,551 INFO L290 TraceCheckUtils]: 41: Hoare triple {167053#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {167009#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:12:58,552 INFO L290 TraceCheckUtils]: 40: Hoare triple {167057#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {167053#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:12:58,552 INFO L290 TraceCheckUtils]: 39: Hoare triple {166840#true} ~z~0 := ~y~0; {167057#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:12:58,552 INFO L290 TraceCheckUtils]: 38: Hoare triple {166840#true} assume !(~x~0 % 4294967296 > 0); {166840#true} is VALID [2022-04-08 10:12:58,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,552 INFO L290 TraceCheckUtils]: 36: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,552 INFO L290 TraceCheckUtils]: 35: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,553 INFO L290 TraceCheckUtils]: 30: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {166840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166840#true} is VALID [2022-04-08 10:12:58,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {166840#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {166840#true} is VALID [2022-04-08 10:12:58,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {166840#true} call #t~ret11 := main(); {166840#true} is VALID [2022-04-08 10:12:58,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166840#true} {166840#true} #61#return; {166840#true} is VALID [2022-04-08 10:12:58,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {166840#true} assume true; {166840#true} is VALID [2022-04-08 10:12:58,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {166840#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {166840#true} is VALID [2022-04-08 10:12:58,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {166840#true} call ULTIMATE.init(); {166840#true} is VALID [2022-04-08 10:12:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2022-04-08 10:12:58,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357168486] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:58,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:58,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 6, 6] total 44 [2022-04-08 10:12:58,555 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:58,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2145622338] [2022-04-08 10:12:58,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2145622338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:58,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:58,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-08 10:12:58,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924550077] [2022-04-08 10:12:58,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:58,556 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 37 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have 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-08 10:12:58,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:58,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 37 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:58,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:58,585 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-08 10:12:58,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:58,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-08 10:12:58,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1794, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:12:58,585 INFO L87 Difference]: Start difference. First operand 223 states and 286 transitions. Second operand has 38 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 37 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:07,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:07,737 INFO L93 Difference]: Finished difference Result 355 states and 518 transitions. [2022-04-08 10:13:07,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-08 10:13:07,737 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 37 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have 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-08 10:13:07,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:13:07,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 37 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 210 transitions. [2022-04-08 10:13:07,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 37 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 210 transitions. [2022-04-08 10:13:07,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 210 transitions. [2022-04-08 10:13:07,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:07,925 INFO L225 Difference]: With dead ends: 355 [2022-04-08 10:13:07,925 INFO L226 Difference]: Without dead ends: 347 [2022-04-08 10:13:07,925 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=261, Invalid=6059, Unknown=0, NotChecked=0, Total=6320 [2022-04-08 10:13:07,926 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 179 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 5363 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 5502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 5363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:13:07,926 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 248 Invalid, 5502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 5363 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-08 10:13:07,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-04-08 10:13:08,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 229. [2022-04-08 10:13:08,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:13:08,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 347 states. Second operand has 229 states, 224 states have (on average 1.2946428571428572) internal successors, (290), 224 states have internal predecessors, (290), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:08,840 INFO L74 IsIncluded]: Start isIncluded. First operand 347 states. Second operand has 229 states, 224 states have (on average 1.2946428571428572) internal successors, (290), 224 states have internal predecessors, (290), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:08,840 INFO L87 Difference]: Start difference. First operand 347 states. Second operand has 229 states, 224 states have (on average 1.2946428571428572) internal successors, (290), 224 states have internal predecessors, (290), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:08,845 INFO L93 Difference]: Finished difference Result 347 states and 422 transitions. [2022-04-08 10:13:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 422 transitions. [2022-04-08 10:13:08,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:08,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:08,845 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 224 states have (on average 1.2946428571428572) internal successors, (290), 224 states have internal predecessors, (290), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 347 states. [2022-04-08 10:13:08,845 INFO L87 Difference]: Start difference. First operand has 229 states, 224 states have (on average 1.2946428571428572) internal successors, (290), 224 states have internal predecessors, (290), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 347 states. [2022-04-08 10:13:08,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:08,850 INFO L93 Difference]: Finished difference Result 347 states and 422 transitions. [2022-04-08 10:13:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 422 transitions. [2022-04-08 10:13:08,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:08,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:08,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:13:08,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:13:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.2946428571428572) internal successors, (290), 224 states have internal predecessors, (290), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:08,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 294 transitions. [2022-04-08 10:13:08,853 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 294 transitions. Word has length 49 [2022-04-08 10:13:08,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:13:08,853 INFO L478 AbstractCegarLoop]: Abstraction has 229 states and 294 transitions. [2022-04-08 10:13:08,853 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 37 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:08,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 294 transitions. [2022-04-08 10:13:09,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 294 edges. 294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:09,657 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 294 transitions. [2022-04-08 10:13:09,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 10:13:09,658 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:09,658 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:09,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Ended with exit code 0 [2022-04-08 10:13:09,863 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133,132 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:09,863 INFO L403 AbstractCegarLoop]: === Iteration 135 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:09,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:09,864 INFO L85 PathProgramCache]: Analyzing trace with hash 938139085, now seen corresponding path program 259 times [2022-04-08 10:13:09,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:09,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [34446049] [2022-04-08 10:13:09,867 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:09,867 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:09,867 INFO L85 PathProgramCache]: Analyzing trace with hash 938139085, now seen corresponding path program 260 times [2022-04-08 10:13:09,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:09,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519774810] [2022-04-08 10:13:09,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:09,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:10,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:13:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:10,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {169134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {169114#true} is VALID [2022-04-08 10:13:10,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {169114#true} assume true; {169114#true} is VALID [2022-04-08 10:13:10,177 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {169114#true} {169114#true} #61#return; {169114#true} is VALID [2022-04-08 10:13:10,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {169114#true} call ULTIMATE.init(); {169134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:13:10,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {169134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {169114#true} is VALID [2022-04-08 10:13:10,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {169114#true} assume true; {169114#true} is VALID [2022-04-08 10:13:10,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169114#true} {169114#true} #61#return; {169114#true} is VALID [2022-04-08 10:13:10,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {169114#true} call #t~ret11 := main(); {169114#true} is VALID [2022-04-08 10:13:10,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {169114#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {169114#true} is VALID [2022-04-08 10:13:10,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {169114#true} assume !(~x~0 % 4294967296 > 0); {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:13:10,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:13:10,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169120#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:13:10,181 INFO L290 TraceCheckUtils]: 21: Hoare triple {169120#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169121#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {169121#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169122#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {169122#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169123#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {169123#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169124#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:13:10,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {169124#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169125#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {169125#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:13:10,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-08 10:13:10,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-08 10:13:10,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-08 10:13:10,188 INFO L290 TraceCheckUtils]: 32: Hoare triple {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !(~z~0 % 4294967296 > 0); {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-08 10:13:10,189 INFO L290 TraceCheckUtils]: 33: Hoare triple {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-08 10:13:10,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-08 10:13:10,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:13:10,191 INFO L290 TraceCheckUtils]: 36: Hoare triple {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,192 INFO L290 TraceCheckUtils]: 37: Hoare triple {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,192 INFO L290 TraceCheckUtils]: 38: Hoare triple {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169125#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,193 INFO L290 TraceCheckUtils]: 39: Hoare triple {169125#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169124#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:13:10,194 INFO L290 TraceCheckUtils]: 40: Hoare triple {169124#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169123#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,194 INFO L290 TraceCheckUtils]: 41: Hoare triple {169123#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169122#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,195 INFO L290 TraceCheckUtils]: 42: Hoare triple {169122#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169121#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,196 INFO L290 TraceCheckUtils]: 43: Hoare triple {169121#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169120#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:13:10,197 INFO L290 TraceCheckUtils]: 44: Hoare triple {169120#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:13:10,197 INFO L290 TraceCheckUtils]: 45: Hoare triple {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:13:10,198 INFO L272 TraceCheckUtils]: 46: Hoare triple {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {169132#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:13:10,198 INFO L290 TraceCheckUtils]: 47: Hoare triple {169132#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {169133#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:13:10,198 INFO L290 TraceCheckUtils]: 48: Hoare triple {169133#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {169115#false} is VALID [2022-04-08 10:13:10,198 INFO L290 TraceCheckUtils]: 49: Hoare triple {169115#false} assume !false; {169115#false} is VALID [2022-04-08 10:13:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:13:10,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:13:10,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519774810] [2022-04-08 10:13:10,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519774810] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:13:10,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840703496] [2022-04-08 10:13:10,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:13:10,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:10,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:13:10,200 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:13:10,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2022-04-08 10:13:10,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:13:10,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:13:10,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-08 10:13:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:10,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:13:10,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {169114#true} call ULTIMATE.init(); {169114#true} is VALID [2022-04-08 10:13:10,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {169114#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {169114#true} is VALID [2022-04-08 10:13:10,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {169114#true} assume true; {169114#true} is VALID [2022-04-08 10:13:10,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169114#true} {169114#true} #61#return; {169114#true} is VALID [2022-04-08 10:13:10,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {169114#true} call #t~ret11 := main(); {169114#true} is VALID [2022-04-08 10:13:10,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {169114#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {169114#true} is VALID [2022-04-08 10:13:10,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {169114#true} assume !(~x~0 % 4294967296 > 0); {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:13:10,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:13:10,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169120#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:13:10,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {169120#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169121#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {169121#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169122#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {169122#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169123#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {169123#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169124#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:13:10,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {169124#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169125#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {169125#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:13:10,586 INFO L290 TraceCheckUtils]: 29: Hoare triple {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-08 10:13:10,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-08 10:13:10,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-08 10:13:10,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !(~z~0 % 4294967296 > 0); {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-08 10:13:10,589 INFO L290 TraceCheckUtils]: 33: Hoare triple {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-08 10:13:10,590 INFO L290 TraceCheckUtils]: 34: Hoare triple {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-08 10:13:10,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:13:10,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169125#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,593 INFO L290 TraceCheckUtils]: 39: Hoare triple {169125#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169124#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:13:10,594 INFO L290 TraceCheckUtils]: 40: Hoare triple {169124#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169123#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,595 INFO L290 TraceCheckUtils]: 41: Hoare triple {169123#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169122#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,596 INFO L290 TraceCheckUtils]: 42: Hoare triple {169122#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169121#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,596 INFO L290 TraceCheckUtils]: 43: Hoare triple {169121#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169120#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:13:10,597 INFO L290 TraceCheckUtils]: 44: Hoare triple {169120#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:13:10,597 INFO L290 TraceCheckUtils]: 45: Hoare triple {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:13:10,598 INFO L272 TraceCheckUtils]: 46: Hoare triple {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {169276#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:13:10,598 INFO L290 TraceCheckUtils]: 47: Hoare triple {169276#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {169280#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:13:10,599 INFO L290 TraceCheckUtils]: 48: Hoare triple {169280#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {169115#false} is VALID [2022-04-08 10:13:10,599 INFO L290 TraceCheckUtils]: 49: Hoare triple {169115#false} assume !false; {169115#false} is VALID [2022-04-08 10:13:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:13:10,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:13:10,928 INFO L290 TraceCheckUtils]: 49: Hoare triple {169115#false} assume !false; {169115#false} is VALID [2022-04-08 10:13:10,928 INFO L290 TraceCheckUtils]: 48: Hoare triple {169280#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {169115#false} is VALID [2022-04-08 10:13:10,929 INFO L290 TraceCheckUtils]: 47: Hoare triple {169276#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {169280#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:13:10,929 INFO L272 TraceCheckUtils]: 46: Hoare triple {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {169276#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:13:10,930 INFO L290 TraceCheckUtils]: 45: Hoare triple {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:13:10,930 INFO L290 TraceCheckUtils]: 44: Hoare triple {169120#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:13:10,931 INFO L290 TraceCheckUtils]: 43: Hoare triple {169121#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169120#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:13:10,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {169122#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169121#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {169123#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169122#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {169124#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169123#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,934 INFO L290 TraceCheckUtils]: 39: Hoare triple {169125#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169124#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:13:10,935 INFO L290 TraceCheckUtils]: 38: Hoare triple {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169125#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,936 INFO L290 TraceCheckUtils]: 36: Hoare triple {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:13:10,937 INFO L290 TraceCheckUtils]: 34: Hoare triple {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-08 10:13:10,938 INFO L290 TraceCheckUtils]: 33: Hoare triple {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-08 10:13:10,939 INFO L290 TraceCheckUtils]: 32: Hoare triple {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !(~z~0 % 4294967296 > 0); {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-08 10:13:10,939 INFO L290 TraceCheckUtils]: 31: Hoare triple {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-08 10:13:10,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-08 10:13:10,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-08 10:13:10,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-08 10:13:10,942 INFO L290 TraceCheckUtils]: 27: Hoare triple {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,943 INFO L290 TraceCheckUtils]: 26: Hoare triple {169125#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {169124#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169125#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,944 INFO L290 TraceCheckUtils]: 24: Hoare triple {169123#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169124#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:13:10,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {169122#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169123#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {169121#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169122#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {169120#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169121#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:10,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169120#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:13:10,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:13:10,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {169114#true} assume !(~x~0 % 4294967296 > 0); {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:13:10,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {169114#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {169114#true} is VALID [2022-04-08 10:13:10,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {169114#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {169114#true} is VALID [2022-04-08 10:13:10,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {169114#true} call #t~ret11 := main(); {169114#true} is VALID [2022-04-08 10:13:10,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169114#true} {169114#true} #61#return; {169114#true} is VALID [2022-04-08 10:13:10,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {169114#true} assume true; {169114#true} is VALID [2022-04-08 10:13:10,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {169114#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {169114#true} is VALID [2022-04-08 10:13:10,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {169114#true} call ULTIMATE.init(); {169114#true} is VALID [2022-04-08 10:13:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:13:10,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840703496] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:13:10,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:13:10,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 20 [2022-04-08 10:13:10,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:13:10,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [34446049] [2022-04-08 10:13:10,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [34446049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:13:10,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:13:10,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:13:10,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470985033] [2022-04-08 10:13:10,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:13:10,950 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) 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 50 [2022-04-08 10:13:10,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:13:10,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.9444444444444444) 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-08 10:13:10,984 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-08 10:13:10,984 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:13:10,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:10,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:13:10,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:13:10,985 INFO L87 Difference]: Start difference. First operand 229 states and 294 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) 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-08 10:13:18,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:18,490 INFO L93 Difference]: Finished difference Result 809 states and 1087 transitions. [2022-04-08 10:13:18,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:13:18,490 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) 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 50 [2022-04-08 10:13:18,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:13:18,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.9444444444444444) 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-08 10:13:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2022-04-08 10:13:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.9444444444444444) 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-08 10:13:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2022-04-08 10:13:18,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 82 transitions. [2022-04-08 10:13:18,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:18,591 INFO L225 Difference]: With dead ends: 809 [2022-04-08 10:13:18,591 INFO L226 Difference]: Without dead ends: 791 [2022-04-08 10:13:18,592 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 109 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=1089, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 10:13:18,592 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 47 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:13:18,592 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 124 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:13:18,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-04-08 10:13:19,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 233. [2022-04-08 10:13:19,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:13:19,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 791 states. Second operand has 233 states, 228 states have (on average 1.2982456140350878) internal successors, (296), 228 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:19,544 INFO L74 IsIncluded]: Start isIncluded. First operand 791 states. Second operand has 233 states, 228 states have (on average 1.2982456140350878) internal successors, (296), 228 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:19,544 INFO L87 Difference]: Start difference. First operand 791 states. Second operand has 233 states, 228 states have (on average 1.2982456140350878) internal successors, (296), 228 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:19,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:19,565 INFO L93 Difference]: Finished difference Result 791 states and 1068 transitions. [2022-04-08 10:13:19,565 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1068 transitions. [2022-04-08 10:13:19,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:19,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:19,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 228 states have (on average 1.2982456140350878) internal successors, (296), 228 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 791 states. [2022-04-08 10:13:19,566 INFO L87 Difference]: Start difference. First operand has 233 states, 228 states have (on average 1.2982456140350878) internal successors, (296), 228 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 791 states. [2022-04-08 10:13:19,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:19,585 INFO L93 Difference]: Finished difference Result 791 states and 1068 transitions. [2022-04-08 10:13:19,586 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1068 transitions. [2022-04-08 10:13:19,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:19,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:19,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:13:19,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:13:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 228 states have (on average 1.2982456140350878) internal successors, (296), 228 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:19,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 300 transitions. [2022-04-08 10:13:19,589 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 300 transitions. Word has length 50 [2022-04-08 10:13:19,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:13:19,589 INFO L478 AbstractCegarLoop]: Abstraction has 233 states and 300 transitions. [2022-04-08 10:13:19,589 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) 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-08 10:13:19,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 233 states and 300 transitions. [2022-04-08 10:13:20,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 300 edges. 300 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:20,474 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 300 transitions. [2022-04-08 10:13:20,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 10:13:20,474 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:20,475 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:20,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Ended with exit code 0 [2022-04-08 10:13:20,675 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 133 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable134 [2022-04-08 10:13:20,675 INFO L403 AbstractCegarLoop]: === Iteration 136 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:20,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:20,675 INFO L85 PathProgramCache]: Analyzing trace with hash 618158975, now seen corresponding path program 261 times [2022-04-08 10:13:20,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:20,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1737720706] [2022-04-08 10:13:20,678 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:20,679 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:20,679 INFO L85 PathProgramCache]: Analyzing trace with hash 618158975, now seen corresponding path program 262 times [2022-04-08 10:13:20,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:20,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815301588] [2022-04-08 10:13:20,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:20,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:21,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:13:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:21,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {173162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {173132#true} is VALID [2022-04-08 10:13:21,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {173132#true} assume true; {173132#true} is VALID [2022-04-08 10:13:21,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {173132#true} {173132#true} #61#return; {173132#true} is VALID [2022-04-08 10:13:21,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {173132#true} call ULTIMATE.init(); {173162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:13:21,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {173162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {173132#true} is VALID [2022-04-08 10:13:21,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {173132#true} assume true; {173132#true} is VALID [2022-04-08 10:13:21,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173132#true} {173132#true} #61#return; {173132#true} is VALID [2022-04-08 10:13:21,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {173132#true} call #t~ret11 := main(); {173132#true} is VALID [2022-04-08 10:13:21,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {173132#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {173137#(= main_~y~0 0)} is VALID [2022-04-08 10:13:21,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {173137#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173138#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:21,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {173138#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173139#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:21,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {173139#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173140#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:21,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {173140#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173141#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:21,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {173141#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173142#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:21,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {173142#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173143#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:21,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {173143#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173144#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:21,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {173144#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173145#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:21,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {173145#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173146#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:21,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {173146#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173147#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:21,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {173147#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173148#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:13:21,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {173148#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173149#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:13:21,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {173149#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173150#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:21,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {173150#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {173150#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:21,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {173150#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {173151#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:13:21,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {173151#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173152#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:13:21,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {173152#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173153#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:13:21,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {173153#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173154#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:13:21,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {173154#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173155#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:13:21,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {173155#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173156#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:13:21,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {173156#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173157#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:13:21,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {173157#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173158#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:13:21,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {173158#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173159#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:13:21,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {173159#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173160#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:13:21,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {173160#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173161#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:13:21,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {173161#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {173133#false} is VALID [2022-04-08 10:13:21,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,157 INFO L290 TraceCheckUtils]: 36: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,157 INFO L290 TraceCheckUtils]: 40: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,157 INFO L290 TraceCheckUtils]: 42: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,157 INFO L290 TraceCheckUtils]: 43: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,157 INFO L290 TraceCheckUtils]: 44: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,157 INFO L290 TraceCheckUtils]: 45: Hoare triple {173133#false} assume !(~y~0 % 4294967296 > 0); {173133#false} is VALID [2022-04-08 10:13:21,157 INFO L272 TraceCheckUtils]: 46: Hoare triple {173133#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {173133#false} is VALID [2022-04-08 10:13:21,157 INFO L290 TraceCheckUtils]: 47: Hoare triple {173133#false} ~cond := #in~cond; {173133#false} is VALID [2022-04-08 10:13:21,157 INFO L290 TraceCheckUtils]: 48: Hoare triple {173133#false} assume 0 == ~cond; {173133#false} is VALID [2022-04-08 10:13:21,157 INFO L290 TraceCheckUtils]: 49: Hoare triple {173133#false} assume !false; {173133#false} is VALID [2022-04-08 10:13:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:13:21,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:13:21,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815301588] [2022-04-08 10:13:21,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815301588] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:13:21,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956791933] [2022-04-08 10:13:21,158 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:13:21,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:21,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:13:21,159 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:13:21,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2022-04-08 10:13:21,216 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:13:21,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:13:21,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-08 10:13:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:21,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:13:21,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {173132#true} call ULTIMATE.init(); {173132#true} is VALID [2022-04-08 10:13:21,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {173132#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {173132#true} is VALID [2022-04-08 10:13:21,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {173132#true} assume true; {173132#true} is VALID [2022-04-08 10:13:21,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173132#true} {173132#true} #61#return; {173132#true} is VALID [2022-04-08 10:13:21,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {173132#true} call #t~ret11 := main(); {173132#true} is VALID [2022-04-08 10:13:21,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {173132#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {173137#(= main_~y~0 0)} is VALID [2022-04-08 10:13:21,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {173137#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173138#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:21,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {173138#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173139#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:21,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {173139#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173140#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:21,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {173140#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173141#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:21,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {173141#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173142#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:21,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {173142#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173143#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:21,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {173143#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173144#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:21,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {173144#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173145#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:21,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {173145#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173146#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:21,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {173146#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173147#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:21,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {173147#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173148#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:13:21,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {173148#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173149#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:13:21,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {173149#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173150#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:21,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {173150#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {173150#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:21,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {173150#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {173226#(and (<= main_~y~0 13) (= main_~z~0 main_~y~0) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:21,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {173226#(and (<= main_~y~0 13) (= main_~z~0 main_~y~0) (<= 13 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173230#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:13:21,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {173230#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173234#(and (<= main_~y~0 13) (= main_~y~0 (+ main_~z~0 2)) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:21,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {173234#(and (<= main_~y~0 13) (= main_~y~0 (+ main_~z~0 2)) (<= 13 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173238#(and (<= main_~y~0 13) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:21,810 INFO L290 TraceCheckUtils]: 24: Hoare triple {173238#(and (<= main_~y~0 13) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 13 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173242#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-08 10:13:21,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {173242#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173246#(and (<= main_~y~0 13) (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:21,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {173246#(and (<= main_~y~0 13) (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= 13 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173250#(and (<= main_~y~0 13) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:21,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {173250#(and (<= main_~y~0 13) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 13 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173254#(and (<= main_~y~0 13) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:21,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {173254#(and (<= main_~y~0 13) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 13 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173258#(and (<= main_~y~0 13) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:21,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {173258#(and (<= main_~y~0 13) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)) (<= 13 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173262#(and (<= main_~y~0 13) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:21,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {173262#(and (<= main_~y~0 13) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= 13 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173266#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 8))))} is VALID [2022-04-08 10:13:21,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {173266#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 8))))} assume !(~z~0 % 4294967296 > 0); {173133#false} is VALID [2022-04-08 10:13:21,814 INFO L290 TraceCheckUtils]: 32: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,814 INFO L290 TraceCheckUtils]: 35: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,814 INFO L290 TraceCheckUtils]: 36: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,814 INFO L290 TraceCheckUtils]: 37: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,814 INFO L290 TraceCheckUtils]: 38: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,815 INFO L290 TraceCheckUtils]: 39: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,815 INFO L290 TraceCheckUtils]: 40: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,815 INFO L290 TraceCheckUtils]: 41: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,815 INFO L290 TraceCheckUtils]: 42: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,815 INFO L290 TraceCheckUtils]: 43: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,815 INFO L290 TraceCheckUtils]: 44: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:21,815 INFO L290 TraceCheckUtils]: 45: Hoare triple {173133#false} assume !(~y~0 % 4294967296 > 0); {173133#false} is VALID [2022-04-08 10:13:21,815 INFO L272 TraceCheckUtils]: 46: Hoare triple {173133#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {173133#false} is VALID [2022-04-08 10:13:21,815 INFO L290 TraceCheckUtils]: 47: Hoare triple {173133#false} ~cond := #in~cond; {173133#false} is VALID [2022-04-08 10:13:21,815 INFO L290 TraceCheckUtils]: 48: Hoare triple {173133#false} assume 0 == ~cond; {173133#false} is VALID [2022-04-08 10:13:21,815 INFO L290 TraceCheckUtils]: 49: Hoare triple {173133#false} assume !false; {173133#false} is VALID [2022-04-08 10:13:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:13:21,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:13:22,787 INFO L290 TraceCheckUtils]: 49: Hoare triple {173133#false} assume !false; {173133#false} is VALID [2022-04-08 10:13:22,787 INFO L290 TraceCheckUtils]: 48: Hoare triple {173133#false} assume 0 == ~cond; {173133#false} is VALID [2022-04-08 10:13:22,788 INFO L290 TraceCheckUtils]: 47: Hoare triple {173133#false} ~cond := #in~cond; {173133#false} is VALID [2022-04-08 10:13:22,788 INFO L272 TraceCheckUtils]: 46: Hoare triple {173133#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {173133#false} is VALID [2022-04-08 10:13:22,788 INFO L290 TraceCheckUtils]: 45: Hoare triple {173133#false} assume !(~y~0 % 4294967296 > 0); {173133#false} is VALID [2022-04-08 10:13:22,788 INFO L290 TraceCheckUtils]: 44: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:22,788 INFO L290 TraceCheckUtils]: 43: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:22,788 INFO L290 TraceCheckUtils]: 42: Hoare triple {173345#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-08 10:13:22,789 INFO L290 TraceCheckUtils]: 41: Hoare triple {173349#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173345#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:13:22,790 INFO L290 TraceCheckUtils]: 40: Hoare triple {173353#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173349#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:13:22,790 INFO L290 TraceCheckUtils]: 39: Hoare triple {173357#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173353#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:13:22,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {173361#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173357#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:13:22,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {173365#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173361#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:13:22,793 INFO L290 TraceCheckUtils]: 36: Hoare triple {173369#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173365#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:13:22,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {173373#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173369#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:13:22,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {173377#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173373#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:13:22,795 INFO L290 TraceCheckUtils]: 33: Hoare triple {173381#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173377#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:13:22,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {173385#(not (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173381#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} is VALID [2022-04-08 10:13:22,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {173389#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {173385#(not (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-08 10:13:22,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {173393#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173389#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-08 10:13:22,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {173397#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173393#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:13:22,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {173401#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173397#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-08 10:13:22,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {173405#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173401#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:13:22,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {173409#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173405#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-08 10:13:22,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {173413#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173409#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-08 10:13:22,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {173417#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173413#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:13:22,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {173421#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173417#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:13:22,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {173425#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173421#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:13:22,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {173429#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173425#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-08 10:13:22,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {173132#true} ~z~0 := ~y~0; {173429#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} is VALID [2022-04-08 10:13:22,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {173132#true} assume !(~x~0 % 4294967296 > 0); {173132#true} is VALID [2022-04-08 10:13:22,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {173132#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173132#true} is VALID [2022-04-08 10:13:22,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {173132#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173132#true} is VALID [2022-04-08 10:13:22,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {173132#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173132#true} is VALID [2022-04-08 10:13:22,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {173132#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173132#true} is VALID [2022-04-08 10:13:22,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {173132#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173132#true} is VALID [2022-04-08 10:13:22,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {173132#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173132#true} is VALID [2022-04-08 10:13:22,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {173132#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173132#true} is VALID [2022-04-08 10:13:22,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {173132#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173132#true} is VALID [2022-04-08 10:13:22,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {173132#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173132#true} is VALID [2022-04-08 10:13:22,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {173132#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173132#true} is VALID [2022-04-08 10:13:22,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {173132#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173132#true} is VALID [2022-04-08 10:13:22,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {173132#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173132#true} is VALID [2022-04-08 10:13:22,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {173132#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {173132#true} is VALID [2022-04-08 10:13:22,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {173132#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {173132#true} is VALID [2022-04-08 10:13:22,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {173132#true} call #t~ret11 := main(); {173132#true} is VALID [2022-04-08 10:13:22,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173132#true} {173132#true} #61#return; {173132#true} is VALID [2022-04-08 10:13:22,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {173132#true} assume true; {173132#true} is VALID [2022-04-08 10:13:22,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {173132#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {173132#true} is VALID [2022-04-08 10:13:22,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {173132#true} call ULTIMATE.init(); {173132#true} is VALID [2022-04-08 10:13:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-04-08 10:13:22,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956791933] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:13:22,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:13:22,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 24] total 61 [2022-04-08 10:13:22,806 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:13:22,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1737720706] [2022-04-08 10:13:22,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1737720706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:13:22,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:13:22,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-08 10:13:22,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418766676] [2022-04-08 10:13:22,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:13:22,807 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 10:13:22,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:13:22,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:22,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:22,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-08 10:13:22,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:22,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-08 10:13:22,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=3247, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 10:13:22,832 INFO L87 Difference]: Start difference. First operand 233 states and 300 transitions. Second operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:26,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:26,904 INFO L93 Difference]: Finished difference Result 268 states and 335 transitions. [2022-04-08 10:13:26,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-08 10:13:26,904 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 10:13:26,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:13:26,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 82 transitions. [2022-04-08 10:13:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 82 transitions. [2022-04-08 10:13:26,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 82 transitions. [2022-04-08 10:13:26,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:26,981 INFO L225 Difference]: With dead ends: 268 [2022-04-08 10:13:26,982 INFO L226 Difference]: Without dead ends: 249 [2022-04-08 10:13:26,982 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1598 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=866, Invalid=8254, Unknown=0, NotChecked=0, Total=9120 [2022-04-08 10:13:26,982 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:13:26,982 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 135 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 10:13:26,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-08 10:13:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 234. [2022-04-08 10:13:27,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:13:27,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 234 states, 229 states have (on average 1.296943231441048) internal successors, (297), 229 states have internal predecessors, (297), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:27,935 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 234 states, 229 states have (on average 1.296943231441048) internal successors, (297), 229 states have internal predecessors, (297), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:27,936 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 234 states, 229 states have (on average 1.296943231441048) internal successors, (297), 229 states have internal predecessors, (297), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:27,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:27,938 INFO L93 Difference]: Finished difference Result 249 states and 316 transitions. [2022-04-08 10:13:27,938 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 316 transitions. [2022-04-08 10:13:27,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:27,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:27,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 229 states have (on average 1.296943231441048) internal successors, (297), 229 states have internal predecessors, (297), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 249 states. [2022-04-08 10:13:27,939 INFO L87 Difference]: Start difference. First operand has 234 states, 229 states have (on average 1.296943231441048) internal successors, (297), 229 states have internal predecessors, (297), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 249 states. [2022-04-08 10:13:27,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:27,941 INFO L93 Difference]: Finished difference Result 249 states and 316 transitions. [2022-04-08 10:13:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 316 transitions. [2022-04-08 10:13:27,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:27,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:27,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:13:27,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:13:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 229 states have (on average 1.296943231441048) internal successors, (297), 229 states have internal predecessors, (297), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:27,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 301 transitions. [2022-04-08 10:13:27,945 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 301 transitions. Word has length 50 [2022-04-08 10:13:27,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:13:27,945 INFO L478 AbstractCegarLoop]: Abstraction has 234 states and 301 transitions. [2022-04-08 10:13:27,945 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:27,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 234 states and 301 transitions. [2022-04-08 10:13:28,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 301 edges. 301 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 301 transitions. [2022-04-08 10:13:28,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 10:13:28,854 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:28,854 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:28,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Ended with exit code 0 [2022-04-08 10:13:29,055 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 134 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2022-04-08 10:13:29,055 INFO L403 AbstractCegarLoop]: === Iteration 137 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:29,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:29,055 INFO L85 PathProgramCache]: Analyzing trace with hash 2033330125, now seen corresponding path program 263 times [2022-04-08 10:13:29,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:29,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1682220784] [2022-04-08 10:13:29,058 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:29,059 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:29,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2033330125, now seen corresponding path program 264 times [2022-04-08 10:13:29,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:29,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087736247] [2022-04-08 10:13:29,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:29,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:29,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:13:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:29,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {175096#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {175067#true} is VALID [2022-04-08 10:13:29,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {175067#true} assume true; {175067#true} is VALID [2022-04-08 10:13:29,496 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {175067#true} {175067#true} #61#return; {175067#true} is VALID [2022-04-08 10:13:29,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {175067#true} call ULTIMATE.init(); {175096#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:13:29,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {175096#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {175067#true} is VALID [2022-04-08 10:13:29,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {175067#true} assume true; {175067#true} is VALID [2022-04-08 10:13:29,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {175067#true} {175067#true} #61#return; {175067#true} is VALID [2022-04-08 10:13:29,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {175067#true} call #t~ret11 := main(); {175067#true} is VALID [2022-04-08 10:13:29,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {175067#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {175072#(= main_~y~0 0)} is VALID [2022-04-08 10:13:29,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {175072#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175073#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:29,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {175073#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175074#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:29,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {175074#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175075#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:29,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {175075#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175076#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:29,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {175076#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175077#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:29,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {175077#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175078#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:29,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {175078#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175079#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:29,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {175079#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175080#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:29,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {175080#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175081#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:29,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {175081#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175082#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:29,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {175082#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175083#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:13:29,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {175083#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175084#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:13:29,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {175084#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175085#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:29,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {175085#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175086#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:13:29,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {175086#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {175086#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:13:29,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {175086#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {175087#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:13:29,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {175087#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175088#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:13:29,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {175088#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175089#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:13:29,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {175089#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175090#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:13:29,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {175090#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175091#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:13:29,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {175091#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175092#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:13:29,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {175092#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175093#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:13:29,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {175093#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175094#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:13:29,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {175094#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175095#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:13:29,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {175095#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {175068#false} is VALID [2022-04-08 10:13:29,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:29,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:29,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:29,513 INFO L290 TraceCheckUtils]: 34: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:29,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:29,513 INFO L290 TraceCheckUtils]: 36: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:29,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:29,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:29,513 INFO L290 TraceCheckUtils]: 39: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:29,513 INFO L290 TraceCheckUtils]: 40: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:29,514 INFO L290 TraceCheckUtils]: 41: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:29,514 INFO L290 TraceCheckUtils]: 42: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:29,514 INFO L290 TraceCheckUtils]: 43: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:29,514 INFO L290 TraceCheckUtils]: 44: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:29,514 INFO L290 TraceCheckUtils]: 45: Hoare triple {175068#false} assume !(~y~0 % 4294967296 > 0); {175068#false} is VALID [2022-04-08 10:13:29,514 INFO L272 TraceCheckUtils]: 46: Hoare triple {175068#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {175068#false} is VALID [2022-04-08 10:13:29,514 INFO L290 TraceCheckUtils]: 47: Hoare triple {175068#false} ~cond := #in~cond; {175068#false} is VALID [2022-04-08 10:13:29,514 INFO L290 TraceCheckUtils]: 48: Hoare triple {175068#false} assume 0 == ~cond; {175068#false} is VALID [2022-04-08 10:13:29,514 INFO L290 TraceCheckUtils]: 49: Hoare triple {175068#false} assume !false; {175068#false} is VALID [2022-04-08 10:13:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:13:29,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:13:29,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087736247] [2022-04-08 10:13:29,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087736247] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:13:29,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699801821] [2022-04-08 10:13:29,515 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:13:29,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:29,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:13:29,520 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:13:29,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Waiting until timeout for monitored process [2022-04-08 10:13:30,001 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 10:13:30,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:13:30,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-08 10:13:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:30,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:13:30,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {175067#true} call ULTIMATE.init(); {175067#true} is VALID [2022-04-08 10:13:30,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {175067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {175067#true} is VALID [2022-04-08 10:13:30,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {175067#true} assume true; {175067#true} is VALID [2022-04-08 10:13:30,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {175067#true} {175067#true} #61#return; {175067#true} is VALID [2022-04-08 10:13:30,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {175067#true} call #t~ret11 := main(); {175067#true} is VALID [2022-04-08 10:13:30,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {175067#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {175072#(= main_~y~0 0)} is VALID [2022-04-08 10:13:30,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {175072#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175073#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:30,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {175073#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175074#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:30,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {175074#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175075#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:30,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {175075#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175076#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:30,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {175076#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175077#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:30,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {175077#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175078#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:30,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {175078#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175079#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:30,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {175079#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175080#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:30,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {175080#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175081#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:30,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {175081#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175082#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:30,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {175082#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175083#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:13:30,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {175083#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175084#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:13:30,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {175084#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175085#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:30,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {175085#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175086#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:13:30,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {175086#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {175086#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:13:30,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {175086#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {175087#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:13:30,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {175087#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175088#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:13:30,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {175088#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175089#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:13:30,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {175089#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175090#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:13:30,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {175090#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175091#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:13:30,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {175091#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175092#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:13:30,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {175092#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175093#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:13:30,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {175093#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175094#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:13:30,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {175094#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175187#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:13:30,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {175187#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {175068#false} is VALID [2022-04-08 10:13:30,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:30,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:30,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:30,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:30,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:30,380 INFO L290 TraceCheckUtils]: 36: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:30,380 INFO L290 TraceCheckUtils]: 37: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:30,381 INFO L290 TraceCheckUtils]: 38: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:30,381 INFO L290 TraceCheckUtils]: 39: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:30,381 INFO L290 TraceCheckUtils]: 40: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:30,381 INFO L290 TraceCheckUtils]: 41: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:30,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:30,381 INFO L290 TraceCheckUtils]: 43: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:30,381 INFO L290 TraceCheckUtils]: 44: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:30,381 INFO L290 TraceCheckUtils]: 45: Hoare triple {175068#false} assume !(~y~0 % 4294967296 > 0); {175068#false} is VALID [2022-04-08 10:13:30,381 INFO L272 TraceCheckUtils]: 46: Hoare triple {175068#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {175068#false} is VALID [2022-04-08 10:13:30,381 INFO L290 TraceCheckUtils]: 47: Hoare triple {175068#false} ~cond := #in~cond; {175068#false} is VALID [2022-04-08 10:13:30,381 INFO L290 TraceCheckUtils]: 48: Hoare triple {175068#false} assume 0 == ~cond; {175068#false} is VALID [2022-04-08 10:13:30,381 INFO L290 TraceCheckUtils]: 49: Hoare triple {175068#false} assume !false; {175068#false} is VALID [2022-04-08 10:13:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:13:30,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:13:31,256 INFO L290 TraceCheckUtils]: 49: Hoare triple {175068#false} assume !false; {175068#false} is VALID [2022-04-08 10:13:31,256 INFO L290 TraceCheckUtils]: 48: Hoare triple {175068#false} assume 0 == ~cond; {175068#false} is VALID [2022-04-08 10:13:31,256 INFO L290 TraceCheckUtils]: 47: Hoare triple {175068#false} ~cond := #in~cond; {175068#false} is VALID [2022-04-08 10:13:31,256 INFO L272 TraceCheckUtils]: 46: Hoare triple {175068#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {175068#false} is VALID [2022-04-08 10:13:31,257 INFO L290 TraceCheckUtils]: 45: Hoare triple {175068#false} assume !(~y~0 % 4294967296 > 0); {175068#false} is VALID [2022-04-08 10:13:31,257 INFO L290 TraceCheckUtils]: 44: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:31,257 INFO L290 TraceCheckUtils]: 43: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:31,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:31,257 INFO L290 TraceCheckUtils]: 41: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:31,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:31,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:31,257 INFO L290 TraceCheckUtils]: 38: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:31,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:31,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:31,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:31,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:31,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:31,257 INFO L290 TraceCheckUtils]: 32: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:31,257 INFO L290 TraceCheckUtils]: 31: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-08 10:13:31,258 INFO L290 TraceCheckUtils]: 30: Hoare triple {175305#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {175068#false} is VALID [2022-04-08 10:13:31,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {175309#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175305#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:13:31,259 INFO L290 TraceCheckUtils]: 28: Hoare triple {175313#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175309#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:13:31,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {175317#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175313#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:13:31,261 INFO L290 TraceCheckUtils]: 26: Hoare triple {175321#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175317#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:13:31,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {175325#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175321#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:13:31,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {175329#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175325#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:13:31,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {175333#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175329#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:13:31,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {175337#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175333#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:13:31,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {175341#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} ~z~0 := ~y~0; {175337#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-08 10:13:31,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {175341#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {175341#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:31,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {175348#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175341#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:31,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {175352#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175348#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:13:31,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {175356#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175352#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:31,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {175360#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175356#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:31,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {175364#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175360#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:31,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {175368#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175364#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:13:31,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {175372#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175368#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:13:31,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {175376#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175372#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:13:31,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {175380#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175376#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:13:31,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {175384#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175380#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:13:31,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {175388#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175384#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:13:31,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {175392#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175388#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:13:31,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {175396#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175392#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:13:31,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {175400#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175396#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:31,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {175067#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {175400#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:13:31,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {175067#true} call #t~ret11 := main(); {175067#true} is VALID [2022-04-08 10:13:31,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {175067#true} {175067#true} #61#return; {175067#true} is VALID [2022-04-08 10:13:31,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {175067#true} assume true; {175067#true} is VALID [2022-04-08 10:13:31,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {175067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {175067#true} is VALID [2022-04-08 10:13:31,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {175067#true} call ULTIMATE.init(); {175067#true} is VALID [2022-04-08 10:13:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:13:31,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699801821] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:13:31,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:13:31,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-08 10:13:31,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:13:31,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1682220784] [2022-04-08 10:13:31,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1682220784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:13:31,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:13:31,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-08 10:13:31,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219989593] [2022-04-08 10:13:31,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:13:31,275 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 10:13:31,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:13:31,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:31,300 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-08 10:13:31,300 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-08 10:13:31,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:31,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-08 10:13:31,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=2242, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:13:31,301 INFO L87 Difference]: Start difference. First operand 234 states and 301 transitions. Second operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:34,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:34,995 INFO L93 Difference]: Finished difference Result 271 states and 338 transitions. [2022-04-08 10:13:34,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-08 10:13:34,995 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 10:13:34,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:13:34,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:34,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 91 transitions. [2022-04-08 10:13:34,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:34,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 91 transitions. [2022-04-08 10:13:34,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 91 transitions. [2022-04-08 10:13:35,069 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-08 10:13:35,072 INFO L225 Difference]: With dead ends: 271 [2022-04-08 10:13:35,072 INFO L226 Difference]: Without dead ends: 251 [2022-04-08 10:13:35,073 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 973 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1433, Invalid=6757, Unknown=0, NotChecked=0, Total=8190 [2022-04-08 10:13:35,073 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:13:35,073 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 102 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:13:35,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-04-08 10:13:36,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2022-04-08 10:13:36,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:13:36,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 251 states. Second operand has 235 states, 230 states have (on average 1.2956521739130435) internal successors, (298), 230 states have internal predecessors, (298), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:36,035 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand has 235 states, 230 states have (on average 1.2956521739130435) internal successors, (298), 230 states have internal predecessors, (298), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:36,036 INFO L87 Difference]: Start difference. First operand 251 states. Second operand has 235 states, 230 states have (on average 1.2956521739130435) internal successors, (298), 230 states have internal predecessors, (298), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:36,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:36,038 INFO L93 Difference]: Finished difference Result 251 states and 318 transitions. [2022-04-08 10:13:36,038 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 318 transitions. [2022-04-08 10:13:36,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:36,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:36,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 230 states have (on average 1.2956521739130435) internal successors, (298), 230 states have internal predecessors, (298), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 251 states. [2022-04-08 10:13:36,039 INFO L87 Difference]: Start difference. First operand has 235 states, 230 states have (on average 1.2956521739130435) internal successors, (298), 230 states have internal predecessors, (298), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 251 states. [2022-04-08 10:13:36,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:36,042 INFO L93 Difference]: Finished difference Result 251 states and 318 transitions. [2022-04-08 10:13:36,042 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 318 transitions. [2022-04-08 10:13:36,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:36,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:36,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:13:36,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:13:36,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 230 states have (on average 1.2956521739130435) internal successors, (298), 230 states have internal predecessors, (298), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:36,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 302 transitions. [2022-04-08 10:13:36,045 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 302 transitions. Word has length 50 [2022-04-08 10:13:36,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:13:36,045 INFO L478 AbstractCegarLoop]: Abstraction has 235 states and 302 transitions. [2022-04-08 10:13:36,045 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:36,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 235 states and 302 transitions. [2022-04-08 10:13:36,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 302 edges. 302 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 302 transitions. [2022-04-08 10:13:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 10:13:36,956 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:36,956 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:36,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Forceful destruction successful, exit code 0 [2022-04-08 10:13:37,156 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 135 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable136 [2022-04-08 10:13:37,157 INFO L403 AbstractCegarLoop]: === Iteration 138 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:37,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:37,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1252468353, now seen corresponding path program 265 times [2022-04-08 10:13:37,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:37,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1122639538] [2022-04-08 10:13:37,159 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:37,159 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:37,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1252468353, now seen corresponding path program 266 times [2022-04-08 10:13:37,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:37,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599195607] [2022-04-08 10:13:37,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:37,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:37,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:13:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:37,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {177041#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {177013#true} is VALID [2022-04-08 10:13:37,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {177013#true} assume true; {177013#true} is VALID [2022-04-08 10:13:37,559 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {177013#true} {177013#true} #61#return; {177013#true} is VALID [2022-04-08 10:13:37,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {177013#true} call ULTIMATE.init(); {177041#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:13:37,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {177041#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {177013#true} is VALID [2022-04-08 10:13:37,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {177013#true} assume true; {177013#true} is VALID [2022-04-08 10:13:37,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177013#true} {177013#true} #61#return; {177013#true} is VALID [2022-04-08 10:13:37,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {177013#true} call #t~ret11 := main(); {177013#true} is VALID [2022-04-08 10:13:37,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {177013#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {177018#(= main_~y~0 0)} is VALID [2022-04-08 10:13:37,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {177018#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177019#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:37,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {177019#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177020#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:37,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {177020#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177021#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:37,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {177021#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177022#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:37,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {177022#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177023#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:37,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {177023#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177024#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:37,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {177024#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177025#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:37,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {177025#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177026#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:37,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {177026#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177027#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:37,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {177027#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177028#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:37,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {177028#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177029#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:13:37,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {177029#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177030#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:13:37,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {177030#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177031#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:37,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {177031#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177032#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:13:37,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {177032#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177033#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:13:37,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {177033#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {177033#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:13:37,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {177033#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {177034#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:13:37,569 INFO L290 TraceCheckUtils]: 23: Hoare triple {177034#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177035#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:13:37,569 INFO L290 TraceCheckUtils]: 24: Hoare triple {177035#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177036#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:13:37,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {177036#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177037#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:13:37,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {177037#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177038#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:13:37,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {177038#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177039#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:13:37,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {177039#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177040#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:13:37,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {177040#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {177014#false} is VALID [2022-04-08 10:13:37,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:37,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:37,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:37,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:37,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:37,572 INFO L290 TraceCheckUtils]: 35: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:37,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:37,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:37,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:37,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:37,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:37,572 INFO L290 TraceCheckUtils]: 41: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:37,572 INFO L290 TraceCheckUtils]: 42: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:37,572 INFO L290 TraceCheckUtils]: 43: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:37,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:37,572 INFO L290 TraceCheckUtils]: 45: Hoare triple {177014#false} assume !(~y~0 % 4294967296 > 0); {177014#false} is VALID [2022-04-08 10:13:37,572 INFO L272 TraceCheckUtils]: 46: Hoare triple {177014#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {177014#false} is VALID [2022-04-08 10:13:37,572 INFO L290 TraceCheckUtils]: 47: Hoare triple {177014#false} ~cond := #in~cond; {177014#false} is VALID [2022-04-08 10:13:37,573 INFO L290 TraceCheckUtils]: 48: Hoare triple {177014#false} assume 0 == ~cond; {177014#false} is VALID [2022-04-08 10:13:37,573 INFO L290 TraceCheckUtils]: 49: Hoare triple {177014#false} assume !false; {177014#false} is VALID [2022-04-08 10:13:37,573 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 10:13:37,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:13:37,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599195607] [2022-04-08 10:13:37,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599195607] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:13:37,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766921506] [2022-04-08 10:13:37,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:13:37,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:37,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:13:37,574 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:13:37,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Waiting until timeout for monitored process [2022-04-08 10:13:37,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:13:37,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:13:37,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 10:13:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:37,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:13:38,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {177013#true} call ULTIMATE.init(); {177013#true} is VALID [2022-04-08 10:13:38,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {177013#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {177013#true} is VALID [2022-04-08 10:13:38,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {177013#true} assume true; {177013#true} is VALID [2022-04-08 10:13:38,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177013#true} {177013#true} #61#return; {177013#true} is VALID [2022-04-08 10:13:38,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {177013#true} call #t~ret11 := main(); {177013#true} is VALID [2022-04-08 10:13:38,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {177013#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {177018#(= main_~y~0 0)} is VALID [2022-04-08 10:13:38,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {177018#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177019#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:38,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {177019#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177020#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:38,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {177020#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177021#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:38,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {177021#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177022#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:38,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {177022#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177023#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:38,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {177023#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177024#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:38,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {177024#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177025#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:38,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {177025#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177026#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:38,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {177026#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177027#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:38,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {177027#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177028#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:38,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {177028#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177029#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:13:38,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {177029#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177030#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:13:38,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {177030#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177031#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:38,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {177031#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177032#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:13:38,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {177032#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177033#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:13:38,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {177033#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {177033#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:13:38,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {177033#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {177034#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:13:38,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {177034#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177035#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:13:38,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {177035#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177036#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:13:38,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {177036#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177037#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:13:38,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {177037#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177038#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:13:38,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {177038#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177039#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:13:38,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {177039#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177129#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:13:38,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {177129#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {177014#false} is VALID [2022-04-08 10:13:38,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,013 INFO L290 TraceCheckUtils]: 32: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,013 INFO L290 TraceCheckUtils]: 33: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,013 INFO L290 TraceCheckUtils]: 35: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,013 INFO L290 TraceCheckUtils]: 36: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,013 INFO L290 TraceCheckUtils]: 37: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,013 INFO L290 TraceCheckUtils]: 38: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,013 INFO L290 TraceCheckUtils]: 39: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,013 INFO L290 TraceCheckUtils]: 40: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,013 INFO L290 TraceCheckUtils]: 41: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,013 INFO L290 TraceCheckUtils]: 42: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,013 INFO L290 TraceCheckUtils]: 43: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,013 INFO L290 TraceCheckUtils]: 44: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,013 INFO L290 TraceCheckUtils]: 45: Hoare triple {177014#false} assume !(~y~0 % 4294967296 > 0); {177014#false} is VALID [2022-04-08 10:13:38,013 INFO L272 TraceCheckUtils]: 46: Hoare triple {177014#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {177014#false} is VALID [2022-04-08 10:13:38,013 INFO L290 TraceCheckUtils]: 47: Hoare triple {177014#false} ~cond := #in~cond; {177014#false} is VALID [2022-04-08 10:13:38,014 INFO L290 TraceCheckUtils]: 48: Hoare triple {177014#false} assume 0 == ~cond; {177014#false} is VALID [2022-04-08 10:13:38,014 INFO L290 TraceCheckUtils]: 49: Hoare triple {177014#false} assume !false; {177014#false} is VALID [2022-04-08 10:13:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 10:13:38,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:13:38,843 INFO L290 TraceCheckUtils]: 49: Hoare triple {177014#false} assume !false; {177014#false} is VALID [2022-04-08 10:13:38,843 INFO L290 TraceCheckUtils]: 48: Hoare triple {177014#false} assume 0 == ~cond; {177014#false} is VALID [2022-04-08 10:13:38,844 INFO L290 TraceCheckUtils]: 47: Hoare triple {177014#false} ~cond := #in~cond; {177014#false} is VALID [2022-04-08 10:13:38,844 INFO L272 TraceCheckUtils]: 46: Hoare triple {177014#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {177014#false} is VALID [2022-04-08 10:13:38,844 INFO L290 TraceCheckUtils]: 45: Hoare triple {177014#false} assume !(~y~0 % 4294967296 > 0); {177014#false} is VALID [2022-04-08 10:13:38,844 INFO L290 TraceCheckUtils]: 44: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,844 INFO L290 TraceCheckUtils]: 43: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,844 INFO L290 TraceCheckUtils]: 42: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,844 INFO L290 TraceCheckUtils]: 41: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,844 INFO L290 TraceCheckUtils]: 40: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,844 INFO L290 TraceCheckUtils]: 39: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,844 INFO L290 TraceCheckUtils]: 38: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,844 INFO L290 TraceCheckUtils]: 37: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,844 INFO L290 TraceCheckUtils]: 36: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,844 INFO L290 TraceCheckUtils]: 35: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,844 INFO L290 TraceCheckUtils]: 34: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-08 10:13:38,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {177253#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {177014#false} is VALID [2022-04-08 10:13:38,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {177257#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177253#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:13:38,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {177261#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177257#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:13:38,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {177265#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177261#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:13:38,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {177269#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177265#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:13:38,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {177273#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177269#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:13:38,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {177277#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177273#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:13:38,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {177281#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {177277#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:13:38,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {177281#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {177281#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:38,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {177288#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177281#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:38,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {177292#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177288#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:38,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {177296#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177292#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:38,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {177300#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177296#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:13:38,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {177304#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177300#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:13:38,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {177308#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177304#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:13:38,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {177312#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177308#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:13:38,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {177316#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177312#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:13:38,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {177320#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177316#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:13:38,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {177324#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177320#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:13:38,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {177328#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177324#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:13:38,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {177332#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177328#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:38,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {177336#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177332#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:13:38,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {177340#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177336#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:38,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {177344#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177340#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:13:38,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {177013#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {177344#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:13:38,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {177013#true} call #t~ret11 := main(); {177013#true} is VALID [2022-04-08 10:13:38,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177013#true} {177013#true} #61#return; {177013#true} is VALID [2022-04-08 10:13:38,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {177013#true} assume true; {177013#true} is VALID [2022-04-08 10:13:38,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {177013#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {177013#true} is VALID [2022-04-08 10:13:38,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {177013#true} call ULTIMATE.init(); {177013#true} is VALID [2022-04-08 10:13:38,859 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 10:13:38,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766921506] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:13:38,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:13:38,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-08 10:13:38,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:13:38,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1122639538] [2022-04-08 10:13:38,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1122639538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:13:38,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:13:38,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 10:13:38,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56677921] [2022-04-08 10:13:38,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:13:38,860 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 10:13:38,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:13:38,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:38,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:38,884 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 10:13:38,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:38,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 10:13:38,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=2041, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:13:38,884 INFO L87 Difference]: Start difference. First operand 235 states and 302 transitions. Second operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:42,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:42,942 INFO L93 Difference]: Finished difference Result 274 states and 341 transitions. [2022-04-08 10:13:42,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-08 10:13:42,942 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 10:13:42,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:13:42,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 95 transitions. [2022-04-08 10:13:42,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 95 transitions. [2022-04-08 10:13:42,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 95 transitions. [2022-04-08 10:13:43,020 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-08 10:13:43,023 INFO L225 Difference]: With dead ends: 274 [2022-04-08 10:13:43,023 INFO L226 Difference]: Without dead ends: 253 [2022-04-08 10:13:43,024 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1396, Invalid=6260, Unknown=0, NotChecked=0, Total=7656 [2022-04-08 10:13:43,024 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:13:43,024 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 134 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-08 10:13:43,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-08 10:13:43,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 236. [2022-04-08 10:13:43,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:13:43,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 236 states, 231 states have (on average 1.2943722943722944) internal successors, (299), 231 states have internal predecessors, (299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:43,998 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 236 states, 231 states have (on average 1.2943722943722944) internal successors, (299), 231 states have internal predecessors, (299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:43,998 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 236 states, 231 states have (on average 1.2943722943722944) internal successors, (299), 231 states have internal predecessors, (299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:44,001 INFO L93 Difference]: Finished difference Result 253 states and 320 transitions. [2022-04-08 10:13:44,001 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 320 transitions. [2022-04-08 10:13:44,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:44,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:44,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 236 states, 231 states have (on average 1.2943722943722944) internal successors, (299), 231 states have internal predecessors, (299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 253 states. [2022-04-08 10:13:44,002 INFO L87 Difference]: Start difference. First operand has 236 states, 231 states have (on average 1.2943722943722944) internal successors, (299), 231 states have internal predecessors, (299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 253 states. [2022-04-08 10:13:44,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:44,005 INFO L93 Difference]: Finished difference Result 253 states and 320 transitions. [2022-04-08 10:13:44,005 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 320 transitions. [2022-04-08 10:13:44,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:44,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:44,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:13:44,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:13:44,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 231 states have (on average 1.2943722943722944) internal successors, (299), 231 states have internal predecessors, (299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 303 transitions. [2022-04-08 10:13:44,009 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 303 transitions. Word has length 50 [2022-04-08 10:13:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:13:44,009 INFO L478 AbstractCegarLoop]: Abstraction has 236 states and 303 transitions. [2022-04-08 10:13:44,009 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:44,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 236 states and 303 transitions. [2022-04-08 10:13:44,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 303 edges. 303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:44,913 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 303 transitions. [2022-04-08 10:13:44,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 10:13:44,914 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:44,914 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:44,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Forceful destruction successful, exit code 0 [2022-04-08 10:13:45,114 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137,136 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:45,114 INFO L403 AbstractCegarLoop]: === Iteration 139 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:45,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:45,115 INFO L85 PathProgramCache]: Analyzing trace with hash -168697395, now seen corresponding path program 267 times [2022-04-08 10:13:45,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:45,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [836728989] [2022-04-08 10:13:45,117 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:45,118 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:45,118 INFO L85 PathProgramCache]: Analyzing trace with hash -168697395, now seen corresponding path program 268 times [2022-04-08 10:13:45,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:45,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008493713] [2022-04-08 10:13:45,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:45,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:45,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:13:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:45,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {178994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {178967#true} is VALID [2022-04-08 10:13:45,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {178967#true} assume true; {178967#true} is VALID [2022-04-08 10:13:45,511 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {178967#true} {178967#true} #61#return; {178967#true} is VALID [2022-04-08 10:13:45,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {178967#true} call ULTIMATE.init(); {178994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:13:45,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {178994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {178967#true} is VALID [2022-04-08 10:13:45,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {178967#true} assume true; {178967#true} is VALID [2022-04-08 10:13:45,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {178967#true} {178967#true} #61#return; {178967#true} is VALID [2022-04-08 10:13:45,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {178967#true} call #t~ret11 := main(); {178967#true} is VALID [2022-04-08 10:13:45,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {178967#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {178972#(= main_~y~0 0)} is VALID [2022-04-08 10:13:45,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {178972#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178973#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:45,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {178973#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178974#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:45,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {178974#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178975#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:45,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {178975#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178976#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:45,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {178976#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178977#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:45,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {178977#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178978#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:45,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {178978#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178979#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:45,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {178979#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178980#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:45,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {178980#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178981#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:45,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {178981#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178982#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:45,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {178982#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178983#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:13:45,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {178983#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178984#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:13:45,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {178984#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178985#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:45,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {178985#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178986#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:13:45,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {178986#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178987#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:13:45,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {178987#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178988#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:13:45,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {178988#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {178988#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:13:45,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {178988#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {178989#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:13:45,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {178989#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {178990#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:13:45,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {178990#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {178991#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:13:45,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {178991#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {178992#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:13:45,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {178992#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {178993#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-08 10:13:45,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {178993#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {178968#false} is VALID [2022-04-08 10:13:45,523 INFO L290 TraceCheckUtils]: 29: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,523 INFO L290 TraceCheckUtils]: 30: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,523 INFO L290 TraceCheckUtils]: 32: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,523 INFO L290 TraceCheckUtils]: 33: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,523 INFO L290 TraceCheckUtils]: 35: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,523 INFO L290 TraceCheckUtils]: 36: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,524 INFO L290 TraceCheckUtils]: 38: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,524 INFO L290 TraceCheckUtils]: 39: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,524 INFO L290 TraceCheckUtils]: 40: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,524 INFO L290 TraceCheckUtils]: 41: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,524 INFO L290 TraceCheckUtils]: 42: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,524 INFO L290 TraceCheckUtils]: 43: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,524 INFO L290 TraceCheckUtils]: 44: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,524 INFO L290 TraceCheckUtils]: 45: Hoare triple {178968#false} assume !(~y~0 % 4294967296 > 0); {178968#false} is VALID [2022-04-08 10:13:45,524 INFO L272 TraceCheckUtils]: 46: Hoare triple {178968#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {178968#false} is VALID [2022-04-08 10:13:45,524 INFO L290 TraceCheckUtils]: 47: Hoare triple {178968#false} ~cond := #in~cond; {178968#false} is VALID [2022-04-08 10:13:45,524 INFO L290 TraceCheckUtils]: 48: Hoare triple {178968#false} assume 0 == ~cond; {178968#false} is VALID [2022-04-08 10:13:45,524 INFO L290 TraceCheckUtils]: 49: Hoare triple {178968#false} assume !false; {178968#false} is VALID [2022-04-08 10:13:45,524 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-08 10:13:45,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:13:45,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008493713] [2022-04-08 10:13:45,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008493713] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:13:45,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846790158] [2022-04-08 10:13:45,525 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:13:45,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:45,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:13:45,526 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:13:45,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2022-04-08 10:13:45,580 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:13:45,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:13:45,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:13:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:45,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:13:45,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {178967#true} call ULTIMATE.init(); {178967#true} is VALID [2022-04-08 10:13:45,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {178967#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {178967#true} is VALID [2022-04-08 10:13:45,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {178967#true} assume true; {178967#true} is VALID [2022-04-08 10:13:45,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {178967#true} {178967#true} #61#return; {178967#true} is VALID [2022-04-08 10:13:45,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {178967#true} call #t~ret11 := main(); {178967#true} is VALID [2022-04-08 10:13:45,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {178967#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {178972#(= main_~y~0 0)} is VALID [2022-04-08 10:13:45,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {178972#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178973#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:45,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {178973#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178974#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:45,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {178974#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178975#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:45,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {178975#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178976#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:45,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {178976#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178977#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:45,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {178977#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178978#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:45,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {178978#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178979#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:45,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {178979#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178980#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:45,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {178980#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178981#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:45,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {178981#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178982#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:45,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {178982#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178983#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:13:45,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {178983#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178984#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:13:45,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {178984#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178985#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:45,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {178985#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178986#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:13:45,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {178986#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178987#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:13:45,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {178987#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {178988#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:13:45,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {178988#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {178988#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:13:45,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {178988#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {178989#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:13:45,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {178989#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {178990#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:13:45,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {178990#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {178991#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:13:45,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {178991#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {178992#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:13:45,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {178992#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {179079#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:13:45,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {179079#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {178968#false} is VALID [2022-04-08 10:13:45,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,949 INFO L290 TraceCheckUtils]: 31: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,949 INFO L290 TraceCheckUtils]: 35: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,950 INFO L290 TraceCheckUtils]: 39: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,950 INFO L290 TraceCheckUtils]: 40: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,950 INFO L290 TraceCheckUtils]: 41: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,950 INFO L290 TraceCheckUtils]: 42: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,950 INFO L290 TraceCheckUtils]: 43: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,950 INFO L290 TraceCheckUtils]: 44: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:45,950 INFO L290 TraceCheckUtils]: 45: Hoare triple {178968#false} assume !(~y~0 % 4294967296 > 0); {178968#false} is VALID [2022-04-08 10:13:45,950 INFO L272 TraceCheckUtils]: 46: Hoare triple {178968#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {178968#false} is VALID [2022-04-08 10:13:45,950 INFO L290 TraceCheckUtils]: 47: Hoare triple {178968#false} ~cond := #in~cond; {178968#false} is VALID [2022-04-08 10:13:45,950 INFO L290 TraceCheckUtils]: 48: Hoare triple {178968#false} assume 0 == ~cond; {178968#false} is VALID [2022-04-08 10:13:45,950 INFO L290 TraceCheckUtils]: 49: Hoare triple {178968#false} assume !false; {178968#false} is VALID [2022-04-08 10:13:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-08 10:13:45,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:13:46,739 INFO L290 TraceCheckUtils]: 49: Hoare triple {178968#false} assume !false; {178968#false} is VALID [2022-04-08 10:13:46,739 INFO L290 TraceCheckUtils]: 48: Hoare triple {178968#false} assume 0 == ~cond; {178968#false} is VALID [2022-04-08 10:13:46,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {178968#false} ~cond := #in~cond; {178968#false} is VALID [2022-04-08 10:13:46,740 INFO L272 TraceCheckUtils]: 46: Hoare triple {178968#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {178968#false} is VALID [2022-04-08 10:13:46,740 INFO L290 TraceCheckUtils]: 45: Hoare triple {178968#false} assume !(~y~0 % 4294967296 > 0); {178968#false} is VALID [2022-04-08 10:13:46,740 INFO L290 TraceCheckUtils]: 44: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:46,740 INFO L290 TraceCheckUtils]: 43: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:46,740 INFO L290 TraceCheckUtils]: 42: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:46,740 INFO L290 TraceCheckUtils]: 41: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:46,740 INFO L290 TraceCheckUtils]: 40: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:46,740 INFO L290 TraceCheckUtils]: 39: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:46,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:46,740 INFO L290 TraceCheckUtils]: 37: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:46,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:46,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:46,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:46,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:46,740 INFO L290 TraceCheckUtils]: 32: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:46,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:46,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:46,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-08 10:13:46,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {179209#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {178968#false} is VALID [2022-04-08 10:13:46,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {179213#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {179209#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:13:46,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {179217#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {179213#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:13:46,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {179221#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {179217#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:13:46,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {179225#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {179221#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:13:46,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {179229#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {179225#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:13:46,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {179229#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {179229#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:46,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {179236#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179229#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:46,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {179240#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179236#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:13:46,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {179244#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179240#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:13:46,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {179248#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179244#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:13:46,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {179252#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179248#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:13:46,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {179256#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179252#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:13:46,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {179260#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179256#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:13:46,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {179264#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179260#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:13:46,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {179268#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179264#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:13:46,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {179272#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179268#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:46,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {179276#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179272#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:13:46,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {179280#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179276#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:46,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {179284#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179280#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:13:46,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {179288#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179284#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:13:46,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {179292#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179288#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:13:46,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {179296#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179292#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:13:46,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {178967#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {179296#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:13:46,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {178967#true} call #t~ret11 := main(); {178967#true} is VALID [2022-04-08 10:13:46,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {178967#true} {178967#true} #61#return; {178967#true} is VALID [2022-04-08 10:13:46,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {178967#true} assume true; {178967#true} is VALID [2022-04-08 10:13:46,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {178967#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {178967#true} is VALID [2022-04-08 10:13:46,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {178967#true} call ULTIMATE.init(); {178967#true} is VALID [2022-04-08 10:13:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-08 10:13:46,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846790158] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:13:46,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:13:46,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-08 10:13:46,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:13:46,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [836728989] [2022-04-08 10:13:46,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [836728989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:13:46,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:13:46,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:13:46,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729767805] [2022-04-08 10:13:46,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:13:46,756 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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 50 [2022-04-08 10:13:46,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:13:46,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:13:46,778 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-08 10:13:46,778 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:13:46,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:46,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:13:46,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=1844, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:13:46,779 INFO L87 Difference]: Start difference. First operand 236 states and 303 transitions. Second operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:13:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:50,610 INFO L93 Difference]: Finished difference Result 277 states and 344 transitions. [2022-04-08 10:13:50,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-08 10:13:50,610 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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 50 [2022-04-08 10:13:50,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:13:50,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:13:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 94 transitions. [2022-04-08 10:13:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:13:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 94 transitions. [2022-04-08 10:13:50,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 94 transitions. [2022-04-08 10:13:50,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:50,691 INFO L225 Difference]: With dead ends: 277 [2022-04-08 10:13:50,691 INFO L226 Difference]: Without dead ends: 255 [2022-04-08 10:13:50,692 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1204, Invalid=5116, Unknown=0, NotChecked=0, Total=6320 [2022-04-08 10:13:50,692 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 44 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:13:50,692 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 136 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-08 10:13:50,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-04-08 10:13:51,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 237. [2022-04-08 10:13:51,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:13:51,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 255 states. Second operand has 237 states, 232 states have (on average 1.293103448275862) internal successors, (300), 232 states have internal predecessors, (300), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:51,676 INFO L74 IsIncluded]: Start isIncluded. First operand 255 states. Second operand has 237 states, 232 states have (on average 1.293103448275862) internal successors, (300), 232 states have internal predecessors, (300), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:51,676 INFO L87 Difference]: Start difference. First operand 255 states. Second operand has 237 states, 232 states have (on average 1.293103448275862) internal successors, (300), 232 states have internal predecessors, (300), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:51,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:51,679 INFO L93 Difference]: Finished difference Result 255 states and 322 transitions. [2022-04-08 10:13:51,679 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 322 transitions. [2022-04-08 10:13:51,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:51,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:51,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 237 states, 232 states have (on average 1.293103448275862) internal successors, (300), 232 states have internal predecessors, (300), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 255 states. [2022-04-08 10:13:51,679 INFO L87 Difference]: Start difference. First operand has 237 states, 232 states have (on average 1.293103448275862) internal successors, (300), 232 states have internal predecessors, (300), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 255 states. [2022-04-08 10:13:51,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:51,682 INFO L93 Difference]: Finished difference Result 255 states and 322 transitions. [2022-04-08 10:13:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 322 transitions. [2022-04-08 10:13:51,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:51,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:51,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:13:51,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:13:51,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 232 states have (on average 1.293103448275862) internal successors, (300), 232 states have internal predecessors, (300), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 304 transitions. [2022-04-08 10:13:51,686 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 304 transitions. Word has length 50 [2022-04-08 10:13:51,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:13:51,686 INFO L478 AbstractCegarLoop]: Abstraction has 237 states and 304 transitions. [2022-04-08 10:13:51,686 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-08 10:13:51,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 237 states and 304 transitions. [2022-04-08 10:13:52,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 304 edges. 304 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:52,763 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 304 transitions. [2022-04-08 10:13:52,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 10:13:52,763 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:52,763 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:52,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Ended with exit code 0 [2022-04-08 10:13:52,964 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 137 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable138 [2022-04-08 10:13:52,964 INFO L403 AbstractCegarLoop]: === Iteration 140 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:52,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:52,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1351555201, now seen corresponding path program 269 times [2022-04-08 10:13:52,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:52,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1527601740] [2022-04-08 10:13:52,966 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:52,966 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:52,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1351555201, now seen corresponding path program 270 times [2022-04-08 10:13:52,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:52,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038242627] [2022-04-08 10:13:52,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:52,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:53,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:13:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:53,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {180945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {180919#true} is VALID [2022-04-08 10:13:53,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {180919#true} assume true; {180919#true} is VALID [2022-04-08 10:13:53,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {180919#true} {180919#true} #61#return; {180919#true} is VALID [2022-04-08 10:13:53,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {180919#true} call ULTIMATE.init(); {180945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:13:53,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {180945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {180919#true} is VALID [2022-04-08 10:13:53,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {180919#true} assume true; {180919#true} is VALID [2022-04-08 10:13:53,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180919#true} {180919#true} #61#return; {180919#true} is VALID [2022-04-08 10:13:53,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {180919#true} call #t~ret11 := main(); {180919#true} is VALID [2022-04-08 10:13:53,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {180919#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {180924#(= main_~y~0 0)} is VALID [2022-04-08 10:13:53,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {180924#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180925#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:53,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {180925#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180926#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:53,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {180926#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180927#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:53,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {180927#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180928#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:53,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {180928#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180929#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:53,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {180929#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180930#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:53,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {180930#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180931#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:53,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {180931#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180932#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:53,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {180932#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180933#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:53,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {180933#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180934#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:53,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {180934#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180935#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:13:53,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {180935#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180936#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:13:53,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {180936#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180937#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:53,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {180937#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180938#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:13:53,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {180938#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180939#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:13:53,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {180939#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180940#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:13:53,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {180940#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180941#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:13:53,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {180941#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {180941#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:13:53,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {180941#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {180942#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:13:53,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {180942#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {180943#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:13:53,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {180943#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {180944#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID [2022-04-08 10:13:53,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {180944#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {180920#false} is VALID [2022-04-08 10:13:53,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,361 INFO L290 TraceCheckUtils]: 29: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,362 INFO L290 TraceCheckUtils]: 33: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,362 INFO L290 TraceCheckUtils]: 34: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,362 INFO L290 TraceCheckUtils]: 35: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,362 INFO L290 TraceCheckUtils]: 37: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,362 INFO L290 TraceCheckUtils]: 38: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,362 INFO L290 TraceCheckUtils]: 39: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,362 INFO L290 TraceCheckUtils]: 40: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,362 INFO L290 TraceCheckUtils]: 41: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,362 INFO L290 TraceCheckUtils]: 43: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,362 INFO L290 TraceCheckUtils]: 45: Hoare triple {180920#false} assume !(~y~0 % 4294967296 > 0); {180920#false} is VALID [2022-04-08 10:13:53,362 INFO L272 TraceCheckUtils]: 46: Hoare triple {180920#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {180920#false} is VALID [2022-04-08 10:13:53,362 INFO L290 TraceCheckUtils]: 47: Hoare triple {180920#false} ~cond := #in~cond; {180920#false} is VALID [2022-04-08 10:13:53,362 INFO L290 TraceCheckUtils]: 48: Hoare triple {180920#false} assume 0 == ~cond; {180920#false} is VALID [2022-04-08 10:13:53,363 INFO L290 TraceCheckUtils]: 49: Hoare triple {180920#false} assume !false; {180920#false} is VALID [2022-04-08 10:13:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-08 10:13:53,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:13:53,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038242627] [2022-04-08 10:13:53,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038242627] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:13:53,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068741649] [2022-04-08 10:13:53,363 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:13:53,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:53,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:13:53,364 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:13:53,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Waiting until timeout for monitored process [2022-04-08 10:13:53,582 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:13:53,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:13:53,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 10:13:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:53,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:13:53,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {180919#true} call ULTIMATE.init(); {180919#true} is VALID [2022-04-08 10:13:53,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {180919#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {180919#true} is VALID [2022-04-08 10:13:53,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {180919#true} assume true; {180919#true} is VALID [2022-04-08 10:13:53,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180919#true} {180919#true} #61#return; {180919#true} is VALID [2022-04-08 10:13:53,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {180919#true} call #t~ret11 := main(); {180919#true} is VALID [2022-04-08 10:13:53,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {180919#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {180919#true} is VALID [2022-04-08 10:13:53,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:53,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:53,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:53,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:53,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:53,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:53,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:53,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:53,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:53,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:53,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:53,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:53,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:53,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:53,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:53,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:53,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:53,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {180919#true} assume !(~x~0 % 4294967296 > 0); {180919#true} is VALID [2022-04-08 10:13:53,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {180919#true} ~z~0 := ~y~0; {181021#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:13:53,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {181021#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {181025#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:13:53,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {181025#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {181029#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-08 10:13:53,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {181029#(= main_~y~0 (+ main_~z~0 2))} assume !(~z~0 % 4294967296 > 0); {181033#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:13:53,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {181033#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {181037#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:13:53,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {181037#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {181041#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:13:53,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {181041#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,812 INFO L290 TraceCheckUtils]: 38: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,812 INFO L290 TraceCheckUtils]: 39: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,812 INFO L290 TraceCheckUtils]: 40: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,812 INFO L290 TraceCheckUtils]: 41: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,812 INFO L290 TraceCheckUtils]: 42: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,812 INFO L290 TraceCheckUtils]: 43: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:53,812 INFO L290 TraceCheckUtils]: 45: Hoare triple {180920#false} assume !(~y~0 % 4294967296 > 0); {180920#false} is VALID [2022-04-08 10:13:53,812 INFO L272 TraceCheckUtils]: 46: Hoare triple {180920#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {180920#false} is VALID [2022-04-08 10:13:53,812 INFO L290 TraceCheckUtils]: 47: Hoare triple {180920#false} ~cond := #in~cond; {180920#false} is VALID [2022-04-08 10:13:53,812 INFO L290 TraceCheckUtils]: 48: Hoare triple {180920#false} assume 0 == ~cond; {180920#false} is VALID [2022-04-08 10:13:53,812 INFO L290 TraceCheckUtils]: 49: Hoare triple {180920#false} assume !false; {180920#false} is VALID [2022-04-08 10:13:53,812 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-04-08 10:13:53,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:13:54,018 INFO L290 TraceCheckUtils]: 49: Hoare triple {180920#false} assume !false; {180920#false} is VALID [2022-04-08 10:13:54,018 INFO L290 TraceCheckUtils]: 48: Hoare triple {180920#false} assume 0 == ~cond; {180920#false} is VALID [2022-04-08 10:13:54,018 INFO L290 TraceCheckUtils]: 47: Hoare triple {180920#false} ~cond := #in~cond; {180920#false} is VALID [2022-04-08 10:13:54,018 INFO L272 TraceCheckUtils]: 46: Hoare triple {180920#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {180920#false} is VALID [2022-04-08 10:13:54,018 INFO L290 TraceCheckUtils]: 45: Hoare triple {180920#false} assume !(~y~0 % 4294967296 > 0); {180920#false} is VALID [2022-04-08 10:13:54,018 INFO L290 TraceCheckUtils]: 44: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:54,018 INFO L290 TraceCheckUtils]: 43: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:54,018 INFO L290 TraceCheckUtils]: 42: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:54,018 INFO L290 TraceCheckUtils]: 41: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:54,019 INFO L290 TraceCheckUtils]: 40: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:54,019 INFO L290 TraceCheckUtils]: 39: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:54,019 INFO L290 TraceCheckUtils]: 38: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:54,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:54,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:54,019 INFO L290 TraceCheckUtils]: 35: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:54,019 INFO L290 TraceCheckUtils]: 34: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:54,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:54,019 INFO L290 TraceCheckUtils]: 32: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:54,019 INFO L290 TraceCheckUtils]: 31: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:54,019 INFO L290 TraceCheckUtils]: 30: Hoare triple {181041#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-08 10:13:54,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {181037#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {181041#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:13:54,021 INFO L290 TraceCheckUtils]: 28: Hoare triple {181033#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {181037#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:13:54,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {181168#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {181033#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:13:54,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {181172#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {181168#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:13:54,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {181176#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {181172#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:13:54,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {180919#true} ~z~0 := ~y~0; {181176#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:13:54,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {180919#true} assume !(~x~0 % 4294967296 > 0); {180919#true} is VALID [2022-04-08 10:13:54,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:54,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:54,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:54,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:54,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:54,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:54,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:54,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:54,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:54,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:54,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:54,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:54,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:54,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:54,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:54,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:54,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {180919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {180919#true} is VALID [2022-04-08 10:13:54,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {180919#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {180919#true} is VALID [2022-04-08 10:13:54,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {180919#true} call #t~ret11 := main(); {180919#true} is VALID [2022-04-08 10:13:54,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180919#true} {180919#true} #61#return; {180919#true} is VALID [2022-04-08 10:13:54,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {180919#true} assume true; {180919#true} is VALID [2022-04-08 10:13:54,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {180919#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {180919#true} is VALID [2022-04-08 10:13:54,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {180919#true} call ULTIMATE.init(); {180919#true} is VALID [2022-04-08 10:13:54,025 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-04-08 10:13:54,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068741649] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:13:54,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:13:54,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8, 8] total 33 [2022-04-08 10:13:54,026 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:13:54,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1527601740] [2022-04-08 10:13:54,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1527601740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:13:54,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:13:54,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:13:54,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550795760] [2022-04-08 10:13:54,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:13:54,026 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 10:13:54,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:13:54,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:54,048 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-08 10:13:54,048 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:13:54,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:54,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:13:54,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 10:13:54,049 INFO L87 Difference]: Start difference. First operand 237 states and 304 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:57,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:57,431 INFO L93 Difference]: Finished difference Result 280 states and 347 transitions. [2022-04-08 10:13:57,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 10:13:57,431 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 10:13:57,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:13:57,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 91 transitions. [2022-04-08 10:13:57,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 91 transitions. [2022-04-08 10:13:57,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 91 transitions. [2022-04-08 10:13:57,505 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-08 10:13:57,508 INFO L225 Difference]: With dead ends: 280 [2022-04-08 10:13:57,508 INFO L226 Difference]: Without dead ends: 257 [2022-04-08 10:13:57,508 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=227, Invalid=2965, Unknown=0, NotChecked=0, Total=3192 [2022-04-08 10:13:57,508 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 53 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:13:57,508 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 124 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:13:57,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-08 10:13:58,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 238. [2022-04-08 10:13:58,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:13:58,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 238 states, 233 states have (on average 1.2918454935622317) internal successors, (301), 233 states have internal predecessors, (301), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:58,481 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 238 states, 233 states have (on average 1.2918454935622317) internal successors, (301), 233 states have internal predecessors, (301), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:58,481 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 238 states, 233 states have (on average 1.2918454935622317) internal successors, (301), 233 states have internal predecessors, (301), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:58,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:58,484 INFO L93 Difference]: Finished difference Result 257 states and 324 transitions. [2022-04-08 10:13:58,484 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 324 transitions. [2022-04-08 10:13:58,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:58,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:58,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 238 states, 233 states have (on average 1.2918454935622317) internal successors, (301), 233 states have internal predecessors, (301), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-08 10:13:58,484 INFO L87 Difference]: Start difference. First operand has 238 states, 233 states have (on average 1.2918454935622317) internal successors, (301), 233 states have internal predecessors, (301), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-08 10:13:58,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:58,487 INFO L93 Difference]: Finished difference Result 257 states and 324 transitions. [2022-04-08 10:13:58,487 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 324 transitions. [2022-04-08 10:13:58,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:58,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:58,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:13:58,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:13:58,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 233 states have (on average 1.2918454935622317) internal successors, (301), 233 states have internal predecessors, (301), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:58,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 305 transitions. [2022-04-08 10:13:58,490 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 305 transitions. Word has length 50 [2022-04-08 10:13:58,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:13:58,490 INFO L478 AbstractCegarLoop]: Abstraction has 238 states and 305 transitions. [2022-04-08 10:13:58,490 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:58,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 238 states and 305 transitions. [2022-04-08 10:13:59,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 305 edges. 305 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 305 transitions. [2022-04-08 10:13:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 10:13:59,343 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:59,343 INFO L499 BasicCegarLoop]: trace histogram [33, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:59,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Ended with exit code 0 [2022-04-08 10:13:59,544 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 138 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable139 [2022-04-08 10:13:59,544 INFO L403 AbstractCegarLoop]: === Iteration 141 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:59,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:59,544 INFO L85 PathProgramCache]: Analyzing trace with hash -233610738, now seen corresponding path program 271 times [2022-04-08 10:13:59,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:59,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1878908840] [2022-04-08 10:13:59,547 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:59,547 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:59,547 INFO L85 PathProgramCache]: Analyzing trace with hash -233610738, now seen corresponding path program 272 times [2022-04-08 10:13:59,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:59,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394051752] [2022-04-08 10:13:59,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:59,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:00,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:14:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:00,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {182893#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {182852#true} is VALID [2022-04-08 10:14:00,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {182852#true} assume true; {182852#true} is VALID [2022-04-08 10:14:00,318 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {182852#true} {182852#true} #61#return; {182852#true} is VALID [2022-04-08 10:14:00,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {182852#true} call ULTIMATE.init(); {182893#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:14:00,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {182893#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {182852#true} is VALID [2022-04-08 10:14:00,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {182852#true} assume true; {182852#true} is VALID [2022-04-08 10:14:00,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {182852#true} {182852#true} #61#return; {182852#true} is VALID [2022-04-08 10:14:00,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {182852#true} call #t~ret11 := main(); {182852#true} is VALID [2022-04-08 10:14:00,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {182852#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {182857#(= main_~y~0 0)} is VALID [2022-04-08 10:14:00,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {182857#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182858#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:00,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {182858#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182859#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:00,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {182859#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182860#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:00,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {182860#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182861#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:00,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {182861#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182862#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:00,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {182862#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182863#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:00,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {182863#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182864#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:00,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {182864#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182865#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:00,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {182865#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:00,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {182866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182867#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:14:00,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {182867#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182868#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:14:00,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {182868#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182869#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:00,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {182869#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182870#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:00,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {182870#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182871#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:14:00,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {182871#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182872#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:14:00,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {182872#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182873#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:14:00,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {182873#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182874#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:14:00,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {182874#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182875#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:14:00,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {182875#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182876#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:14:00,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {182876#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182877#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:14:00,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {182877#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182878#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:14:00,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {182878#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182879#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:14:00,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {182879#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182880#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:14:00,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {182880#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182881#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:14:00,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {182881#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182882#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:14:00,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {182882#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182883#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:14:00,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {182883#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182884#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:14:00,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {182884#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182885#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-08 10:14:00,333 INFO L290 TraceCheckUtils]: 34: Hoare triple {182885#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182886#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-08 10:14:00,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {182886#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182887#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-08 10:14:00,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {182887#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182888#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-08 10:14:00,335 INFO L290 TraceCheckUtils]: 37: Hoare triple {182888#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182889#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-08 10:14:00,335 INFO L290 TraceCheckUtils]: 38: Hoare triple {182889#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182890#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-08 10:14:00,336 INFO L290 TraceCheckUtils]: 39: Hoare triple {182890#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !(~x~0 % 4294967296 > 0); {182890#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-08 10:14:00,336 INFO L290 TraceCheckUtils]: 40: Hoare triple {182890#(and (<= 33 main_~y~0) (<= main_~y~0 33))} ~z~0 := ~y~0; {182891#(and (<= 33 main_~z~0) (<= main_~z~0 33))} is VALID [2022-04-08 10:14:00,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {182891#(and (<= 33 main_~z~0) (<= main_~z~0 33))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {182892#(and (<= 32 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:14:00,337 INFO L290 TraceCheckUtils]: 42: Hoare triple {182892#(and (<= 32 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {182853#false} is VALID [2022-04-08 10:14:00,337 INFO L290 TraceCheckUtils]: 43: Hoare triple {182853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {182853#false} is VALID [2022-04-08 10:14:00,337 INFO L290 TraceCheckUtils]: 44: Hoare triple {182853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {182853#false} is VALID [2022-04-08 10:14:00,337 INFO L290 TraceCheckUtils]: 45: Hoare triple {182853#false} assume !(~y~0 % 4294967296 > 0); {182853#false} is VALID [2022-04-08 10:14:00,337 INFO L272 TraceCheckUtils]: 46: Hoare triple {182853#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {182853#false} is VALID [2022-04-08 10:14:00,337 INFO L290 TraceCheckUtils]: 47: Hoare triple {182853#false} ~cond := #in~cond; {182853#false} is VALID [2022-04-08 10:14:00,337 INFO L290 TraceCheckUtils]: 48: Hoare triple {182853#false} assume 0 == ~cond; {182853#false} is VALID [2022-04-08 10:14:00,337 INFO L290 TraceCheckUtils]: 49: Hoare triple {182853#false} assume !false; {182853#false} is VALID [2022-04-08 10:14:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 562 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:14:00,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:14:00,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394051752] [2022-04-08 10:14:00,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394051752] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:14:00,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878628285] [2022-04-08 10:14:00,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:14:00,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:00,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:14:00,339 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:14:00,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2022-04-08 10:14:00,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:14:00,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:14:00,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-08 10:14:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:00,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:14:00,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {182852#true} call ULTIMATE.init(); {182852#true} is VALID [2022-04-08 10:14:00,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {182852#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {182852#true} is VALID [2022-04-08 10:14:00,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {182852#true} assume true; {182852#true} is VALID [2022-04-08 10:14:00,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {182852#true} {182852#true} #61#return; {182852#true} is VALID [2022-04-08 10:14:00,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {182852#true} call #t~ret11 := main(); {182852#true} is VALID [2022-04-08 10:14:00,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {182852#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {182857#(= main_~y~0 0)} is VALID [2022-04-08 10:14:00,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {182857#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182858#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:00,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {182858#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182859#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:00,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {182859#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182860#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:00,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {182860#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182861#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:00,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {182861#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182862#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:00,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {182862#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182863#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:00,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {182863#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182864#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:00,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {182864#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182865#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:00,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {182865#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:00,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {182866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182867#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:14:00,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {182867#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182868#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:14:00,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {182868#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182869#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:00,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {182869#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182870#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:00,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {182870#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182871#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:14:00,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {182871#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182872#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:14:00,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {182872#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182873#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:14:00,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {182873#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182874#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:14:00,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {182874#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182875#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:14:00,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {182875#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182876#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:14:00,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {182876#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182877#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:14:00,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {182877#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182878#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:14:00,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {182878#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182879#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:14:00,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {182879#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182880#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:14:00,882 INFO L290 TraceCheckUtils]: 29: Hoare triple {182880#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182881#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:14:00,882 INFO L290 TraceCheckUtils]: 30: Hoare triple {182881#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182882#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:14:00,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {182882#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182883#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:14:00,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {182883#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182884#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:14:00,884 INFO L290 TraceCheckUtils]: 33: Hoare triple {182884#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182885#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-08 10:14:00,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {182885#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182886#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-08 10:14:00,885 INFO L290 TraceCheckUtils]: 35: Hoare triple {182886#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182887#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-08 10:14:00,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {182887#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182888#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-08 10:14:00,886 INFO L290 TraceCheckUtils]: 37: Hoare triple {182888#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182889#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-08 10:14:00,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {182889#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182890#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-08 10:14:00,887 INFO L290 TraceCheckUtils]: 39: Hoare triple {182890#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !(~x~0 % 4294967296 > 0); {182890#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-08 10:14:00,887 INFO L290 TraceCheckUtils]: 40: Hoare triple {182890#(and (<= 33 main_~y~0) (<= main_~y~0 33))} ~z~0 := ~y~0; {182891#(and (<= 33 main_~z~0) (<= main_~z~0 33))} is VALID [2022-04-08 10:14:00,888 INFO L290 TraceCheckUtils]: 41: Hoare triple {182891#(and (<= 33 main_~z~0) (<= main_~z~0 33))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183020#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-08 10:14:00,888 INFO L290 TraceCheckUtils]: 42: Hoare triple {183020#(and (<= 32 main_~z~0) (<= main_~z~0 32))} assume !(~z~0 % 4294967296 > 0); {182853#false} is VALID [2022-04-08 10:14:00,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {182853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {182853#false} is VALID [2022-04-08 10:14:00,888 INFO L290 TraceCheckUtils]: 44: Hoare triple {182853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {182853#false} is VALID [2022-04-08 10:14:00,888 INFO L290 TraceCheckUtils]: 45: Hoare triple {182853#false} assume !(~y~0 % 4294967296 > 0); {182853#false} is VALID [2022-04-08 10:14:00,888 INFO L272 TraceCheckUtils]: 46: Hoare triple {182853#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {182853#false} is VALID [2022-04-08 10:14:00,888 INFO L290 TraceCheckUtils]: 47: Hoare triple {182853#false} ~cond := #in~cond; {182853#false} is VALID [2022-04-08 10:14:00,889 INFO L290 TraceCheckUtils]: 48: Hoare triple {182853#false} assume 0 == ~cond; {182853#false} is VALID [2022-04-08 10:14:00,889 INFO L290 TraceCheckUtils]: 49: Hoare triple {182853#false} assume !false; {182853#false} is VALID [2022-04-08 10:14:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 562 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:14:00,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:14:02,802 INFO L290 TraceCheckUtils]: 49: Hoare triple {182853#false} assume !false; {182853#false} is VALID [2022-04-08 10:14:02,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {182853#false} assume 0 == ~cond; {182853#false} is VALID [2022-04-08 10:14:02,802 INFO L290 TraceCheckUtils]: 47: Hoare triple {182853#false} ~cond := #in~cond; {182853#false} is VALID [2022-04-08 10:14:02,802 INFO L272 TraceCheckUtils]: 46: Hoare triple {182853#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {182853#false} is VALID [2022-04-08 10:14:02,802 INFO L290 TraceCheckUtils]: 45: Hoare triple {182853#false} assume !(~y~0 % 4294967296 > 0); {182853#false} is VALID [2022-04-08 10:14:02,802 INFO L290 TraceCheckUtils]: 44: Hoare triple {182853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {182853#false} is VALID [2022-04-08 10:14:02,802 INFO L290 TraceCheckUtils]: 43: Hoare triple {182853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {182853#false} is VALID [2022-04-08 10:14:02,802 INFO L290 TraceCheckUtils]: 42: Hoare triple {183066#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {182853#false} is VALID [2022-04-08 10:14:02,803 INFO L290 TraceCheckUtils]: 41: Hoare triple {183070#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183066#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:14:02,804 INFO L290 TraceCheckUtils]: 40: Hoare triple {183074#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {183070#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:14:02,804 INFO L290 TraceCheckUtils]: 39: Hoare triple {183074#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {183074#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:14:02,805 INFO L290 TraceCheckUtils]: 38: Hoare triple {183081#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183074#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:14:02,805 INFO L290 TraceCheckUtils]: 37: Hoare triple {183085#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183081#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:14:02,806 INFO L290 TraceCheckUtils]: 36: Hoare triple {183089#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183085#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:14:02,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {183093#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183089#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:14:02,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {183097#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183093#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:14:02,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {183101#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183097#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:14:02,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {183105#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183101#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:02,809 INFO L290 TraceCheckUtils]: 31: Hoare triple {183109#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183105#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:14:02,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {183113#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183109#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:02,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {183117#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183113#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:14:02,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {183121#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183117#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:14:02,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {183125#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183121#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:14:02,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {183129#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183125#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:14:02,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {183133#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183129#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:14:02,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {183137#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183133#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:14:02,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {183141#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183137#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:14:02,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {183145#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183141#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:14:02,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {183149#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183145#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:14:02,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {183153#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183149#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:14:02,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {183157#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183153#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:14:02,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {183161#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183157#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:02,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {183165#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183161#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:14:02,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {183169#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183165#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:14:02,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {183173#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183169#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-08 10:14:02,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {183177#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183173#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:02,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {183181#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183177#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-08 10:14:02,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {183185#(< 0 (mod (+ main_~y~0 26) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183181#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-08 10:14:02,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {183189#(< 0 (mod (+ main_~y~0 27) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183185#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-08 10:14:02,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {183193#(< 0 (mod (+ main_~y~0 28) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183189#(< 0 (mod (+ main_~y~0 27) 4294967296))} is VALID [2022-04-08 10:14:02,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {183197#(< 0 (mod (+ 29 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183193#(< 0 (mod (+ main_~y~0 28) 4294967296))} is VALID [2022-04-08 10:14:02,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {183201#(< 0 (mod (+ 30 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183197#(< 0 (mod (+ 29 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:02,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {183205#(< 0 (mod (+ main_~y~0 31) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183201#(< 0 (mod (+ 30 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:02,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {183209#(< 0 (mod (+ 32 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183205#(< 0 (mod (+ main_~y~0 31) 4294967296))} is VALID [2022-04-08 10:14:02,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {182852#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {183209#(< 0 (mod (+ 32 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:02,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {182852#true} call #t~ret11 := main(); {182852#true} is VALID [2022-04-08 10:14:02,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {182852#true} {182852#true} #61#return; {182852#true} is VALID [2022-04-08 10:14:02,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {182852#true} assume true; {182852#true} is VALID [2022-04-08 10:14:02,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {182852#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {182852#true} is VALID [2022-04-08 10:14:02,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {182852#true} call ULTIMATE.init(); {182852#true} is VALID [2022-04-08 10:14:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 562 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:14:02,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878628285] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:14:02,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:14:02,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 76 [2022-04-08 10:14:02,826 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:14:02,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1878908840] [2022-04-08 10:14:02,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1878908840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:14:02,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:14:02,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-08 10:14:02,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449789246] [2022-04-08 10:14:02,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:14:02,826 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 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 50 [2022-04-08 10:14:02,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:14:02,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 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-08 10:14:02,854 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-08 10:14:02,854 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-08 10:14:02,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:02,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-08 10:14:02,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1311, Invalid=4389, Unknown=0, NotChecked=0, Total=5700 [2022-04-08 10:14:02,855 INFO L87 Difference]: Start difference. First operand 238 states and 305 transitions. Second operand has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 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-08 10:14:12,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:12,392 INFO L93 Difference]: Finished difference Result 385 states and 565 transitions. [2022-04-08 10:14:12,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-08 10:14:12,392 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 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 50 [2022-04-08 10:14:12,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:14:12,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 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-08 10:14:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 217 transitions. [2022-04-08 10:14:12,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 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-08 10:14:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 217 transitions. [2022-04-08 10:14:12,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 217 transitions. [2022-04-08 10:14:12,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:12,572 INFO L225 Difference]: With dead ends: 385 [2022-04-08 10:14:12,572 INFO L226 Difference]: Without dead ends: 377 [2022-04-08 10:14:12,573 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2729, Invalid=9927, Unknown=0, NotChecked=0, Total=12656 [2022-04-08 10:14:12,573 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 187 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 5573 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 5716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 5573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:14:12,574 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 251 Invalid, 5716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 5573 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-08 10:14:12,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-08 10:14:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 244. [2022-04-08 10:14:13,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:14:13,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand has 244 states, 239 states have (on average 1.292887029288703) internal successors, (309), 239 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:13,569 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand has 244 states, 239 states have (on average 1.292887029288703) internal successors, (309), 239 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:13,569 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 244 states, 239 states have (on average 1.292887029288703) internal successors, (309), 239 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:13,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:13,574 INFO L93 Difference]: Finished difference Result 377 states and 457 transitions. [2022-04-08 10:14:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 457 transitions. [2022-04-08 10:14:13,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:13,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:13,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 239 states have (on average 1.292887029288703) internal successors, (309), 239 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 377 states. [2022-04-08 10:14:13,574 INFO L87 Difference]: Start difference. First operand has 244 states, 239 states have (on average 1.292887029288703) internal successors, (309), 239 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 377 states. [2022-04-08 10:14:13,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:13,579 INFO L93 Difference]: Finished difference Result 377 states and 457 transitions. [2022-04-08 10:14:13,579 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 457 transitions. [2022-04-08 10:14:13,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:13,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:13,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:14:13,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:14:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 239 states have (on average 1.292887029288703) internal successors, (309), 239 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:13,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 313 transitions. [2022-04-08 10:14:13,582 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 313 transitions. Word has length 50 [2022-04-08 10:14:13,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:14:13,583 INFO L478 AbstractCegarLoop]: Abstraction has 244 states and 313 transitions. [2022-04-08 10:14:13,583 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 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-08 10:14:13,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 244 states and 313 transitions. [2022-04-08 10:14:14,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:14,447 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 313 transitions. [2022-04-08 10:14:14,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 10:14:14,447 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:14:14,448 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:14:14,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Ended with exit code 0 [2022-04-08 10:14:14,648 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,139 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:14,648 INFO L403 AbstractCegarLoop]: === Iteration 142 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:14:14,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:14:14,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1735097903, now seen corresponding path program 273 times [2022-04-08 10:14:14,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:14,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1349277204] [2022-04-08 10:14:14,651 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:14:14,651 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:14:14,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1735097903, now seen corresponding path program 274 times [2022-04-08 10:14:14,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:14:14,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878350988] [2022-04-08 10:14:14,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:14:14,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:14:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:15,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:14:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:15,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {185347#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {185316#true} is VALID [2022-04-08 10:14:15,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {185316#true} assume true; {185316#true} is VALID [2022-04-08 10:14:15,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185316#true} {185316#true} #61#return; {185316#true} is VALID [2022-04-08 10:14:15,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {185316#true} call ULTIMATE.init(); {185347#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:14:15,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {185347#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {185316#true} is VALID [2022-04-08 10:14:15,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {185316#true} assume true; {185316#true} is VALID [2022-04-08 10:14:15,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185316#true} {185316#true} #61#return; {185316#true} is VALID [2022-04-08 10:14:15,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {185316#true} call #t~ret11 := main(); {185316#true} is VALID [2022-04-08 10:14:15,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {185316#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {185321#(= main_~y~0 0)} is VALID [2022-04-08 10:14:15,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {185321#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185322#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:15,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {185322#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185323#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:15,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {185323#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185324#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:15,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {185324#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185325#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:15,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {185325#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185326#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:15,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {185326#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:15,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {185327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185328#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:15,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {185328#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185329#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:15,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {185329#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185330#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:15,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {185330#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185331#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:14:15,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {185331#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185332#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:14:15,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {185332#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185333#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:15,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {185333#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {185333#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:15,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {185333#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {185334#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:14:15,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {185334#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185335#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:14:15,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {185335#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185336#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:14:15,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {185336#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185337#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:14:15,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {185337#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185338#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:14:15,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {185338#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185339#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:14:15,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {185339#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185340#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:14:15,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {185340#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185341#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:14:15,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {185341#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185342#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:14:15,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {185342#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185343#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:14:15,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {185343#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185344#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:14:15,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {185344#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185345#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:14:15,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {185345#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185346#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:14:15,133 INFO L290 TraceCheckUtils]: 32: Hoare triple {185346#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185317#false} is VALID [2022-04-08 10:14:15,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {185317#false} assume !(~z~0 % 4294967296 > 0); {185317#false} is VALID [2022-04-08 10:14:15,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,134 INFO L290 TraceCheckUtils]: 41: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,134 INFO L290 TraceCheckUtils]: 42: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,134 INFO L290 TraceCheckUtils]: 43: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,134 INFO L290 TraceCheckUtils]: 44: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,134 INFO L290 TraceCheckUtils]: 45: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,134 INFO L290 TraceCheckUtils]: 46: Hoare triple {185317#false} assume !(~y~0 % 4294967296 > 0); {185317#false} is VALID [2022-04-08 10:14:15,134 INFO L272 TraceCheckUtils]: 47: Hoare triple {185317#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {185317#false} is VALID [2022-04-08 10:14:15,134 INFO L290 TraceCheckUtils]: 48: Hoare triple {185317#false} ~cond := #in~cond; {185317#false} is VALID [2022-04-08 10:14:15,134 INFO L290 TraceCheckUtils]: 49: Hoare triple {185317#false} assume 0 == ~cond; {185317#false} is VALID [2022-04-08 10:14:15,134 INFO L290 TraceCheckUtils]: 50: Hoare triple {185317#false} assume !false; {185317#false} is VALID [2022-04-08 10:14:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 13 proven. 156 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:14:15,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:14:15,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878350988] [2022-04-08 10:14:15,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878350988] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:14:15,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921567381] [2022-04-08 10:14:15,135 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:14:15,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:15,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:14:15,136 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:14:15,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Waiting until timeout for monitored process [2022-04-08 10:14:15,193 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:14:15,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:14:15,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 78 conjunts are in the unsatisfiable core [2022-04-08 10:14:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:15,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:14:15,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {185316#true} call ULTIMATE.init(); {185316#true} is VALID [2022-04-08 10:14:15,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {185316#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {185316#true} is VALID [2022-04-08 10:14:15,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {185316#true} assume true; {185316#true} is VALID [2022-04-08 10:14:15,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185316#true} {185316#true} #61#return; {185316#true} is VALID [2022-04-08 10:14:15,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {185316#true} call #t~ret11 := main(); {185316#true} is VALID [2022-04-08 10:14:15,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {185316#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {185321#(= main_~y~0 0)} is VALID [2022-04-08 10:14:15,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {185321#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185322#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:15,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {185322#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185323#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:15,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {185323#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185324#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:15,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {185324#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185325#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:15,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {185325#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185326#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:15,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {185326#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:15,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {185327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185328#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:15,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {185328#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185329#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:15,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {185329#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185330#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:15,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {185330#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185331#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:14:15,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {185331#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185332#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:14:15,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {185332#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185333#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:15,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {185333#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {185333#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:15,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {185333#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {185408#(and (<= 12 main_~y~0) (= main_~z~0 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:15,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {185408#(and (<= 12 main_~y~0) (= main_~z~0 main_~y~0) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185412#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:14:15,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {185412#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185416#(and (<= 12 main_~y~0) (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:15,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {185416#(and (<= 12 main_~y~0) (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185420#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-08 10:14:15,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {185420#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185424#(and (<= 12 main_~y~0) (= main_~y~0 (+ main_~z~0 4)) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:15,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {185424#(and (<= 12 main_~y~0) (= main_~y~0 (+ main_~z~0 4)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185428#(and (= (+ 5 main_~z~0) main_~y~0) (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:15,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {185428#(and (= (+ 5 main_~z~0) main_~y~0) (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185432#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:15,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {185432#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185436#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:15,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {185436#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185440#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 5)) (+ main_~z~0 3)) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:15,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {185440#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 5)) (+ main_~z~0 3)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185444#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:15,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {185444#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185448#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~z~0 2) (+ main_~y~0 (- 8))))} is VALID [2022-04-08 10:14:15,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {185448#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~z~0 2) (+ main_~y~0 (- 8))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185452#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 10))) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:15,860 INFO L290 TraceCheckUtils]: 31: Hoare triple {185452#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 10))) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185456#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ (- 11) main_~y~0) (+ main_~z~0 1)))} is VALID [2022-04-08 10:14:15,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {185456#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ (- 11) main_~y~0) (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185317#false} is VALID [2022-04-08 10:14:15,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {185317#false} assume !(~z~0 % 4294967296 > 0); {185317#false} is VALID [2022-04-08 10:14:15,861 INFO L290 TraceCheckUtils]: 34: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,861 INFO L290 TraceCheckUtils]: 35: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,861 INFO L290 TraceCheckUtils]: 36: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,861 INFO L290 TraceCheckUtils]: 38: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,861 INFO L290 TraceCheckUtils]: 39: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,861 INFO L290 TraceCheckUtils]: 40: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,862 INFO L290 TraceCheckUtils]: 41: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,862 INFO L290 TraceCheckUtils]: 42: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,862 INFO L290 TraceCheckUtils]: 43: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,862 INFO L290 TraceCheckUtils]: 44: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-08 10:14:15,862 INFO L290 TraceCheckUtils]: 46: Hoare triple {185317#false} assume !(~y~0 % 4294967296 > 0); {185317#false} is VALID [2022-04-08 10:14:15,862 INFO L272 TraceCheckUtils]: 47: Hoare triple {185317#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {185317#false} is VALID [2022-04-08 10:14:15,862 INFO L290 TraceCheckUtils]: 48: Hoare triple {185317#false} ~cond := #in~cond; {185317#false} is VALID [2022-04-08 10:14:15,862 INFO L290 TraceCheckUtils]: 49: Hoare triple {185317#false} assume 0 == ~cond; {185317#false} is VALID [2022-04-08 10:14:15,862 INFO L290 TraceCheckUtils]: 50: Hoare triple {185317#false} assume !false; {185317#false} is VALID [2022-04-08 10:14:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 13 proven. 156 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:14:15,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:14:17,054 INFO L290 TraceCheckUtils]: 50: Hoare triple {185317#false} assume !false; {185317#false} is VALID [2022-04-08 10:14:17,054 INFO L290 TraceCheckUtils]: 49: Hoare triple {185317#false} assume 0 == ~cond; {185317#false} is VALID [2022-04-08 10:14:17,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {185317#false} ~cond := #in~cond; {185317#false} is VALID [2022-04-08 10:14:17,054 INFO L272 TraceCheckUtils]: 47: Hoare triple {185317#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {185317#false} is VALID [2022-04-08 10:14:17,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {185526#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {185317#false} is VALID [2022-04-08 10:14:17,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {185530#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185526#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:14:17,056 INFO L290 TraceCheckUtils]: 44: Hoare triple {185534#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185530#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:14:17,057 INFO L290 TraceCheckUtils]: 43: Hoare triple {185538#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185534#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:14:17,057 INFO L290 TraceCheckUtils]: 42: Hoare triple {185542#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185538#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:14:17,058 INFO L290 TraceCheckUtils]: 41: Hoare triple {185546#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185542#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:17,059 INFO L290 TraceCheckUtils]: 40: Hoare triple {185550#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185546#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:17,060 INFO L290 TraceCheckUtils]: 39: Hoare triple {185554#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185550#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:17,060 INFO L290 TraceCheckUtils]: 38: Hoare triple {185558#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185554#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:14:17,061 INFO L290 TraceCheckUtils]: 37: Hoare triple {185562#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185558#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:17,062 INFO L290 TraceCheckUtils]: 36: Hoare triple {185566#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185562#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:14:17,062 INFO L290 TraceCheckUtils]: 35: Hoare triple {185570#(< 0 (mod (+ main_~y~0 4294967285) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185566#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} is VALID [2022-04-08 10:14:17,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {185574#(< 0 (mod (+ main_~y~0 4294967284) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185570#(< 0 (mod (+ main_~y~0 4294967285) 4294967296))} is VALID [2022-04-08 10:14:17,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {185574#(< 0 (mod (+ main_~y~0 4294967284) 4294967296))} assume !(~z~0 % 4294967296 > 0); {185574#(< 0 (mod (+ main_~y~0 4294967284) 4294967296))} is VALID [2022-04-08 10:14:17,064 INFO L290 TraceCheckUtils]: 32: Hoare triple {185581#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185574#(< 0 (mod (+ main_~y~0 4294967284) 4294967296))} is VALID [2022-04-08 10:14:17,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {185585#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967284) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185581#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-08 10:14:17,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {185589#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185585#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967284) 4294967296)))} is VALID [2022-04-08 10:14:17,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {185593#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967284) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185589#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:14:17,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {185597#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185593#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967284) 4294967296)))} is VALID [2022-04-08 10:14:17,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {185601#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185597#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:14:17,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {185605#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185601#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:14:17,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {185609#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185605#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:14:17,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {185613#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185609#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-08 10:14:17,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {185617#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185613#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:14:17,072 INFO L290 TraceCheckUtils]: 22: Hoare triple {185621#(or (not (< 0 (mod (+ main_~z~0 4294967286) 4294967296))) (< 0 (mod (+ main_~y~0 4294967284) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185617#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))))} is VALID [2022-04-08 10:14:17,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {185625#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967285) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185621#(or (not (< 0 (mod (+ main_~z~0 4294967286) 4294967296))) (< 0 (mod (+ main_~y~0 4294967284) 4294967296)))} is VALID [2022-04-08 10:14:17,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {185629#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967284) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185625#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967285) 4294967296))))} is VALID [2022-04-08 10:14:17,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {185316#true} ~z~0 := ~y~0; {185629#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967284) 4294967296))))} is VALID [2022-04-08 10:14:17,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {185316#true} assume !(~x~0 % 4294967296 > 0); {185316#true} is VALID [2022-04-08 10:14:17,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {185316#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185316#true} is VALID [2022-04-08 10:14:17,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {185316#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185316#true} is VALID [2022-04-08 10:14:17,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {185316#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185316#true} is VALID [2022-04-08 10:14:17,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {185316#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185316#true} is VALID [2022-04-08 10:14:17,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {185316#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185316#true} is VALID [2022-04-08 10:14:17,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {185316#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185316#true} is VALID [2022-04-08 10:14:17,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {185316#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185316#true} is VALID [2022-04-08 10:14:17,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {185316#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185316#true} is VALID [2022-04-08 10:14:17,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {185316#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185316#true} is VALID [2022-04-08 10:14:17,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {185316#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185316#true} is VALID [2022-04-08 10:14:17,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {185316#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185316#true} is VALID [2022-04-08 10:14:17,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {185316#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {185316#true} is VALID [2022-04-08 10:14:17,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {185316#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {185316#true} is VALID [2022-04-08 10:14:17,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {185316#true} call #t~ret11 := main(); {185316#true} is VALID [2022-04-08 10:14:17,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185316#true} {185316#true} #61#return; {185316#true} is VALID [2022-04-08 10:14:17,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {185316#true} assume true; {185316#true} is VALID [2022-04-08 10:14:17,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {185316#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {185316#true} is VALID [2022-04-08 10:14:17,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {185316#true} call ULTIMATE.init(); {185316#true} is VALID [2022-04-08 10:14:17,075 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 13 proven. 156 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:14:17,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921567381] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:14:17,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:14:17,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 68 [2022-04-08 10:14:17,076 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:14:17,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1349277204] [2022-04-08 10:14:17,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1349277204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:14:17,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:14:17,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-08 10:14:17,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705947150] [2022-04-08 10:14:17,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:14:17,076 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-08 10:14:17,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:14:17,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:17,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:17,103 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-08 10:14:17,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:17,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-08 10:14:17,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=3890, Unknown=0, NotChecked=0, Total=4556 [2022-04-08 10:14:17,104 INFO L87 Difference]: Start difference. First operand 244 states and 313 transitions. Second operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:19,926 INFO L93 Difference]: Finished difference Result 262 states and 330 transitions. [2022-04-08 10:14:19,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 10:14:19,927 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-08 10:14:19,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:14:19,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 53 transitions. [2022-04-08 10:14:19,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 53 transitions. [2022-04-08 10:14:19,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 53 transitions. [2022-04-08 10:14:19,965 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-08 10:14:19,967 INFO L225 Difference]: With dead ends: 262 [2022-04-08 10:14:19,967 INFO L226 Difference]: Without dead ends: 229 [2022-04-08 10:14:19,968 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1534 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1290, Invalid=7452, Unknown=0, NotChecked=0, Total=8742 [2022-04-08 10:14:19,968 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:14:19,969 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 146 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:14:19,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-04-08 10:14:20,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2022-04-08 10:14:20,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:14:20,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand has 229 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 224 states have internal predecessors, (292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:20,857 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand has 229 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 224 states have internal predecessors, (292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:20,857 INFO L87 Difference]: Start difference. First operand 229 states. Second operand has 229 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 224 states have internal predecessors, (292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:20,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:20,860 INFO L93 Difference]: Finished difference Result 229 states and 296 transitions. [2022-04-08 10:14:20,860 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 296 transitions. [2022-04-08 10:14:20,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:20,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:20,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 224 states have internal predecessors, (292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 229 states. [2022-04-08 10:14:20,860 INFO L87 Difference]: Start difference. First operand has 229 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 224 states have internal predecessors, (292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 229 states. [2022-04-08 10:14:20,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:20,863 INFO L93 Difference]: Finished difference Result 229 states and 296 transitions. [2022-04-08 10:14:20,863 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 296 transitions. [2022-04-08 10:14:20,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:20,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:20,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:14:20,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:14:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 224 states have internal predecessors, (292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 296 transitions. [2022-04-08 10:14:20,866 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 296 transitions. Word has length 51 [2022-04-08 10:14:20,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:14:20,866 INFO L478 AbstractCegarLoop]: Abstraction has 229 states and 296 transitions. [2022-04-08 10:14:20,866 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:20,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 296 transitions. [2022-04-08 10:14:21,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 296 transitions. [2022-04-08 10:14:21,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 10:14:21,668 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:14:21,668 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:14:21,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Ended with exit code 0 [2022-04-08 10:14:21,868 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141,140 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:21,868 INFO L403 AbstractCegarLoop]: === Iteration 143 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:14:21,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:14:21,868 INFO L85 PathProgramCache]: Analyzing trace with hash -706861889, now seen corresponding path program 275 times [2022-04-08 10:14:21,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:21,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [984235457] [2022-04-08 10:14:21,870 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:14:21,870 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:14:21,871 INFO L85 PathProgramCache]: Analyzing trace with hash -706861889, now seen corresponding path program 276 times [2022-04-08 10:14:21,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:14:21,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061873566] [2022-04-08 10:14:21,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:14:21,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:14:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:22,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:14:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:22,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {187215#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {187184#true} is VALID [2022-04-08 10:14:22,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {187184#true} assume true; {187184#true} is VALID [2022-04-08 10:14:22,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {187184#true} {187184#true} #61#return; {187184#true} is VALID [2022-04-08 10:14:22,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {187184#true} call ULTIMATE.init(); {187215#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:14:22,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {187215#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {187184#true} is VALID [2022-04-08 10:14:22,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {187184#true} assume true; {187184#true} is VALID [2022-04-08 10:14:22,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {187184#true} {187184#true} #61#return; {187184#true} is VALID [2022-04-08 10:14:22,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {187184#true} call #t~ret11 := main(); {187184#true} is VALID [2022-04-08 10:14:22,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {187184#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {187189#(= main_~y~0 0)} is VALID [2022-04-08 10:14:22,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {187189#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187190#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:22,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {187190#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187191#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:22,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {187191#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187192#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:22,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {187192#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187193#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:22,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {187193#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187194#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:22,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {187194#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187195#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:22,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {187195#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187196#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:22,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {187196#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187197#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:22,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {187197#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187198#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:22,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {187198#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187199#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:14:22,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {187199#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187200#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:14:22,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {187200#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187201#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:22,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {187201#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187202#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:22,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {187202#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {187202#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:22,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {187202#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {187203#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:14:22,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {187203#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187204#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:14:22,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {187204#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187205#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:14:22,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {187205#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187206#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:14:22,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {187206#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187207#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:14:22,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {187207#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187208#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:14:22,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {187208#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187209#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:14:22,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {187209#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187210#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:14:22,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {187210#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187211#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:14:22,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {187211#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187212#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:14:22,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {187212#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187213#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:14:22,357 INFO L290 TraceCheckUtils]: 31: Hoare triple {187213#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187214#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:14:22,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {187214#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {187185#false} is VALID [2022-04-08 10:14:22,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:22,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:22,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:22,358 INFO L290 TraceCheckUtils]: 36: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:22,358 INFO L290 TraceCheckUtils]: 37: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:22,358 INFO L290 TraceCheckUtils]: 38: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:22,358 INFO L290 TraceCheckUtils]: 39: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:22,358 INFO L290 TraceCheckUtils]: 40: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:22,358 INFO L290 TraceCheckUtils]: 41: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:22,358 INFO L290 TraceCheckUtils]: 42: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:22,358 INFO L290 TraceCheckUtils]: 43: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:22,358 INFO L290 TraceCheckUtils]: 44: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:22,358 INFO L290 TraceCheckUtils]: 45: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:22,359 INFO L290 TraceCheckUtils]: 46: Hoare triple {187185#false} assume !(~y~0 % 4294967296 > 0); {187185#false} is VALID [2022-04-08 10:14:22,359 INFO L272 TraceCheckUtils]: 47: Hoare triple {187185#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {187185#false} is VALID [2022-04-08 10:14:22,359 INFO L290 TraceCheckUtils]: 48: Hoare triple {187185#false} ~cond := #in~cond; {187185#false} is VALID [2022-04-08 10:14:22,359 INFO L290 TraceCheckUtils]: 49: Hoare triple {187185#false} assume 0 == ~cond; {187185#false} is VALID [2022-04-08 10:14:22,359 INFO L290 TraceCheckUtils]: 50: Hoare triple {187185#false} assume !false; {187185#false} is VALID [2022-04-08 10:14:22,359 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:14:22,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:14:22,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061873566] [2022-04-08 10:14:22,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061873566] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:14:22,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383542816] [2022-04-08 10:14:22,359 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:14:22,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:22,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:14:22,360 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:14:22,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process [2022-04-08 10:14:22,895 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 10:14:22,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:14:22,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-08 10:14:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:22,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:14:23,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {187184#true} call ULTIMATE.init(); {187184#true} is VALID [2022-04-08 10:14:23,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {187184#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {187184#true} is VALID [2022-04-08 10:14:23,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {187184#true} assume true; {187184#true} is VALID [2022-04-08 10:14:23,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {187184#true} {187184#true} #61#return; {187184#true} is VALID [2022-04-08 10:14:23,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {187184#true} call #t~ret11 := main(); {187184#true} is VALID [2022-04-08 10:14:23,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {187184#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {187189#(= main_~y~0 0)} is VALID [2022-04-08 10:14:23,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {187189#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187190#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:23,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {187190#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187191#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:23,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {187191#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187192#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:23,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {187192#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187193#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:23,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {187193#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187194#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:23,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {187194#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187195#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:23,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {187195#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187196#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:23,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {187196#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187197#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:23,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {187197#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187198#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:23,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {187198#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187199#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:14:23,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {187199#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187200#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:14:23,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {187200#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187201#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:23,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {187201#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187202#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:23,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {187202#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {187202#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:23,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {187202#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {187279#(and (<= main_~y~0 13) (= main_~z~0 main_~y~0) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:23,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {187279#(and (<= main_~y~0 13) (= main_~z~0 main_~y~0) (<= 13 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187283#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:14:23,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {187283#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187287#(and (<= main_~y~0 13) (= main_~y~0 (+ main_~z~0 2)) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:23,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {187287#(and (<= main_~y~0 13) (= main_~y~0 (+ main_~z~0 2)) (<= 13 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187291#(and (<= main_~y~0 13) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:23,513 INFO L290 TraceCheckUtils]: 24: Hoare triple {187291#(and (<= main_~y~0 13) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 13 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187295#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-08 10:14:23,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {187295#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187299#(and (<= main_~y~0 13) (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:23,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {187299#(and (<= main_~y~0 13) (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= 13 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187303#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 4)) (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:23,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {187303#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 4)) (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187307#(and (<= main_~y~0 13) (= (+ (- 2) main_~y~0) (+ 5 main_~z~0)) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:23,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {187307#(and (<= main_~y~0 13) (= (+ (- 2) main_~y~0) (+ 5 main_~z~0)) (<= 13 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187311#(and (<= main_~y~0 13) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:23,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {187311#(and (<= main_~y~0 13) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 13 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187315#(and (<= main_~y~0 13) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:23,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {187315#(and (<= main_~y~0 13) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= 13 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187319#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 8))))} is VALID [2022-04-08 10:14:23,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {187319#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 8))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187323#(and (<= main_~y~0 13) (= (+ main_~z~0 3) (+ main_~y~0 (- 8))) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:23,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {187323#(and (<= main_~y~0 13) (= (+ main_~z~0 3) (+ main_~y~0 (- 8))) (<= 13 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {187185#false} is VALID [2022-04-08 10:14:23,518 INFO L290 TraceCheckUtils]: 33: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:23,518 INFO L290 TraceCheckUtils]: 34: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:23,518 INFO L290 TraceCheckUtils]: 35: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:23,518 INFO L290 TraceCheckUtils]: 36: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:23,518 INFO L290 TraceCheckUtils]: 37: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:23,518 INFO L290 TraceCheckUtils]: 38: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:23,518 INFO L290 TraceCheckUtils]: 39: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:23,518 INFO L290 TraceCheckUtils]: 40: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:23,518 INFO L290 TraceCheckUtils]: 41: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:23,518 INFO L290 TraceCheckUtils]: 42: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:23,518 INFO L290 TraceCheckUtils]: 43: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:23,518 INFO L290 TraceCheckUtils]: 44: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:23,518 INFO L290 TraceCheckUtils]: 45: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:23,518 INFO L290 TraceCheckUtils]: 46: Hoare triple {187185#false} assume !(~y~0 % 4294967296 > 0); {187185#false} is VALID [2022-04-08 10:14:23,518 INFO L272 TraceCheckUtils]: 47: Hoare triple {187185#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {187185#false} is VALID [2022-04-08 10:14:23,518 INFO L290 TraceCheckUtils]: 48: Hoare triple {187185#false} ~cond := #in~cond; {187185#false} is VALID [2022-04-08 10:14:23,518 INFO L290 TraceCheckUtils]: 49: Hoare triple {187185#false} assume 0 == ~cond; {187185#false} is VALID [2022-04-08 10:14:23,518 INFO L290 TraceCheckUtils]: 50: Hoare triple {187185#false} assume !false; {187185#false} is VALID [2022-04-08 10:14:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 10:14:23,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:14:24,593 INFO L290 TraceCheckUtils]: 50: Hoare triple {187185#false} assume !false; {187185#false} is VALID [2022-04-08 10:14:24,593 INFO L290 TraceCheckUtils]: 49: Hoare triple {187185#false} assume 0 == ~cond; {187185#false} is VALID [2022-04-08 10:14:24,593 INFO L290 TraceCheckUtils]: 48: Hoare triple {187185#false} ~cond := #in~cond; {187185#false} is VALID [2022-04-08 10:14:24,594 INFO L272 TraceCheckUtils]: 47: Hoare triple {187185#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {187185#false} is VALID [2022-04-08 10:14:24,594 INFO L290 TraceCheckUtils]: 46: Hoare triple {187185#false} assume !(~y~0 % 4294967296 > 0); {187185#false} is VALID [2022-04-08 10:14:24,594 INFO L290 TraceCheckUtils]: 45: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:24,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {187399#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-08 10:14:24,595 INFO L290 TraceCheckUtils]: 43: Hoare triple {187403#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187399#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:14:24,595 INFO L290 TraceCheckUtils]: 42: Hoare triple {187407#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187403#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:14:24,596 INFO L290 TraceCheckUtils]: 41: Hoare triple {187411#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187407#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:14:24,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {187415#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187411#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:14:24,598 INFO L290 TraceCheckUtils]: 39: Hoare triple {187419#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187415#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:14:24,598 INFO L290 TraceCheckUtils]: 38: Hoare triple {187423#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187419#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:14:24,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {187427#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187423#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:14:24,600 INFO L290 TraceCheckUtils]: 36: Hoare triple {187431#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187427#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:14:24,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {187435#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187431#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:14:24,601 INFO L290 TraceCheckUtils]: 34: Hoare triple {187439#(not (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187435#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} is VALID [2022-04-08 10:14:24,602 INFO L290 TraceCheckUtils]: 33: Hoare triple {187443#(not (< 0 (mod (+ main_~y~0 4294967285) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187439#(not (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-08 10:14:24,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {187447#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {187443#(not (< 0 (mod (+ main_~y~0 4294967285) 4294967296)))} is VALID [2022-04-08 10:14:24,603 INFO L290 TraceCheckUtils]: 31: Hoare triple {187451#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187447#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:14:24,604 INFO L290 TraceCheckUtils]: 30: Hoare triple {187455#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187451#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:14:24,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {187459#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187455#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:14:24,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {187463#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187459#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:14:24,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {187467#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187463#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:14:24,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {187471#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187467#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:14:24,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {187475#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187471#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:14:24,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {187479#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187475#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:14:24,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {187483#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187479#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:14:24,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {187487#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187483#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-08 10:14:24,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {187491#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967285) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187487#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} is VALID [2022-04-08 10:14:24,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {187184#true} ~z~0 := ~y~0; {187491#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967285) 4294967296)))} is VALID [2022-04-08 10:14:24,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {187184#true} assume !(~x~0 % 4294967296 > 0); {187184#true} is VALID [2022-04-08 10:14:24,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {187184#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187184#true} is VALID [2022-04-08 10:14:24,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {187184#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187184#true} is VALID [2022-04-08 10:14:24,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {187184#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187184#true} is VALID [2022-04-08 10:14:24,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {187184#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187184#true} is VALID [2022-04-08 10:14:24,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {187184#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187184#true} is VALID [2022-04-08 10:14:24,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {187184#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187184#true} is VALID [2022-04-08 10:14:24,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {187184#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187184#true} is VALID [2022-04-08 10:14:24,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {187184#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187184#true} is VALID [2022-04-08 10:14:24,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {187184#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187184#true} is VALID [2022-04-08 10:14:24,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {187184#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187184#true} is VALID [2022-04-08 10:14:24,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {187184#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187184#true} is VALID [2022-04-08 10:14:24,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {187184#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187184#true} is VALID [2022-04-08 10:14:24,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {187184#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187184#true} is VALID [2022-04-08 10:14:24,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {187184#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {187184#true} is VALID [2022-04-08 10:14:24,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {187184#true} call #t~ret11 := main(); {187184#true} is VALID [2022-04-08 10:14:24,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {187184#true} {187184#true} #61#return; {187184#true} is VALID [2022-04-08 10:14:24,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {187184#true} assume true; {187184#true} is VALID [2022-04-08 10:14:24,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {187184#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {187184#true} is VALID [2022-04-08 10:14:24,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {187184#true} call ULTIMATE.init(); {187184#true} is VALID [2022-04-08 10:14:24,612 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 24 proven. 132 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-04-08 10:14:24,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383542816] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:14:24,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:14:24,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 26] total 65 [2022-04-08 10:14:24,612 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:14:24,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [984235457] [2022-04-08 10:14:24,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [984235457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:14:24,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:14:24,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-08 10:14:24,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363507945] [2022-04-08 10:14:24,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:14:24,613 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-08 10:14:24,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:14:24,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:24,637 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-08 10:14:24,637 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-08 10:14:24,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:24,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-08 10:14:24,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=3692, Unknown=0, NotChecked=0, Total=4160 [2022-04-08 10:14:24,637 INFO L87 Difference]: Start difference. First operand 229 states and 296 transitions. Second operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:28,189 INFO L93 Difference]: Finished difference Result 264 states and 331 transitions. [2022-04-08 10:14:28,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 10:14:28,189 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-08 10:14:28,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:14:28,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:28,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 69 transitions. [2022-04-08 10:14:28,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:28,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 69 transitions. [2022-04-08 10:14:28,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 69 transitions. [2022-04-08 10:14:28,248 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-08 10:14:28,251 INFO L225 Difference]: With dead ends: 264 [2022-04-08 10:14:28,251 INFO L226 Difference]: Without dead ends: 245 [2022-04-08 10:14:28,251 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=778, Invalid=7412, Unknown=0, NotChecked=0, Total=8190 [2022-04-08 10:14:28,252 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:14:28,252 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 148 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:14:28,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-04-08 10:14:29,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 230. [2022-04-08 10:14:29,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:14:29,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 245 states. Second operand has 230 states, 225 states have (on average 1.3022222222222222) internal successors, (293), 225 states have internal predecessors, (293), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:29,149 INFO L74 IsIncluded]: Start isIncluded. First operand 245 states. Second operand has 230 states, 225 states have (on average 1.3022222222222222) internal successors, (293), 225 states have internal predecessors, (293), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:29,149 INFO L87 Difference]: Start difference. First operand 245 states. Second operand has 230 states, 225 states have (on average 1.3022222222222222) internal successors, (293), 225 states have internal predecessors, (293), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:29,151 INFO L93 Difference]: Finished difference Result 245 states and 312 transitions. [2022-04-08 10:14:29,151 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 312 transitions. [2022-04-08 10:14:29,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:29,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:29,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 230 states, 225 states have (on average 1.3022222222222222) internal successors, (293), 225 states have internal predecessors, (293), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 245 states. [2022-04-08 10:14:29,152 INFO L87 Difference]: Start difference. First operand has 230 states, 225 states have (on average 1.3022222222222222) internal successors, (293), 225 states have internal predecessors, (293), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 245 states. [2022-04-08 10:14:29,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:29,154 INFO L93 Difference]: Finished difference Result 245 states and 312 transitions. [2022-04-08 10:14:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 312 transitions. [2022-04-08 10:14:29,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:29,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:29,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:14:29,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:14:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 225 states have (on average 1.3022222222222222) internal successors, (293), 225 states have internal predecessors, (293), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:29,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 297 transitions. [2022-04-08 10:14:29,157 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 297 transitions. Word has length 51 [2022-04-08 10:14:29,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:14:29,158 INFO L478 AbstractCegarLoop]: Abstraction has 230 states and 297 transitions. [2022-04-08 10:14:29,158 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:29,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 230 states and 297 transitions. [2022-04-08 10:14:29,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 297 edges. 297 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:29,968 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 297 transitions. [2022-04-08 10:14:29,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 10:14:29,968 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:14:29,968 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:14:29,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Forceful destruction successful, exit code 0 [2022-04-08 10:14:30,168 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142,141 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:30,169 INFO L403 AbstractCegarLoop]: === Iteration 144 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:14:30,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:14:30,169 INFO L85 PathProgramCache]: Analyzing trace with hash 85668975, now seen corresponding path program 277 times [2022-04-08 10:14:30,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:30,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [397027094] [2022-04-08 10:14:30,171 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:14:30,171 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:14:30,171 INFO L85 PathProgramCache]: Analyzing trace with hash 85668975, now seen corresponding path program 278 times [2022-04-08 10:14:30,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:14:30,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054261718] [2022-04-08 10:14:30,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:14:30,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:14:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:30,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:14:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:30,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {189117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {189087#true} is VALID [2022-04-08 10:14:30,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {189087#true} assume true; {189087#true} is VALID [2022-04-08 10:14:30,603 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {189087#true} {189087#true} #61#return; {189087#true} is VALID [2022-04-08 10:14:30,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {189087#true} call ULTIMATE.init(); {189117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:14:30,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {189117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {189087#true} is VALID [2022-04-08 10:14:30,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {189087#true} assume true; {189087#true} is VALID [2022-04-08 10:14:30,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189087#true} {189087#true} #61#return; {189087#true} is VALID [2022-04-08 10:14:30,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {189087#true} call #t~ret11 := main(); {189087#true} is VALID [2022-04-08 10:14:30,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {189087#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {189092#(= main_~y~0 0)} is VALID [2022-04-08 10:14:30,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {189092#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189093#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:30,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {189093#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189094#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:30,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {189094#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189095#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:30,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {189095#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189096#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:30,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {189096#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189097#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:30,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {189097#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189098#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:30,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {189098#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189099#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:30,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {189099#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189100#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:30,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {189100#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189101#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:30,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {189101#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189102#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:14:30,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {189102#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189103#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:14:30,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {189103#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189104#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:30,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {189104#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189105#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:30,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {189105#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189106#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:14:30,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {189106#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {189106#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:14:30,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {189106#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {189107#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:14:30,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {189107#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189108#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:14:30,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {189108#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189109#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:14:30,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {189109#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189110#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:14:30,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {189110#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189111#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:14:30,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {189111#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189112#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:14:30,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {189112#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189113#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:14:30,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {189113#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189114#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:14:30,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {189114#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189115#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:14:30,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {189115#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189116#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:14:30,616 INFO L290 TraceCheckUtils]: 31: Hoare triple {189116#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {189088#false} is VALID [2022-04-08 10:14:30,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:30,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:30,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:30,616 INFO L290 TraceCheckUtils]: 35: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:30,616 INFO L290 TraceCheckUtils]: 36: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:30,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:30,617 INFO L290 TraceCheckUtils]: 38: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:30,617 INFO L290 TraceCheckUtils]: 39: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:30,617 INFO L290 TraceCheckUtils]: 40: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:30,617 INFO L290 TraceCheckUtils]: 41: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:30,617 INFO L290 TraceCheckUtils]: 42: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:30,617 INFO L290 TraceCheckUtils]: 43: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:30,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:30,617 INFO L290 TraceCheckUtils]: 45: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:30,617 INFO L290 TraceCheckUtils]: 46: Hoare triple {189088#false} assume !(~y~0 % 4294967296 > 0); {189088#false} is VALID [2022-04-08 10:14:30,617 INFO L272 TraceCheckUtils]: 47: Hoare triple {189088#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {189088#false} is VALID [2022-04-08 10:14:30,617 INFO L290 TraceCheckUtils]: 48: Hoare triple {189088#false} ~cond := #in~cond; {189088#false} is VALID [2022-04-08 10:14:30,617 INFO L290 TraceCheckUtils]: 49: Hoare triple {189088#false} assume 0 == ~cond; {189088#false} is VALID [2022-04-08 10:14:30,617 INFO L290 TraceCheckUtils]: 50: Hoare triple {189088#false} assume !false; {189088#false} is VALID [2022-04-08 10:14:30,617 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:14:30,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:14:30,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054261718] [2022-04-08 10:14:30,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054261718] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:14:30,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140512182] [2022-04-08 10:14:30,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:14:30,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:30,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:14:30,619 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:14:30,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2022-04-08 10:14:30,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:14:30,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:14:30,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-08 10:14:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:30,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:14:31,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {189087#true} call ULTIMATE.init(); {189087#true} is VALID [2022-04-08 10:14:31,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {189087#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {189087#true} is VALID [2022-04-08 10:14:31,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {189087#true} assume true; {189087#true} is VALID [2022-04-08 10:14:31,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189087#true} {189087#true} #61#return; {189087#true} is VALID [2022-04-08 10:14:31,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {189087#true} call #t~ret11 := main(); {189087#true} is VALID [2022-04-08 10:14:31,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {189087#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {189092#(= main_~y~0 0)} is VALID [2022-04-08 10:14:31,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {189092#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189093#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:31,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {189093#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189094#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:31,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {189094#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189095#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:31,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {189095#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189096#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:31,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {189096#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189097#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:31,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {189097#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189098#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:31,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {189098#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189099#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:31,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {189099#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189100#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:31,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {189100#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189101#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:31,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {189101#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189102#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:14:31,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {189102#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189103#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:14:31,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {189103#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189104#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:31,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {189104#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189105#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:31,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {189105#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189106#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:14:31,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {189106#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {189106#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:14:31,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {189106#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {189107#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:14:31,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {189107#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189108#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:14:31,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {189108#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189109#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:14:31,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {189109#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189110#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:14:31,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {189110#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189111#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:14:31,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {189111#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189112#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:14:31,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {189112#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189113#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:14:31,117 INFO L290 TraceCheckUtils]: 28: Hoare triple {189113#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189114#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:14:31,118 INFO L290 TraceCheckUtils]: 29: Hoare triple {189114#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189115#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:14:31,118 INFO L290 TraceCheckUtils]: 30: Hoare triple {189115#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189211#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:14:31,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {189211#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {189088#false} is VALID [2022-04-08 10:14:31,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:31,119 INFO L290 TraceCheckUtils]: 33: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:31,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:31,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:31,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:31,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:31,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:31,119 INFO L290 TraceCheckUtils]: 39: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:31,119 INFO L290 TraceCheckUtils]: 40: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:31,119 INFO L290 TraceCheckUtils]: 41: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:31,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:31,119 INFO L290 TraceCheckUtils]: 43: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:31,119 INFO L290 TraceCheckUtils]: 44: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:31,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:31,120 INFO L290 TraceCheckUtils]: 46: Hoare triple {189088#false} assume !(~y~0 % 4294967296 > 0); {189088#false} is VALID [2022-04-08 10:14:31,120 INFO L272 TraceCheckUtils]: 47: Hoare triple {189088#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {189088#false} is VALID [2022-04-08 10:14:31,120 INFO L290 TraceCheckUtils]: 48: Hoare triple {189088#false} ~cond := #in~cond; {189088#false} is VALID [2022-04-08 10:14:31,120 INFO L290 TraceCheckUtils]: 49: Hoare triple {189088#false} assume 0 == ~cond; {189088#false} is VALID [2022-04-08 10:14:31,120 INFO L290 TraceCheckUtils]: 50: Hoare triple {189088#false} assume !false; {189088#false} is VALID [2022-04-08 10:14:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:14:31,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:14:32,040 INFO L290 TraceCheckUtils]: 50: Hoare triple {189088#false} assume !false; {189088#false} is VALID [2022-04-08 10:14:32,040 INFO L290 TraceCheckUtils]: 49: Hoare triple {189088#false} assume 0 == ~cond; {189088#false} is VALID [2022-04-08 10:14:32,040 INFO L290 TraceCheckUtils]: 48: Hoare triple {189088#false} ~cond := #in~cond; {189088#false} is VALID [2022-04-08 10:14:32,040 INFO L272 TraceCheckUtils]: 47: Hoare triple {189088#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {189088#false} is VALID [2022-04-08 10:14:32,040 INFO L290 TraceCheckUtils]: 46: Hoare triple {189088#false} assume !(~y~0 % 4294967296 > 0); {189088#false} is VALID [2022-04-08 10:14:32,040 INFO L290 TraceCheckUtils]: 45: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:32,040 INFO L290 TraceCheckUtils]: 44: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:32,040 INFO L290 TraceCheckUtils]: 43: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:32,040 INFO L290 TraceCheckUtils]: 42: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:32,040 INFO L290 TraceCheckUtils]: 41: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:32,040 INFO L290 TraceCheckUtils]: 40: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:32,040 INFO L290 TraceCheckUtils]: 39: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:32,040 INFO L290 TraceCheckUtils]: 38: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:32,041 INFO L290 TraceCheckUtils]: 37: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:32,041 INFO L290 TraceCheckUtils]: 36: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:32,041 INFO L290 TraceCheckUtils]: 35: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:32,041 INFO L290 TraceCheckUtils]: 34: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:32,041 INFO L290 TraceCheckUtils]: 33: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:32,041 INFO L290 TraceCheckUtils]: 32: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-08 10:14:32,041 INFO L290 TraceCheckUtils]: 31: Hoare triple {189329#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {189088#false} is VALID [2022-04-08 10:14:32,042 INFO L290 TraceCheckUtils]: 30: Hoare triple {189333#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189329#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:14:32,043 INFO L290 TraceCheckUtils]: 29: Hoare triple {189337#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189333#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:14:32,043 INFO L290 TraceCheckUtils]: 28: Hoare triple {189341#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189337#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:14:32,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {189345#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189341#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:14:32,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {189349#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189345#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:14:32,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {189353#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189349#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:14:32,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {189357#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189353#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:14:32,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {189361#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189357#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:14:32,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {189365#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189361#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-08 10:14:32,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {189369#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} ~z~0 := ~y~0; {189365#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} is VALID [2022-04-08 10:14:32,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {189369#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !(~x~0 % 4294967296 > 0); {189369#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:14:32,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {189376#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189369#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:14:32,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {189380#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189376#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:32,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {189384#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189380#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:14:32,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {189388#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189384#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:32,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {189392#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189388#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:32,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {189396#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189392#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:32,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {189400#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189396#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:14:32,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {189404#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189400#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:14:32,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {189408#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189404#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:14:32,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {189412#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189408#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:14:32,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {189416#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189412#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:14:32,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {189420#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189416#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:14:32,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {189424#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189420#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:14:32,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {189428#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {189424#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:14:32,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {189087#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {189428#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:32,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {189087#true} call #t~ret11 := main(); {189087#true} is VALID [2022-04-08 10:14:32,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189087#true} {189087#true} #61#return; {189087#true} is VALID [2022-04-08 10:14:32,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {189087#true} assume true; {189087#true} is VALID [2022-04-08 10:14:32,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {189087#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {189087#true} is VALID [2022-04-08 10:14:32,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {189087#true} call ULTIMATE.init(); {189087#true} is VALID [2022-04-08 10:14:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:14:32,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140512182] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:14:32,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:14:32,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-08 10:14:32,057 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:14:32,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [397027094] [2022-04-08 10:14:32,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [397027094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:14:32,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:14:32,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-08 10:14:32,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507333986] [2022-04-08 10:14:32,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:14:32,058 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-08 10:14:32,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:14:32,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:32,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:32,083 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-08 10:14:32,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:32,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-08 10:14:32,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=2432, Unknown=0, NotChecked=0, Total=2862 [2022-04-08 10:14:32,084 INFO L87 Difference]: Start difference. First operand 230 states and 297 transitions. Second operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:35,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:35,678 INFO L93 Difference]: Finished difference Result 267 states and 334 transitions. [2022-04-08 10:14:35,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-08 10:14:35,678 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-08 10:14:35,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:14:35,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:35,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 82 transitions. [2022-04-08 10:14:35,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:35,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 82 transitions. [2022-04-08 10:14:35,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 82 transitions. [2022-04-08 10:14:35,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:35,746 INFO L225 Difference]: With dead ends: 267 [2022-04-08 10:14:35,746 INFO L226 Difference]: Without dead ends: 247 [2022-04-08 10:14:35,746 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1310, Invalid=6346, Unknown=0, NotChecked=0, Total=7656 [2022-04-08 10:14:35,746 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:14:35,746 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 120 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:14:35,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-04-08 10:14:36,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 231. [2022-04-08 10:14:36,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:14:36,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand has 231 states, 226 states have (on average 1.3008849557522124) internal successors, (294), 226 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:36,677 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand has 231 states, 226 states have (on average 1.3008849557522124) internal successors, (294), 226 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:36,677 INFO L87 Difference]: Start difference. First operand 247 states. Second operand has 231 states, 226 states have (on average 1.3008849557522124) internal successors, (294), 226 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:36,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:36,680 INFO L93 Difference]: Finished difference Result 247 states and 314 transitions. [2022-04-08 10:14:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 314 transitions. [2022-04-08 10:14:36,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:36,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:36,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 226 states have (on average 1.3008849557522124) internal successors, (294), 226 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 247 states. [2022-04-08 10:14:36,680 INFO L87 Difference]: Start difference. First operand has 231 states, 226 states have (on average 1.3008849557522124) internal successors, (294), 226 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 247 states. [2022-04-08 10:14:36,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:36,683 INFO L93 Difference]: Finished difference Result 247 states and 314 transitions. [2022-04-08 10:14:36,683 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 314 transitions. [2022-04-08 10:14:36,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:36,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:36,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:14:36,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:14:36,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 226 states have (on average 1.3008849557522124) internal successors, (294), 226 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:36,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 298 transitions. [2022-04-08 10:14:36,686 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 298 transitions. Word has length 51 [2022-04-08 10:14:36,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:14:36,686 INFO L478 AbstractCegarLoop]: Abstraction has 231 states and 298 transitions. [2022-04-08 10:14:36,686 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:36,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 231 states and 298 transitions. [2022-04-08 10:14:37,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:37,483 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 298 transitions. [2022-04-08 10:14:37,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 10:14:37,483 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:14:37,483 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:14:37,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Forceful destruction successful, exit code 0 [2022-04-08 10:14:37,684 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143,142 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:37,684 INFO L403 AbstractCegarLoop]: === Iteration 145 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:14:37,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:14:37,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1628941951, now seen corresponding path program 279 times [2022-04-08 10:14:37,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:37,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [729908300] [2022-04-08 10:14:37,686 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:14:37,686 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:14:37,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1628941951, now seen corresponding path program 280 times [2022-04-08 10:14:37,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:14:37,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448563160] [2022-04-08 10:14:37,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:14:37,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:14:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:38,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:14:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:38,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {191036#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {191007#true} is VALID [2022-04-08 10:14:38,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {191007#true} assume true; {191007#true} is VALID [2022-04-08 10:14:38,091 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {191007#true} {191007#true} #61#return; {191007#true} is VALID [2022-04-08 10:14:38,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {191007#true} call ULTIMATE.init(); {191036#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:14:38,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {191036#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {191007#true} is VALID [2022-04-08 10:14:38,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {191007#true} assume true; {191007#true} is VALID [2022-04-08 10:14:38,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191007#true} {191007#true} #61#return; {191007#true} is VALID [2022-04-08 10:14:38,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {191007#true} call #t~ret11 := main(); {191007#true} is VALID [2022-04-08 10:14:38,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {191007#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {191012#(= main_~y~0 0)} is VALID [2022-04-08 10:14:38,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {191012#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191013#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:38,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {191013#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191014#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:38,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {191014#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191015#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:38,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {191015#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191016#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:38,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {191016#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191017#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:38,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {191017#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191018#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:38,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {191018#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191019#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:38,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {191019#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191020#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:38,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {191020#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191021#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:38,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {191021#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191022#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:14:38,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {191022#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191023#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:14:38,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {191023#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191024#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:38,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {191024#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191025#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:38,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {191025#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191026#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:14:38,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {191026#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:14:38,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {191027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {191027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:14:38,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {191027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {191028#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:14:38,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {191028#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:14:38,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {191029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191030#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:14:38,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {191030#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191031#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:14:38,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {191031#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191032#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:14:38,102 INFO L290 TraceCheckUtils]: 27: Hoare triple {191032#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191033#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:14:38,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {191033#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191034#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:14:38,103 INFO L290 TraceCheckUtils]: 29: Hoare triple {191034#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191035#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:14:38,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {191035#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {191008#false} is VALID [2022-04-08 10:14:38,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,104 INFO L290 TraceCheckUtils]: 34: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,104 INFO L290 TraceCheckUtils]: 35: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,104 INFO L290 TraceCheckUtils]: 36: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,104 INFO L290 TraceCheckUtils]: 37: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,104 INFO L290 TraceCheckUtils]: 40: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,104 INFO L290 TraceCheckUtils]: 41: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,104 INFO L290 TraceCheckUtils]: 45: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,104 INFO L290 TraceCheckUtils]: 46: Hoare triple {191008#false} assume !(~y~0 % 4294967296 > 0); {191008#false} is VALID [2022-04-08 10:14:38,105 INFO L272 TraceCheckUtils]: 47: Hoare triple {191008#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {191008#false} is VALID [2022-04-08 10:14:38,105 INFO L290 TraceCheckUtils]: 48: Hoare triple {191008#false} ~cond := #in~cond; {191008#false} is VALID [2022-04-08 10:14:38,105 INFO L290 TraceCheckUtils]: 49: Hoare triple {191008#false} assume 0 == ~cond; {191008#false} is VALID [2022-04-08 10:14:38,105 INFO L290 TraceCheckUtils]: 50: Hoare triple {191008#false} assume !false; {191008#false} is VALID [2022-04-08 10:14:38,105 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 10:14:38,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:14:38,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448563160] [2022-04-08 10:14:38,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448563160] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:14:38,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045207031] [2022-04-08 10:14:38,105 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:14:38,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:38,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:14:38,106 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:14:38,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2022-04-08 10:14:38,161 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:14:38,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:14:38,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-08 10:14:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:38,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:14:38,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {191007#true} call ULTIMATE.init(); {191007#true} is VALID [2022-04-08 10:14:38,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {191007#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {191007#true} is VALID [2022-04-08 10:14:38,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {191007#true} assume true; {191007#true} is VALID [2022-04-08 10:14:38,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191007#true} {191007#true} #61#return; {191007#true} is VALID [2022-04-08 10:14:38,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {191007#true} call #t~ret11 := main(); {191007#true} is VALID [2022-04-08 10:14:38,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {191007#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {191012#(= main_~y~0 0)} is VALID [2022-04-08 10:14:38,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {191012#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191013#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:38,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {191013#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191014#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:38,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {191014#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191015#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:38,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {191015#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191016#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:38,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {191016#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191017#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:38,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {191017#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191018#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:38,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {191018#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191019#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:38,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {191019#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191020#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:38,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {191020#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191021#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:38,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {191021#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191022#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:14:38,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {191022#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191023#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:14:38,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {191023#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191024#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:38,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {191024#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191025#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:38,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {191025#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191026#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:14:38,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {191026#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:14:38,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {191027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {191027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:14:38,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {191027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {191028#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:14:38,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {191028#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:14:38,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {191029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191030#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:14:38,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {191030#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191031#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:14:38,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {191031#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191032#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:14:38,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {191032#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191033#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:14:38,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {191033#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191034#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:14:38,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {191034#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191127#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:14:38,527 INFO L290 TraceCheckUtils]: 30: Hoare triple {191127#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {191008#false} is VALID [2022-04-08 10:14:38,527 INFO L290 TraceCheckUtils]: 31: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,527 INFO L290 TraceCheckUtils]: 32: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,527 INFO L290 TraceCheckUtils]: 33: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,527 INFO L290 TraceCheckUtils]: 34: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,527 INFO L290 TraceCheckUtils]: 35: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,527 INFO L290 TraceCheckUtils]: 36: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,527 INFO L290 TraceCheckUtils]: 37: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,527 INFO L290 TraceCheckUtils]: 38: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,527 INFO L290 TraceCheckUtils]: 39: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,527 INFO L290 TraceCheckUtils]: 41: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,527 INFO L290 TraceCheckUtils]: 42: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,527 INFO L290 TraceCheckUtils]: 43: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,528 INFO L290 TraceCheckUtils]: 44: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,528 INFO L290 TraceCheckUtils]: 45: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:38,528 INFO L290 TraceCheckUtils]: 46: Hoare triple {191008#false} assume !(~y~0 % 4294967296 > 0); {191008#false} is VALID [2022-04-08 10:14:38,528 INFO L272 TraceCheckUtils]: 47: Hoare triple {191008#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {191008#false} is VALID [2022-04-08 10:14:38,528 INFO L290 TraceCheckUtils]: 48: Hoare triple {191008#false} ~cond := #in~cond; {191008#false} is VALID [2022-04-08 10:14:38,528 INFO L290 TraceCheckUtils]: 49: Hoare triple {191008#false} assume 0 == ~cond; {191008#false} is VALID [2022-04-08 10:14:38,528 INFO L290 TraceCheckUtils]: 50: Hoare triple {191008#false} assume !false; {191008#false} is VALID [2022-04-08 10:14:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 10:14:38,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:14:39,406 INFO L290 TraceCheckUtils]: 50: Hoare triple {191008#false} assume !false; {191008#false} is VALID [2022-04-08 10:14:39,407 INFO L290 TraceCheckUtils]: 49: Hoare triple {191008#false} assume 0 == ~cond; {191008#false} is VALID [2022-04-08 10:14:39,407 INFO L290 TraceCheckUtils]: 48: Hoare triple {191008#false} ~cond := #in~cond; {191008#false} is VALID [2022-04-08 10:14:39,407 INFO L272 TraceCheckUtils]: 47: Hoare triple {191008#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {191008#false} is VALID [2022-04-08 10:14:39,407 INFO L290 TraceCheckUtils]: 46: Hoare triple {191008#false} assume !(~y~0 % 4294967296 > 0); {191008#false} is VALID [2022-04-08 10:14:39,407 INFO L290 TraceCheckUtils]: 45: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:39,407 INFO L290 TraceCheckUtils]: 44: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:39,407 INFO L290 TraceCheckUtils]: 43: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:39,407 INFO L290 TraceCheckUtils]: 42: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:39,407 INFO L290 TraceCheckUtils]: 41: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:39,408 INFO L290 TraceCheckUtils]: 40: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:39,408 INFO L290 TraceCheckUtils]: 39: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:39,408 INFO L290 TraceCheckUtils]: 38: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:39,408 INFO L290 TraceCheckUtils]: 37: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:39,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:39,408 INFO L290 TraceCheckUtils]: 35: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:39,408 INFO L290 TraceCheckUtils]: 34: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:39,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:39,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:39,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-08 10:14:39,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {191251#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {191008#false} is VALID [2022-04-08 10:14:39,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {191255#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191251#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:14:39,411 INFO L290 TraceCheckUtils]: 28: Hoare triple {191259#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191255#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:14:39,412 INFO L290 TraceCheckUtils]: 27: Hoare triple {191263#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191259#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:14:39,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {191267#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191263#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:14:39,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {191271#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191267#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:14:39,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {191275#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191271#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:14:39,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {191279#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191275#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:14:39,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {191283#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} ~z~0 := ~y~0; {191279#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:14:39,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {191283#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~x~0 % 4294967296 > 0); {191283#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:14:39,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {191290#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191283#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:14:39,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {191294#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191290#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:39,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {191298#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191294#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:39,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {191302#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191298#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:39,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {191306#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191302#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:14:39,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {191310#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191306#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:14:39,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {191314#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191310#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:14:39,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {191318#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191314#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:14:39,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {191322#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191318#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:14:39,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {191326#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191322#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:14:39,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {191330#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191326#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:14:39,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {191334#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191330#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:14:39,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {191338#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191334#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:39,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {191342#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191338#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:14:39,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {191346#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191342#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:39,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {191007#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {191346#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:14:39,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {191007#true} call #t~ret11 := main(); {191007#true} is VALID [2022-04-08 10:14:39,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191007#true} {191007#true} #61#return; {191007#true} is VALID [2022-04-08 10:14:39,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {191007#true} assume true; {191007#true} is VALID [2022-04-08 10:14:39,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {191007#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {191007#true} is VALID [2022-04-08 10:14:39,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {191007#true} call ULTIMATE.init(); {191007#true} is VALID [2022-04-08 10:14:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 10:14:39,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045207031] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:14:39,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:14:39,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-08 10:14:39,429 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:14:39,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [729908300] [2022-04-08 10:14:39,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [729908300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:14:39,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:14:39,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-08 10:14:39,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15210134] [2022-04-08 10:14:39,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:14:39,429 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-08 10:14:39,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:14:39,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:39,453 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-08 10:14:39,453 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-08 10:14:39,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:39,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-08 10:14:39,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=429, Invalid=2223, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:14:39,453 INFO L87 Difference]: Start difference. First operand 231 states and 298 transitions. Second operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)