/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/loopv2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:00:30,529 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:00:30,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:00:30,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:00:30,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:00:30,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:00:30,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:00:30,579 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:00:30,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:00:30,585 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:00:30,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:00:30,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:00:30,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:00:30,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:00:30,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:00:30,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:00:30,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:00:30,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:00:30,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:00:30,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:00:30,602 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:00:30,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:00:30,604 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:00:30,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:00:30,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:00:30,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:00:30,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:00:30,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:00:30,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:00:30,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:00:30,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:00:30,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:00:30,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:00:30,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:00:30,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:00:30,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:00:30,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:00:30,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:00:30,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:00:30,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:00:30,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:00:30,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:00:30,622 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:00:30,631 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:00:30,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:00:30,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:00:30,632 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:00:30,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:00:30,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:00:30,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:00:30,633 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:00:30,633 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:00:30,634 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:00:30,634 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:00:30,634 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:00:30,634 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:00:30,634 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:00:30,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:00:30,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:00:30,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:00:30,635 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:00:30,635 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:00:30,635 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:00:30,635 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:00:30,635 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:00:30,635 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 13:00:30,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:00:30,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:00:30,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:00:30,869 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:00:30,869 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:00:30,870 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/loopv2.c [2022-04-15 13:00:30,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5502abd8c/d06baa6d7cdc4da28f73bc7453b6950b/FLAG4c5d15e09 [2022-04-15 13:00:31,318 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:00:31,319 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/loopv2.c [2022-04-15 13:00:31,324 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5502abd8c/d06baa6d7cdc4da28f73bc7453b6950b/FLAG4c5d15e09 [2022-04-15 13:00:31,336 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5502abd8c/d06baa6d7cdc4da28f73bc7453b6950b [2022-04-15 13:00:31,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:00:31,339 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:00:31,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:00:31,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:00:31,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:00:31,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:00:31" (1/1) ... [2022-04-15 13:00:31,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d20353f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:00:31, skipping insertion in model container [2022-04-15 13:00:31,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:00:31" (1/1) ... [2022-04-15 13:00:31,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:00:31,361 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:00:31,503 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/loopv2.c[454,467] [2022-04-15 13:00:31,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:00:31,521 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:00:31,532 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/loopv2.c[454,467] [2022-04-15 13:00:31,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:00:31,547 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:00:31,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:00:31 WrapperNode [2022-04-15 13:00:31,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:00:31,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:00:31,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:00:31,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:00:31,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:00:31" (1/1) ... [2022-04-15 13:00:31,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:00:31" (1/1) ... [2022-04-15 13:00:31,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:00:31" (1/1) ... [2022-04-15 13:00:31,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:00:31" (1/1) ... [2022-04-15 13:00:31,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:00:31" (1/1) ... [2022-04-15 13:00:31,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:00:31" (1/1) ... [2022-04-15 13:00:31,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:00:31" (1/1) ... [2022-04-15 13:00:31,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:00:31,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:00:31,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:00:31,591 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:00:31,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:00:31" (1/1) ... [2022-04-15 13:00:31,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:00:31,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:00:31,633 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 13:00:31,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 13:00:31,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:00:31,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:00:31,677 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:00:31,677 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:00:31,677 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:00:31,678 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:00:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 13:00:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:00:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:00:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:00:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:00:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:00:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:00:31,679 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:00:31,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:00:31,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:00:31,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:00:31,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:00:31,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:00:31,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:00:31,739 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:00:31,740 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:00:31,845 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:00:31,851 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:00:31,852 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 13:00:31,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:00:31 BoogieIcfgContainer [2022-04-15 13:00:31,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:00:31,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:00:31,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:00:31,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:00:31,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:00:31" (1/3) ... [2022-04-15 13:00:31,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e28373e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:00:31, skipping insertion in model container [2022-04-15 13:00:31,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:00:31" (2/3) ... [2022-04-15 13:00:31,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e28373e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:00:31, skipping insertion in model container [2022-04-15 13:00:31,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:00:31" (3/3) ... [2022-04-15 13:00:31,877 INFO L111 eAbstractionObserver]: Analyzing ICFG loopv2.c [2022-04-15 13:00:31,881 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:00:31,881 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:00:31,939 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:00:31,945 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 13:00:31,945 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:00:31,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:00:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 13:00:31,965 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:31,965 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:00:31,966 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:31,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:31,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1146993295, now seen corresponding path program 1 times [2022-04-15 13:00:31,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:31,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1945169424] [2022-04-15 13:00:31,985 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:00:31,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1146993295, now seen corresponding path program 2 times [2022-04-15 13:00:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:31,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580393529] [2022-04-15 13:00:31,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:31,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:32,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:32,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {25#true} is VALID [2022-04-15 13:00:32,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 13:00:32,259 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #62#return; {25#true} is VALID [2022-04-15 13:00:32,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:32,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {25#true} is VALID [2022-04-15 13:00:32,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 13:00:32,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #62#return; {25#true} is VALID [2022-04-15 13:00:32,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret5 := main(); {25#true} is VALID [2022-04-15 13:00:32,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {25#true} is VALID [2022-04-15 13:00:32,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {30#(= main_~j~0 0)} is VALID [2022-04-15 13:00:32,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#(= main_~j~0 0)} assume !(~i~0 < ~n~0); {30#(= main_~j~0 0)} is VALID [2022-04-15 13:00:32,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#(= main_~j~0 0)} ~k~0 := ~i~0; {30#(= main_~j~0 0)} is VALID [2022-04-15 13:00:32,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#(= main_~j~0 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {26#false} is VALID [2022-04-15 13:00:32,265 INFO L272 TraceCheckUtils]: 10: Hoare triple {26#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {26#false} is VALID [2022-04-15 13:00:32,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-15 13:00:32,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-15 13:00:32,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-15 13:00:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:32,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:32,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580393529] [2022-04-15 13:00:32,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580393529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:32,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:32,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:00:32,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:32,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1945169424] [2022-04-15 13:00:32,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1945169424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:32,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:32,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:00:32,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742479652] [2022-04-15 13:00:32,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:32,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-15 13:00:32,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:32,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-15 13:00:32,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:32,298 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:00:32,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:32,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:00:32,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:00:32,319 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-15 13:00:32,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:32,498 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-04-15 13:00:32,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:00:32,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-15 13:00:32,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:00:32,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-15 13:00:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-15 13:00:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-15 13:00:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-15 13:00:32,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-04-15 13:00:32,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:32,582 INFO L225 Difference]: With dead ends: 39 [2022-04-15 13:00:32,583 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 13:00:32,586 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:00:32,591 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:00:32,592 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:00:32,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 13:00:32,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 13:00:32,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:00:32,628 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-15 13:00:32,629 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-15 13:00:32,630 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-15 13:00:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:32,641 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 13:00:32,641 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 13:00:32,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:32,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:32,642 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-15 13:00:32,643 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-15 13:00:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:32,647 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 13:00:32,647 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 13:00:32,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:32,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:32,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:00:32,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:00:32,648 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-15 13:00:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-15 13:00:32,651 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2022-04-15 13:00:32,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:00:32,651 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-15 13:00:32,652 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-15 13:00:32,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-15 13:00:32,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:32,682 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 13:00:32,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 13:00:32,685 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:32,685 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:00:32,686 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:00:32,686 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:32,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:32,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1162558691, now seen corresponding path program 1 times [2022-04-15 13:00:32,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:32,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1286281763] [2022-04-15 13:00:32,904 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:00:32,908 INFO L85 PathProgramCache]: Analyzing trace with hash -275055010, now seen corresponding path program 1 times [2022-04-15 13:00:32,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:32,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057021680] [2022-04-15 13:00:32,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:32,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:33,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:33,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {194#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {186#true} is VALID [2022-04-15 13:00:33,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#true} assume true; {186#true} is VALID [2022-04-15 13:00:33,194 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {186#true} {186#true} #62#return; {186#true} is VALID [2022-04-15 13:00:33,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {186#true} call ULTIMATE.init(); {194#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:33,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {186#true} is VALID [2022-04-15 13:00:33,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#true} assume true; {186#true} is VALID [2022-04-15 13:00:33,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186#true} {186#true} #62#return; {186#true} is VALID [2022-04-15 13:00:33,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {186#true} call #t~ret5 := main(); {186#true} is VALID [2022-04-15 13:00:33,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {186#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {186#true} is VALID [2022-04-15 13:00:33,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {186#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {191#(and (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-15 13:00:33,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {191#(and (= main_~j~0 0) (= main_~i~0 0))} assume !(~i~0 < ~n~0); {191#(and (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-15 13:00:33,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {191#(and (= main_~j~0 0) (= main_~i~0 0))} ~k~0 := ~i~0; {192#(and (= main_~k~0 0) (= main_~j~0 0))} is VALID [2022-04-15 13:00:33,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {192#(and (= main_~k~0 0) (= main_~j~0 0))} [66] L28-2-->L28-3_primed: Formula: (or (and (= v_main_~j~0_In_1 v_main_~j~0_Out_2) (= v_main_~k~0_In_1 v_main_~k~0_Out_2)) (and (= (mod (+ v_main_~k~0_Out_2 (* 3 v_main_~k~0_In_1)) 4) 0) (= (mod v_main_~j~0_Out_2 2) 0) (= (+ (* v_main_~j~0_In_1 4) (* (- 4) v_main_~k~0_In_1)) (+ (* v_main_~k~0_Out_2 (- 4)) (* 4 v_main_~j~0_Out_2))) (<= 0 (div (+ v_main_~k~0_Out_2 (* (- 1) v_main_~k~0_In_1)) (- 4))))) InVars {main_~k~0=v_main_~k~0_In_1, main_~j~0=v_main_~j~0_In_1} OutVars{main_~k~0=v_main_~k~0_Out_2, main_~j~0=v_main_~j~0_Out_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0] {193#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:33,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {193#(= (* 2 (div main_~j~0 2)) main_~j~0)} [65] L28-3_primed-->L28-3: Formula: (not (= (let ((.cse0 (mod v_main_~j~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~j~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~j~0=v_main_~j~0_1} OutVars{main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {187#false} is VALID [2022-04-15 13:00:33,202 INFO L272 TraceCheckUtils]: 11: Hoare triple {187#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {187#false} is VALID [2022-04-15 13:00:33,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {187#false} ~cond := #in~cond; {187#false} is VALID [2022-04-15 13:00:33,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {187#false} assume 0 == ~cond; {187#false} is VALID [2022-04-15 13:00:33,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {187#false} assume !false; {187#false} is VALID [2022-04-15 13:00:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:33,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:33,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057021680] [2022-04-15 13:00:33,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057021680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:33,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:33,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:00:33,313 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:33,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1286281763] [2022-04-15 13:00:33,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1286281763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:33,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:33,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:00:33,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330028799] [2022-04-15 13:00:33,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:33,315 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:00:33,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:33,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:33,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:33,333 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:00:33,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:33,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:00:33,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-04-15 13:00:33,334 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:33,502 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 13:00:33,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:00:33,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:00:33,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:00:33,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-15 13:00:33,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-15 13:00:33,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-15 13:00:33,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:33,539 INFO L225 Difference]: With dead ends: 24 [2022-04-15 13:00:33,539 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 13:00:33,539 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-15 13:00:33,540 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:00:33,541 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:00:33,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 13:00:33,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 13:00:33,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:00:33,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:33,545 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:33,545 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:33,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:33,546 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-15 13:00:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 13:00:33,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:33,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:33,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 13:00:33,547 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 13:00:33,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:33,548 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-15 13:00:33,548 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 13:00:33,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:33,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:33,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:00:33,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:00:33,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:33,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-15 13:00:33,550 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 15 [2022-04-15 13:00:33,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:00:33,550 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-15 13:00:33,551 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:33,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-15 13:00:33,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:33,567 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 13:00:33,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 13:00:33,568 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:33,568 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:00:33,568 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:00:33,568 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:33,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:33,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1035344830, now seen corresponding path program 1 times [2022-04-15 13:00:33,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:33,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1040030762] [2022-04-15 13:00:33,791 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:00:33,792 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:00:33,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1035344830, now seen corresponding path program 2 times [2022-04-15 13:00:33,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:33,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176232568] [2022-04-15 13:00:33,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:33,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:33,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:33,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {324#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {317#true} is VALID [2022-04-15 13:00:33,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {317#true} assume true; {317#true} is VALID [2022-04-15 13:00:33,949 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {317#true} {317#true} #62#return; {317#true} is VALID [2022-04-15 13:00:33,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {317#true} call ULTIMATE.init(); {324#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:33,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {324#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {317#true} is VALID [2022-04-15 13:00:33,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {317#true} assume true; {317#true} is VALID [2022-04-15 13:00:33,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {317#true} {317#true} #62#return; {317#true} is VALID [2022-04-15 13:00:33,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {317#true} call #t~ret5 := main(); {317#true} is VALID [2022-04-15 13:00:33,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {317#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {317#true} is VALID [2022-04-15 13:00:33,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {317#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {322#(= main_~i~0 0)} is VALID [2022-04-15 13:00:33,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {322#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {323#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:33,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {323#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {323#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:33,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {323#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {323#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:33,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {323#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {318#false} is VALID [2022-04-15 13:00:33,961 INFO L272 TraceCheckUtils]: 11: Hoare triple {318#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {318#false} is VALID [2022-04-15 13:00:33,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {318#false} ~cond := #in~cond; {318#false} is VALID [2022-04-15 13:00:33,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {318#false} assume 0 == ~cond; {318#false} is VALID [2022-04-15 13:00:33,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {318#false} assume !false; {318#false} is VALID [2022-04-15 13:00:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:33,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:33,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176232568] [2022-04-15 13:00:33,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176232568] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:00:33,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692219468] [2022-04-15 13:00:33,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:00:33,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:33,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:00:33,972 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:00:34,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 13:00:34,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:00:34,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:00:34,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:00:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:34,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:00:34,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {317#true} call ULTIMATE.init(); {317#true} is VALID [2022-04-15 13:00:34,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {317#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {317#true} is VALID [2022-04-15 13:00:34,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {317#true} assume true; {317#true} is VALID [2022-04-15 13:00:34,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {317#true} {317#true} #62#return; {317#true} is VALID [2022-04-15 13:00:34,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {317#true} call #t~ret5 := main(); {317#true} is VALID [2022-04-15 13:00:34,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {317#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {317#true} is VALID [2022-04-15 13:00:34,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {317#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {322#(= main_~i~0 0)} is VALID [2022-04-15 13:00:34,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {322#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {349#(= (+ main_~j~0 (- 6)) 0)} is VALID [2022-04-15 13:00:34,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {349#(= (+ main_~j~0 (- 6)) 0)} assume !(~i~0 < ~n~0); {349#(= (+ main_~j~0 (- 6)) 0)} is VALID [2022-04-15 13:00:34,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {349#(= (+ main_~j~0 (- 6)) 0)} ~k~0 := ~i~0; {349#(= (+ main_~j~0 (- 6)) 0)} is VALID [2022-04-15 13:00:34,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {349#(= (+ main_~j~0 (- 6)) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {318#false} is VALID [2022-04-15 13:00:34,114 INFO L272 TraceCheckUtils]: 11: Hoare triple {318#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {318#false} is VALID [2022-04-15 13:00:34,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {318#false} ~cond := #in~cond; {318#false} is VALID [2022-04-15 13:00:34,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {318#false} assume 0 == ~cond; {318#false} is VALID [2022-04-15 13:00:34,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {318#false} assume !false; {318#false} is VALID [2022-04-15 13:00:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:34,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:34,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {318#false} assume !false; {318#false} is VALID [2022-04-15 13:00:34,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {318#false} assume 0 == ~cond; {318#false} is VALID [2022-04-15 13:00:34,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {318#false} ~cond := #in~cond; {318#false} is VALID [2022-04-15 13:00:34,174 INFO L272 TraceCheckUtils]: 11: Hoare triple {318#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {318#false} is VALID [2022-04-15 13:00:34,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {323#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {318#false} is VALID [2022-04-15 13:00:34,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {323#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {323#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:34,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {323#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {323#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:34,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {392#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {323#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:34,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {317#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {392#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:34,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {317#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {317#true} is VALID [2022-04-15 13:00:34,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {317#true} call #t~ret5 := main(); {317#true} is VALID [2022-04-15 13:00:34,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {317#true} {317#true} #62#return; {317#true} is VALID [2022-04-15 13:00:34,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {317#true} assume true; {317#true} is VALID [2022-04-15 13:00:34,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {317#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {317#true} is VALID [2022-04-15 13:00:34,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {317#true} call ULTIMATE.init(); {317#true} is VALID [2022-04-15 13:00:34,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:34,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692219468] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:34,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:34,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-15 13:00:34,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:34,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1040030762] [2022-04-15 13:00:34,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1040030762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:34,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:34,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:00:34,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26370684] [2022-04-15 13:00:34,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:34,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:00:34,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:34,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:34,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:34,211 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:00:34,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:34,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:00:34,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 13:00:34,212 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:34,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:34,311 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 13:00:34,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:00:34,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:00:34,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:00:34,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:34,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-15 13:00:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:34,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-15 13:00:34,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-15 13:00:34,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:34,345 INFO L225 Difference]: With dead ends: 24 [2022-04-15 13:00:34,345 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 13:00:34,346 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:00:34,348 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:00:34,356 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 25 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:00:34,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 13:00:34,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 13:00:34,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:00:34,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:34,360 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:34,360 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:34,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:34,362 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 13:00:34,362 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 13:00:34,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:34,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:34,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 13:00:34,363 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 13:00:34,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:34,364 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 13:00:34,364 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 13:00:34,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:34,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:34,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:00:34,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:00:34,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:34,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-15 13:00:34,366 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-15 13:00:34,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:00:34,366 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-15 13:00:34,367 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:34,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-15 13:00:34,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 13:00:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 13:00:34,384 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:34,384 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:00:34,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 13:00:34,608 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:34,609 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:34,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:34,609 INFO L85 PathProgramCache]: Analyzing trace with hash -31650031, now seen corresponding path program 3 times [2022-04-15 13:00:34,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:34,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [951911151] [2022-04-15 13:00:34,818 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:00:34,819 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:00:34,819 INFO L85 PathProgramCache]: Analyzing trace with hash -31650031, now seen corresponding path program 4 times [2022-04-15 13:00:34,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:34,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352308679] [2022-04-15 13:00:34,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:34,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:34,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:34,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {544#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {536#true} is VALID [2022-04-15 13:00:34,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {536#true} assume true; {536#true} is VALID [2022-04-15 13:00:34,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {536#true} {536#true} #62#return; {536#true} is VALID [2022-04-15 13:00:34,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {536#true} call ULTIMATE.init(); {544#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:34,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {544#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {536#true} is VALID [2022-04-15 13:00:34,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {536#true} assume true; {536#true} is VALID [2022-04-15 13:00:34,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {536#true} {536#true} #62#return; {536#true} is VALID [2022-04-15 13:00:34,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {536#true} call #t~ret5 := main(); {536#true} is VALID [2022-04-15 13:00:34,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {536#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {536#true} is VALID [2022-04-15 13:00:34,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {536#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {541#(= main_~i~0 0)} is VALID [2022-04-15 13:00:34,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {541#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {542#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:34,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {542#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {543#(and (not (<= (div main_~j~0 2) 4)) (= (* 2 (div main_~j~0 2)) main_~j~0))} is VALID [2022-04-15 13:00:34,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {543#(and (not (<= (div main_~j~0 2) 4)) (= (* 2 (div main_~j~0 2)) main_~j~0))} assume !(~i~0 < ~n~0); {543#(and (not (<= (div main_~j~0 2) 4)) (= (* 2 (div main_~j~0 2)) main_~j~0))} is VALID [2022-04-15 13:00:34,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {543#(and (not (<= (div main_~j~0 2) 4)) (= (* 2 (div main_~j~0 2)) main_~j~0))} ~k~0 := ~i~0; {543#(and (not (<= (div main_~j~0 2) 4)) (= (* 2 (div main_~j~0 2)) main_~j~0))} is VALID [2022-04-15 13:00:34,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {543#(and (not (<= (div main_~j~0 2) 4)) (= (* 2 (div main_~j~0 2)) main_~j~0))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {537#false} is VALID [2022-04-15 13:00:34,981 INFO L272 TraceCheckUtils]: 12: Hoare triple {537#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {537#false} is VALID [2022-04-15 13:00:34,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {537#false} ~cond := #in~cond; {537#false} is VALID [2022-04-15 13:00:34,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {537#false} assume 0 == ~cond; {537#false} is VALID [2022-04-15 13:00:34,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {537#false} assume !false; {537#false} is VALID [2022-04-15 13:00:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:34,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:34,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352308679] [2022-04-15 13:00:34,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352308679] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:00:34,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42782224] [2022-04-15 13:00:34,983 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:00:34,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:34,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:00:34,988 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:00:34,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 13:00:35,025 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:00:35,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:00:35,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 13:00:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:35,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:00:35,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {536#true} call ULTIMATE.init(); {536#true} is VALID [2022-04-15 13:00:35,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {536#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {536#true} is VALID [2022-04-15 13:00:35,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {536#true} assume true; {536#true} is VALID [2022-04-15 13:00:35,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {536#true} {536#true} #62#return; {536#true} is VALID [2022-04-15 13:00:35,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {536#true} call #t~ret5 := main(); {536#true} is VALID [2022-04-15 13:00:35,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {536#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {536#true} is VALID [2022-04-15 13:00:35,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {536#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {541#(= main_~i~0 0)} is VALID [2022-04-15 13:00:35,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {541#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {542#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:35,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {542#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {572#(and (<= main_~j~0 10) (<= 10 main_~j~0))} is VALID [2022-04-15 13:00:35,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {572#(and (<= main_~j~0 10) (<= 10 main_~j~0))} assume !(~i~0 < ~n~0); {572#(and (<= main_~j~0 10) (<= 10 main_~j~0))} is VALID [2022-04-15 13:00:35,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {572#(and (<= main_~j~0 10) (<= 10 main_~j~0))} ~k~0 := ~i~0; {572#(and (<= main_~j~0 10) (<= 10 main_~j~0))} is VALID [2022-04-15 13:00:35,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {572#(and (<= main_~j~0 10) (<= 10 main_~j~0))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {537#false} is VALID [2022-04-15 13:00:35,282 INFO L272 TraceCheckUtils]: 12: Hoare triple {537#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {537#false} is VALID [2022-04-15 13:00:35,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {537#false} ~cond := #in~cond; {537#false} is VALID [2022-04-15 13:00:35,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {537#false} assume 0 == ~cond; {537#false} is VALID [2022-04-15 13:00:35,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {537#false} assume !false; {537#false} is VALID [2022-04-15 13:00:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:35,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:35,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {537#false} assume !false; {537#false} is VALID [2022-04-15 13:00:35,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {537#false} assume 0 == ~cond; {537#false} is VALID [2022-04-15 13:00:35,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {537#false} ~cond := #in~cond; {537#false} is VALID [2022-04-15 13:00:35,345 INFO L272 TraceCheckUtils]: 12: Hoare triple {537#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {537#false} is VALID [2022-04-15 13:00:35,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {606#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {537#false} is VALID [2022-04-15 13:00:35,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {606#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {606#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:35,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {606#(= (mod main_~j~0 2) 0)} assume !(~i~0 < ~n~0); {606#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:35,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {616#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {606#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:35,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {616#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {616#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:35,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {536#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {616#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:35,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {536#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {536#true} is VALID [2022-04-15 13:00:35,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {536#true} call #t~ret5 := main(); {536#true} is VALID [2022-04-15 13:00:35,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {536#true} {536#true} #62#return; {536#true} is VALID [2022-04-15 13:00:35,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {536#true} assume true; {536#true} is VALID [2022-04-15 13:00:35,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {536#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {536#true} is VALID [2022-04-15 13:00:35,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {536#true} call ULTIMATE.init(); {536#true} is VALID [2022-04-15 13:00:35,349 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-15 13:00:35,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42782224] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:35,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:35,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 9 [2022-04-15 13:00:35,350 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:35,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [951911151] [2022-04-15 13:00:35,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [951911151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:35,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:35,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:00:35,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645462105] [2022-04-15 13:00:35,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:35,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 13:00:35,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:35,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:35,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:35,364 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:00:35,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:35,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:00:35,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:00:35,365 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:35,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:35,517 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 13:00:35,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:00:35,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 13:00:35,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:00:35,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:35,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2022-04-15 13:00:35,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:35,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2022-04-15 13:00:35,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 25 transitions. [2022-04-15 13:00:35,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:35,546 INFO L225 Difference]: With dead ends: 25 [2022-04-15 13:00:35,546 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 13:00:35,546 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-15 13:00:35,547 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:00:35,547 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 31 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:00:35,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 13:00:35,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 13:00:35,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:00:35,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:35,553 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:35,553 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:35,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:35,554 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 13:00:35,554 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 13:00:35,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:35,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:35,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 13:00:35,555 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 13:00:35,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:35,556 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 13:00:35,556 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 13:00:35,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:35,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:35,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:00:35,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:00:35,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-15 13:00:35,558 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-15 13:00:35,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:00:35,558 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-15 13:00:35,558 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:35,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-15 13:00:35,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:35,585 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 13:00:35,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 13:00:35,585 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:35,586 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:00:35,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 13:00:35,786 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 13:00:35,786 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:35,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:35,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1251247646, now seen corresponding path program 5 times [2022-04-15 13:00:35,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:35,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1579625975] [2022-04-15 13:00:35,968 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:00:35,969 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:00:35,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1251247646, now seen corresponding path program 6 times [2022-04-15 13:00:35,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:35,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622073296] [2022-04-15 13:00:35,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:35,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:36,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:36,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {780#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {771#true} is VALID [2022-04-15 13:00:36,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {771#true} assume true; {771#true} is VALID [2022-04-15 13:00:36,084 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {771#true} {771#true} #62#return; {771#true} is VALID [2022-04-15 13:00:36,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {771#true} call ULTIMATE.init(); {780#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:36,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {780#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {771#true} is VALID [2022-04-15 13:00:36,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {771#true} assume true; {771#true} is VALID [2022-04-15 13:00:36,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {771#true} {771#true} #62#return; {771#true} is VALID [2022-04-15 13:00:36,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {771#true} call #t~ret5 := main(); {771#true} is VALID [2022-04-15 13:00:36,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {771#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {771#true} is VALID [2022-04-15 13:00:36,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {771#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {776#(= main_~i~0 0)} is VALID [2022-04-15 13:00:36,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {776#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {777#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:36,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {777#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {778#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:36,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {778#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {779#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (not (<= (div main_~j~0 2) 6)))} is VALID [2022-04-15 13:00:36,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {779#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (not (<= (div main_~j~0 2) 6)))} assume !(~i~0 < ~n~0); {779#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (not (<= (div main_~j~0 2) 6)))} is VALID [2022-04-15 13:00:36,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {779#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (not (<= (div main_~j~0 2) 6)))} ~k~0 := ~i~0; {779#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (not (<= (div main_~j~0 2) 6)))} is VALID [2022-04-15 13:00:36,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {779#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (not (<= (div main_~j~0 2) 6)))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {772#false} is VALID [2022-04-15 13:00:36,091 INFO L272 TraceCheckUtils]: 13: Hoare triple {772#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {772#false} is VALID [2022-04-15 13:00:36,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {772#false} ~cond := #in~cond; {772#false} is VALID [2022-04-15 13:00:36,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {772#false} assume 0 == ~cond; {772#false} is VALID [2022-04-15 13:00:36,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {772#false} assume !false; {772#false} is VALID [2022-04-15 13:00:36,091 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:36,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:36,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622073296] [2022-04-15 13:00:36,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622073296] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:00:36,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887308046] [2022-04-15 13:00:36,092 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:00:36,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:36,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:00:36,096 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:00:36,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 13:00:36,145 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 13:00:36,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:00:36,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 13:00:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:36,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:00:36,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {771#true} call ULTIMATE.init(); {771#true} is VALID [2022-04-15 13:00:36,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {771#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {771#true} is VALID [2022-04-15 13:00:36,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {771#true} assume true; {771#true} is VALID [2022-04-15 13:00:36,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {771#true} {771#true} #62#return; {771#true} is VALID [2022-04-15 13:00:36,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {771#true} call #t~ret5 := main(); {771#true} is VALID [2022-04-15 13:00:36,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {771#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {771#true} is VALID [2022-04-15 13:00:36,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {771#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {776#(= main_~i~0 0)} is VALID [2022-04-15 13:00:36,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {776#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {777#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:36,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {777#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {778#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:36,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {778#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {811#(and (<= 14 main_~j~0) (<= main_~j~0 14))} is VALID [2022-04-15 13:00:36,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {811#(and (<= 14 main_~j~0) (<= main_~j~0 14))} assume !(~i~0 < ~n~0); {811#(and (<= 14 main_~j~0) (<= main_~j~0 14))} is VALID [2022-04-15 13:00:36,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {811#(and (<= 14 main_~j~0) (<= main_~j~0 14))} ~k~0 := ~i~0; {811#(and (<= 14 main_~j~0) (<= main_~j~0 14))} is VALID [2022-04-15 13:00:36,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {811#(and (<= 14 main_~j~0) (<= main_~j~0 14))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {772#false} is VALID [2022-04-15 13:00:36,410 INFO L272 TraceCheckUtils]: 13: Hoare triple {772#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {772#false} is VALID [2022-04-15 13:00:36,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {772#false} ~cond := #in~cond; {772#false} is VALID [2022-04-15 13:00:36,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {772#false} assume 0 == ~cond; {772#false} is VALID [2022-04-15 13:00:36,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {772#false} assume !false; {772#false} is VALID [2022-04-15 13:00:36,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:36,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:36,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {772#false} assume !false; {772#false} is VALID [2022-04-15 13:00:36,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {772#false} assume 0 == ~cond; {772#false} is VALID [2022-04-15 13:00:36,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {772#false} ~cond := #in~cond; {772#false} is VALID [2022-04-15 13:00:36,479 INFO L272 TraceCheckUtils]: 13: Hoare triple {772#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {772#false} is VALID [2022-04-15 13:00:36,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {845#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {772#false} is VALID [2022-04-15 13:00:36,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {845#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {845#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:36,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {845#(= (mod main_~j~0 2) 0)} assume !(~i~0 < ~n~0); {845#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:36,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {855#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {845#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:36,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {855#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {855#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:36,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {855#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {855#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:36,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {771#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {855#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:36,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {771#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {771#true} is VALID [2022-04-15 13:00:36,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {771#true} call #t~ret5 := main(); {771#true} is VALID [2022-04-15 13:00:36,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {771#true} {771#true} #62#return; {771#true} is VALID [2022-04-15 13:00:36,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {771#true} assume true; {771#true} is VALID [2022-04-15 13:00:36,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {771#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {771#true} is VALID [2022-04-15 13:00:36,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {771#true} call ULTIMATE.init(); {771#true} is VALID [2022-04-15 13:00:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 13:00:36,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887308046] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:36,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:36,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 4] total 10 [2022-04-15 13:00:36,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:36,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1579625975] [2022-04-15 13:00:36,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1579625975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:36,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:36,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:00:36,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033817601] [2022-04-15 13:00:36,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:36,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 13:00:36,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:36,493 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), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:36,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:36,506 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 13:00:36,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:36,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 13:00:36,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:00:36,507 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:36,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:36,702 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 13:00:36,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 13:00:36,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 13:00:36,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:00:36,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:36,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-04-15 13:00:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-04-15 13:00:36,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 26 transitions. [2022-04-15 13:00:36,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:36,733 INFO L225 Difference]: With dead ends: 26 [2022-04-15 13:00:36,733 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 13:00:36,734 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-15 13:00:36,734 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:00:36,735 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 36 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:00:36,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 13:00:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 13:00:36,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:00:36,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:36,741 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:36,741 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:36,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:36,743 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 13:00:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 13:00:36,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:36,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:36,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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 19 states. [2022-04-15 13:00:36,743 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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 19 states. [2022-04-15 13:00:36,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:36,744 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 13:00:36,745 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 13:00:36,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:36,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:36,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:00:36,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:00:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:36,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-15 13:00:36,746 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2022-04-15 13:00:36,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:00:36,746 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-15 13:00:36,746 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:36,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-15 13:00:36,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:36,779 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 13:00:36,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 13:00:36,782 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:36,782 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:00:36,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 13:00:36,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:36,996 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:36,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:36,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1928597327, now seen corresponding path program 7 times [2022-04-15 13:00:36,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:36,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2010303287] [2022-04-15 13:00:37,170 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:00:37,171 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:00:37,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1928597327, now seen corresponding path program 8 times [2022-04-15 13:00:37,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:37,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118224389] [2022-04-15 13:00:37,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:37,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:37,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:37,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {1031#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {1021#true} is VALID [2022-04-15 13:00:37,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {1021#true} assume true; {1021#true} is VALID [2022-04-15 13:00:37,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1021#true} {1021#true} #62#return; {1021#true} is VALID [2022-04-15 13:00:37,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {1021#true} call ULTIMATE.init(); {1031#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:37,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {1031#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {1021#true} is VALID [2022-04-15 13:00:37,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {1021#true} assume true; {1021#true} is VALID [2022-04-15 13:00:37,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1021#true} {1021#true} #62#return; {1021#true} is VALID [2022-04-15 13:00:37,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {1021#true} call #t~ret5 := main(); {1021#true} is VALID [2022-04-15 13:00:37,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {1021#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1021#true} is VALID [2022-04-15 13:00:37,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {1021#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {1026#(= main_~i~0 0)} is VALID [2022-04-15 13:00:37,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {1026#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1027#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:37,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {1027#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1028#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:37,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {1028#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1029#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:00:37,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {1029#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1030#(and (<= 18 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:00:37,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {1030#(and (<= 18 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(~i~0 < ~n~0); {1030#(and (<= 18 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:00:37,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {1030#(and (<= 18 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} ~k~0 := ~i~0; {1030#(and (<= 18 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:00:37,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {1030#(and (<= 18 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {1022#false} is VALID [2022-04-15 13:00:37,313 INFO L272 TraceCheckUtils]: 14: Hoare triple {1022#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {1022#false} is VALID [2022-04-15 13:00:37,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {1022#false} ~cond := #in~cond; {1022#false} is VALID [2022-04-15 13:00:37,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {1022#false} assume 0 == ~cond; {1022#false} is VALID [2022-04-15 13:00:37,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {1022#false} assume !false; {1022#false} is VALID [2022-04-15 13:00:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:37,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:37,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118224389] [2022-04-15 13:00:37,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118224389] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:00:37,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647564945] [2022-04-15 13:00:37,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:00:37,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:37,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:00:37,316 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:00:37,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 13:00:37,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:00:37,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:00:37,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 13:00:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:37,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:00:37,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {1021#true} call ULTIMATE.init(); {1021#true} is VALID [2022-04-15 13:00:37,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {1021#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {1021#true} is VALID [2022-04-15 13:00:37,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {1021#true} assume true; {1021#true} is VALID [2022-04-15 13:00:37,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1021#true} {1021#true} #62#return; {1021#true} is VALID [2022-04-15 13:00:37,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {1021#true} call #t~ret5 := main(); {1021#true} is VALID [2022-04-15 13:00:37,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {1021#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1021#true} is VALID [2022-04-15 13:00:37,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {1021#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {1026#(= main_~i~0 0)} is VALID [2022-04-15 13:00:37,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {1026#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1027#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:37,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {1027#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1028#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:37,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {1028#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1029#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:00:37,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {1029#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1065#(and (<= 18 main_~j~0) (<= main_~j~0 18))} is VALID [2022-04-15 13:00:37,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {1065#(and (<= 18 main_~j~0) (<= main_~j~0 18))} assume !(~i~0 < ~n~0); {1065#(and (<= 18 main_~j~0) (<= main_~j~0 18))} is VALID [2022-04-15 13:00:37,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {1065#(and (<= 18 main_~j~0) (<= main_~j~0 18))} ~k~0 := ~i~0; {1065#(and (<= 18 main_~j~0) (<= main_~j~0 18))} is VALID [2022-04-15 13:00:37,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {1065#(and (<= 18 main_~j~0) (<= main_~j~0 18))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {1022#false} is VALID [2022-04-15 13:00:37,644 INFO L272 TraceCheckUtils]: 14: Hoare triple {1022#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {1022#false} is VALID [2022-04-15 13:00:37,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {1022#false} ~cond := #in~cond; {1022#false} is VALID [2022-04-15 13:00:37,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {1022#false} assume 0 == ~cond; {1022#false} is VALID [2022-04-15 13:00:37,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {1022#false} assume !false; {1022#false} is VALID [2022-04-15 13:00:37,645 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:37,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:37,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {1022#false} assume !false; {1022#false} is VALID [2022-04-15 13:00:37,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {1022#false} assume 0 == ~cond; {1022#false} is VALID [2022-04-15 13:00:37,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {1022#false} ~cond := #in~cond; {1022#false} is VALID [2022-04-15 13:00:37,721 INFO L272 TraceCheckUtils]: 14: Hoare triple {1022#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {1022#false} is VALID [2022-04-15 13:00:37,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {1099#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {1022#false} is VALID [2022-04-15 13:00:37,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {1099#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {1099#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:37,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {1099#(= (mod main_~j~0 2) 0)} assume !(~i~0 < ~n~0); {1099#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:37,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {1109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1099#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:37,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {1109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:37,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {1109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:37,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {1109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:37,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {1021#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {1109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:37,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {1021#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1021#true} is VALID [2022-04-15 13:00:37,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {1021#true} call #t~ret5 := main(); {1021#true} is VALID [2022-04-15 13:00:37,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1021#true} {1021#true} #62#return; {1021#true} is VALID [2022-04-15 13:00:37,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {1021#true} assume true; {1021#true} is VALID [2022-04-15 13:00:37,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {1021#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {1021#true} is VALID [2022-04-15 13:00:37,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {1021#true} call ULTIMATE.init(); {1021#true} is VALID [2022-04-15 13:00:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 13:00:37,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647564945] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:37,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:37,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 4] total 11 [2022-04-15 13:00:37,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:37,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2010303287] [2022-04-15 13:00:37,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2010303287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:37,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:37,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:00:37,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758191865] [2022-04-15 13:00:37,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:37,729 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 18 [2022-04-15 13:00:37,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:37,729 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-15 13:00:37,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:37,745 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:00:37,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:37,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:00:37,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 13:00:37,746 INFO L87 Difference]: Start difference. First operand 19 states and 19 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-15 13:00:37,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:37,960 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 13:00:37,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:00:37,960 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 18 [2022-04-15 13:00:37,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:00:37,960 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-15 13:00:37,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2022-04-15 13:00:37,962 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-15 13:00:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2022-04-15 13:00:37,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 27 transitions. [2022-04-15 13:00:37,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:37,988 INFO L225 Difference]: With dead ends: 27 [2022-04-15 13:00:37,988 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 13:00:37,989 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-15 13:00:37,989 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:00:37,989 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:00:37,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 13:00:37,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 13:00:37,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:00:37,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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-15 13:00:37,998 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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-15 13:00:37,998 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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-15 13:00:37,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:37,999 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 13:00:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 13:00:38,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:38,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:38,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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 20 states. [2022-04-15 13:00:38,000 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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 20 states. [2022-04-15 13:00:38,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:38,001 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 13:00:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 13:00:38,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:38,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:38,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:00:38,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:00:38,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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-15 13:00:38,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-15 13:00:38,003 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2022-04-15 13:00:38,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:00:38,003 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-15 13:00:38,003 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-15 13:00:38,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-15 13:00:38,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:38,025 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 13:00:38,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 13:00:38,025 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:38,025 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:00:38,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 13:00:38,235 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:38,235 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:38,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:38,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1719543682, now seen corresponding path program 9 times [2022-04-15 13:00:38,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:38,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [517102368] [2022-04-15 13:00:38,418 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:00:38,418 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:00:38,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1719543682, now seen corresponding path program 10 times [2022-04-15 13:00:38,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:38,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842508759] [2022-04-15 13:00:38,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:38,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:38,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:38,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {1297#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {1286#true} is VALID [2022-04-15 13:00:38,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {1286#true} assume true; {1286#true} is VALID [2022-04-15 13:00:38,597 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1286#true} {1286#true} #62#return; {1286#true} is VALID [2022-04-15 13:00:38,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {1286#true} call ULTIMATE.init(); {1297#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:38,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {1297#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {1286#true} is VALID [2022-04-15 13:00:38,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {1286#true} assume true; {1286#true} is VALID [2022-04-15 13:00:38,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1286#true} {1286#true} #62#return; {1286#true} is VALID [2022-04-15 13:00:38,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {1286#true} call #t~ret5 := main(); {1286#true} is VALID [2022-04-15 13:00:38,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {1286#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1286#true} is VALID [2022-04-15 13:00:38,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {1286#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {1291#(= main_~i~0 0)} is VALID [2022-04-15 13:00:38,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {1291#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1292#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:38,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {1292#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1293#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:38,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {1293#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1294#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:00:38,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {1294#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1295#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:00:38,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {1295#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1296#(and (<= main_~j~0 (* 2 (div main_~j~0 2))) (not (<= (div main_~j~0 2) 10)))} is VALID [2022-04-15 13:00:38,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {1296#(and (<= main_~j~0 (* 2 (div main_~j~0 2))) (not (<= (div main_~j~0 2) 10)))} assume !(~i~0 < ~n~0); {1296#(and (<= main_~j~0 (* 2 (div main_~j~0 2))) (not (<= (div main_~j~0 2) 10)))} is VALID [2022-04-15 13:00:38,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {1296#(and (<= main_~j~0 (* 2 (div main_~j~0 2))) (not (<= (div main_~j~0 2) 10)))} ~k~0 := ~i~0; {1296#(and (<= main_~j~0 (* 2 (div main_~j~0 2))) (not (<= (div main_~j~0 2) 10)))} is VALID [2022-04-15 13:00:38,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {1296#(and (<= main_~j~0 (* 2 (div main_~j~0 2))) (not (<= (div main_~j~0 2) 10)))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {1287#false} is VALID [2022-04-15 13:00:38,608 INFO L272 TraceCheckUtils]: 15: Hoare triple {1287#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {1287#false} is VALID [2022-04-15 13:00:38,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {1287#false} ~cond := #in~cond; {1287#false} is VALID [2022-04-15 13:00:38,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {1287#false} assume 0 == ~cond; {1287#false} is VALID [2022-04-15 13:00:38,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {1287#false} assume !false; {1287#false} is VALID [2022-04-15 13:00:38,609 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:38,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:38,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842508759] [2022-04-15 13:00:38,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842508759] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:00:38,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329121150] [2022-04-15 13:00:38,610 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:00:38,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:38,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:00:38,611 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:00:38,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 13:00:38,660 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:00:38,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:00:38,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 13:00:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:38,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:00:38,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {1286#true} call ULTIMATE.init(); {1286#true} is VALID [2022-04-15 13:00:38,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {1286#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {1286#true} is VALID [2022-04-15 13:00:38,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {1286#true} assume true; {1286#true} is VALID [2022-04-15 13:00:38,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1286#true} {1286#true} #62#return; {1286#true} is VALID [2022-04-15 13:00:38,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {1286#true} call #t~ret5 := main(); {1286#true} is VALID [2022-04-15 13:00:38,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {1286#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1286#true} is VALID [2022-04-15 13:00:38,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {1286#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {1291#(= main_~i~0 0)} is VALID [2022-04-15 13:00:38,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {1291#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1292#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:38,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {1292#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1293#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:38,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {1293#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1294#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:00:38,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {1294#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1295#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:00:38,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {1295#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1334#(and (<= 22 main_~j~0) (<= main_~j~0 22))} is VALID [2022-04-15 13:00:38,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {1334#(and (<= 22 main_~j~0) (<= main_~j~0 22))} assume !(~i~0 < ~n~0); {1334#(and (<= 22 main_~j~0) (<= main_~j~0 22))} is VALID [2022-04-15 13:00:38,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {1334#(and (<= 22 main_~j~0) (<= main_~j~0 22))} ~k~0 := ~i~0; {1334#(and (<= 22 main_~j~0) (<= main_~j~0 22))} is VALID [2022-04-15 13:00:38,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {1334#(and (<= 22 main_~j~0) (<= main_~j~0 22))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {1287#false} is VALID [2022-04-15 13:00:38,944 INFO L272 TraceCheckUtils]: 15: Hoare triple {1287#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {1287#false} is VALID [2022-04-15 13:00:38,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {1287#false} ~cond := #in~cond; {1287#false} is VALID [2022-04-15 13:00:38,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {1287#false} assume 0 == ~cond; {1287#false} is VALID [2022-04-15 13:00:38,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {1287#false} assume !false; {1287#false} is VALID [2022-04-15 13:00:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:38,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:39,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {1287#false} assume !false; {1287#false} is VALID [2022-04-15 13:00:39,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {1287#false} assume 0 == ~cond; {1287#false} is VALID [2022-04-15 13:00:39,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {1287#false} ~cond := #in~cond; {1287#false} is VALID [2022-04-15 13:00:39,036 INFO L272 TraceCheckUtils]: 15: Hoare triple {1287#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {1287#false} is VALID [2022-04-15 13:00:39,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {1368#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {1287#false} is VALID [2022-04-15 13:00:39,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {1368#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {1368#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:39,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {1368#(= (mod main_~j~0 2) 0)} assume !(~i~0 < ~n~0); {1368#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:39,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {1378#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1368#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:39,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {1378#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1378#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:39,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {1378#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1378#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:39,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {1378#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1378#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:39,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {1378#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1378#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:39,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {1286#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {1378#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:39,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {1286#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1286#true} is VALID [2022-04-15 13:00:39,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {1286#true} call #t~ret5 := main(); {1286#true} is VALID [2022-04-15 13:00:39,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1286#true} {1286#true} #62#return; {1286#true} is VALID [2022-04-15 13:00:39,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {1286#true} assume true; {1286#true} is VALID [2022-04-15 13:00:39,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {1286#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {1286#true} is VALID [2022-04-15 13:00:39,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {1286#true} call ULTIMATE.init(); {1286#true} is VALID [2022-04-15 13:00:39,043 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 13:00:39,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329121150] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:39,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:39,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 4] total 12 [2022-04-15 13:00:39,044 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:39,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [517102368] [2022-04-15 13:00:39,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [517102368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:39,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:39,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:00:39,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753178105] [2022-04-15 13:00:39,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:39,045 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 19 [2022-04-15 13:00:39,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:39,045 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-15 13:00:39,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:39,064 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 13:00:39,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:39,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 13:00:39,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-15 13:00:39,065 INFO L87 Difference]: Start difference. First operand 20 states and 20 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-15 13:00:39,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:39,340 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 13:00:39,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 13:00:39,341 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 19 [2022-04-15 13:00:39,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:00:39,341 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-15 13:00:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2022-04-15 13:00:39,342 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-15 13:00:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2022-04-15 13:00:39,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 28 transitions. [2022-04-15 13:00:39,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:39,370 INFO L225 Difference]: With dead ends: 28 [2022-04-15 13:00:39,370 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 13:00:39,371 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-04-15 13:00:39,371 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:00:39,371 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 46 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:00:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 13:00:39,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 13:00:39,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:00:39,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:39,382 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:39,382 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:39,383 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 13:00:39,383 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 13:00:39,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:39,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:39,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 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 21 states. [2022-04-15 13:00:39,384 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 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 21 states. [2022-04-15 13:00:39,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:39,385 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 13:00:39,385 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 13:00:39,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:39,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:39,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:00:39,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:00:39,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:39,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-15 13:00:39,386 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2022-04-15 13:00:39,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:00:39,387 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-15 13:00:39,387 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-15 13:00:39,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-15 13:00:39,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 13:00:39,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 13:00:39,410 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:39,410 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:00:39,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 13:00:39,615 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:39,616 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:39,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:39,616 INFO L85 PathProgramCache]: Analyzing trace with hash 466152017, now seen corresponding path program 11 times [2022-04-15 13:00:39,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:39,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [92543141] [2022-04-15 13:00:39,786 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:00:39,786 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:00:39,786 INFO L85 PathProgramCache]: Analyzing trace with hash 466152017, now seen corresponding path program 12 times [2022-04-15 13:00:39,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:39,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587655133] [2022-04-15 13:00:39,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:39,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:39,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:39,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {1578#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {1566#true} is VALID [2022-04-15 13:00:39,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-15 13:00:39,925 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1566#true} {1566#true} #62#return; {1566#true} is VALID [2022-04-15 13:00:39,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1578#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:39,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {1578#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {1566#true} is VALID [2022-04-15 13:00:39,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-15 13:00:39,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #62#return; {1566#true} is VALID [2022-04-15 13:00:39,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret5 := main(); {1566#true} is VALID [2022-04-15 13:00:39,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1566#true} is VALID [2022-04-15 13:00:39,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {1566#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {1571#(= main_~i~0 0)} is VALID [2022-04-15 13:00:39,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {1571#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1572#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:39,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {1572#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1573#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:39,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {1573#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1574#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:00:39,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {1574#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1575#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:00:39,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {1575#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1576#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:00:39,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {1576#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1577#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (<= 26 main_~j~0))} is VALID [2022-04-15 13:00:39,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {1577#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (<= 26 main_~j~0))} assume !(~i~0 < ~n~0); {1577#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (<= 26 main_~j~0))} is VALID [2022-04-15 13:00:39,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {1577#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (<= 26 main_~j~0))} ~k~0 := ~i~0; {1577#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (<= 26 main_~j~0))} is VALID [2022-04-15 13:00:39,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {1577#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (<= 26 main_~j~0))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {1567#false} is VALID [2022-04-15 13:00:39,933 INFO L272 TraceCheckUtils]: 16: Hoare triple {1567#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {1567#false} is VALID [2022-04-15 13:00:39,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {1567#false} ~cond := #in~cond; {1567#false} is VALID [2022-04-15 13:00:39,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {1567#false} assume 0 == ~cond; {1567#false} is VALID [2022-04-15 13:00:39,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-15 13:00:39,934 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:39,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:39,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587655133] [2022-04-15 13:00:39,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587655133] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:00:39,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659462082] [2022-04-15 13:00:39,934 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:00:39,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:39,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:00:39,935 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:00:39,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 13:00:39,987 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 13:00:39,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:00:39,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 13:00:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:39,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:00:40,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-15 13:00:40,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {1566#true} is VALID [2022-04-15 13:00:40,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-15 13:00:40,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #62#return; {1566#true} is VALID [2022-04-15 13:00:40,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret5 := main(); {1566#true} is VALID [2022-04-15 13:00:40,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1566#true} is VALID [2022-04-15 13:00:40,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {1566#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {1571#(= main_~i~0 0)} is VALID [2022-04-15 13:00:40,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {1571#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1603#(and (< 0 main_~n~0) (= main_~i~0 4))} is VALID [2022-04-15 13:00:40,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {1603#(and (< 0 main_~n~0) (= main_~i~0 4))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1607#(and (< 0 main_~n~0) (= main_~i~0 8))} is VALID [2022-04-15 13:00:40,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {1607#(and (< 0 main_~n~0) (= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1611#(and (< 0 main_~n~0) (= 8 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:00:40,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {1611#(and (< 0 main_~n~0) (= 8 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1615#(and (< 0 main_~n~0) (= main_~i~0 16))} is VALID [2022-04-15 13:00:40,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {1615#(and (< 0 main_~n~0) (= main_~i~0 16))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1619#(and (< 0 main_~n~0) (= 16 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:00:40,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {1619#(and (< 0 main_~n~0) (= 16 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1623#(and (< 0 main_~n~0) (= main_~i~0 24))} is VALID [2022-04-15 13:00:40,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {1623#(and (< 0 main_~n~0) (= main_~i~0 24))} assume !(~i~0 < ~n~0); {1627#(= main_~i~0 24)} is VALID [2022-04-15 13:00:40,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {1627#(= main_~i~0 24)} ~k~0 := ~i~0; {1631#(= main_~k~0 24)} is VALID [2022-04-15 13:00:40,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {1631#(= main_~k~0 24)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {1631#(= main_~k~0 24)} is VALID [2022-04-15 13:00:40,253 INFO L272 TraceCheckUtils]: 16: Hoare triple {1631#(= main_~k~0 24)} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {1638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:00:40,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {1638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:00:40,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {1642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1567#false} is VALID [2022-04-15 13:00:40,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-15 13:00:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:40,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:40,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-15 13:00:40,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {1642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1567#false} is VALID [2022-04-15 13:00:40,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {1638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:00:40,645 INFO L272 TraceCheckUtils]: 16: Hoare triple {1658#(= (mod main_~k~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {1638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:00:40,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {1658#(= (mod main_~k~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {1658#(= (mod main_~k~0 2) 0)} is VALID [2022-04-15 13:00:40,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {1665#(= 0 (mod main_~i~0 2))} ~k~0 := ~i~0; {1658#(= (mod main_~k~0 2) 0)} is VALID [2022-04-15 13:00:40,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {1669#(or (< main_~i~0 main_~n~0) (= 0 (mod main_~i~0 2)))} assume !(~i~0 < ~n~0); {1665#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:40,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {1673#(or (< (+ main_~i~0 4) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1669#(or (< main_~i~0 main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:00:40,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {1677#(or (< (+ main_~i~0 8) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1673#(or (< (+ main_~i~0 4) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:00:40,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {1681#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 12) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1677#(or (< (+ main_~i~0 8) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:00:40,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {1685#(or (< (+ main_~i~0 16) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1681#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 12) main_~n~0))} is VALID [2022-04-15 13:00:40,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {1689#(or (< (+ main_~i~0 20) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1685#(or (< (+ main_~i~0 16) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:00:40,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {1665#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1689#(or (< (+ main_~i~0 20) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:00:40,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {1566#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {1665#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:40,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1566#true} is VALID [2022-04-15 13:00:40,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret5 := main(); {1566#true} is VALID [2022-04-15 13:00:40,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #62#return; {1566#true} is VALID [2022-04-15 13:00:40,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-15 13:00:40,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {1566#true} is VALID [2022-04-15 13:00:40,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-15 13:00:40,658 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:40,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659462082] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:40,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:40,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 12] total 28 [2022-04-15 13:00:40,658 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:40,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [92543141] [2022-04-15 13:00:40,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [92543141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:40,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:40,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 13:00:40,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779249392] [2022-04-15 13:00:40,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:40,659 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 20 [2022-04-15 13:00:40,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:40,659 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-15 13:00:40,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:40,677 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 13:00:40,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:40,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 13:00:40,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2022-04-15 13:00:40,678 INFO L87 Difference]: Start difference. First operand 21 states and 21 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-15 13:00:41,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:41,008 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 13:00:41,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 13:00:41,008 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 20 [2022-04-15 13:00:41,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:00:41,009 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-15 13:00:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 29 transitions. [2022-04-15 13:00:41,010 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-15 13:00:41,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 29 transitions. [2022-04-15 13:00:41,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 29 transitions. [2022-04-15 13:00:41,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:41,036 INFO L225 Difference]: With dead ends: 29 [2022-04-15 13:00:41,036 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 13:00:41,037 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=242, Invalid=948, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 13:00:41,038 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:00:41,038 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:00:41,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 13:00:41,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-15 13:00:41,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:00:41,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:41,049 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:41,050 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:41,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:41,050 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 13:00:41,051 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 13:00:41,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:41,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:41,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 13:00:41,051 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 13:00:41,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:41,052 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 13:00:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 13:00:41,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:41,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:41,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:00:41,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:00:41,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-15 13:00:41,053 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-04-15 13:00:41,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:00:41,054 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-15 13:00:41,054 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-15 13:00:41,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-15 13:00:41,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 13:00:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 13:00:41,079 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:41,079 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:00:41,101 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-15 13:00:41,300 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:41,301 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:41,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:41,301 INFO L85 PathProgramCache]: Analyzing trace with hash -496758050, now seen corresponding path program 13 times [2022-04-15 13:00:41,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:41,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1633028384] [2022-04-15 13:00:41,444 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:00:41,444 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:00:41,444 INFO L85 PathProgramCache]: Analyzing trace with hash -496758050, now seen corresponding path program 14 times [2022-04-15 13:00:41,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:41,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997158465] [2022-04-15 13:00:41,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:41,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:41,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:41,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {1889#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {1876#true} is VALID [2022-04-15 13:00:41,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {1876#true} assume true; {1876#true} is VALID [2022-04-15 13:00:41,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1876#true} {1876#true} #62#return; {1876#true} is VALID [2022-04-15 13:00:41,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {1876#true} call ULTIMATE.init(); {1889#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:41,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {1889#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {1876#true} is VALID [2022-04-15 13:00:41,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {1876#true} assume true; {1876#true} is VALID [2022-04-15 13:00:41,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1876#true} {1876#true} #62#return; {1876#true} is VALID [2022-04-15 13:00:41,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {1876#true} call #t~ret5 := main(); {1876#true} is VALID [2022-04-15 13:00:41,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {1876#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1876#true} is VALID [2022-04-15 13:00:41,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {1876#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {1881#(= main_~i~0 0)} is VALID [2022-04-15 13:00:41,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {1881#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1882#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:41,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {1882#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1883#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:41,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {1883#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1884#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:00:41,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {1884#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1885#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:00:41,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {1885#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1886#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:00:41,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {1886#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1887#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:00:41,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {1887#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1888#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (<= 30 main_~j~0))} is VALID [2022-04-15 13:00:41,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {1888#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (<= 30 main_~j~0))} assume !(~i~0 < ~n~0); {1888#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (<= 30 main_~j~0))} is VALID [2022-04-15 13:00:41,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {1888#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (<= 30 main_~j~0))} ~k~0 := ~i~0; {1888#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (<= 30 main_~j~0))} is VALID [2022-04-15 13:00:41,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {1888#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (<= 30 main_~j~0))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {1877#false} is VALID [2022-04-15 13:00:41,611 INFO L272 TraceCheckUtils]: 17: Hoare triple {1877#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {1877#false} is VALID [2022-04-15 13:00:41,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {1877#false} ~cond := #in~cond; {1877#false} is VALID [2022-04-15 13:00:41,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {1877#false} assume 0 == ~cond; {1877#false} is VALID [2022-04-15 13:00:41,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {1877#false} assume !false; {1877#false} is VALID [2022-04-15 13:00:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:41,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:41,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997158465] [2022-04-15 13:00:41,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997158465] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:00:41,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458149779] [2022-04-15 13:00:41,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:00:41,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:41,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:00:41,620 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:00:41,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 13:00:41,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:00:41,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:00:41,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 13:00:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:41,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:00:41,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {1876#true} call ULTIMATE.init(); {1876#true} is VALID [2022-04-15 13:00:41,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {1876#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {1876#true} is VALID [2022-04-15 13:00:41,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {1876#true} assume true; {1876#true} is VALID [2022-04-15 13:00:41,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1876#true} {1876#true} #62#return; {1876#true} is VALID [2022-04-15 13:00:41,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {1876#true} call #t~ret5 := main(); {1876#true} is VALID [2022-04-15 13:00:41,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {1876#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1876#true} is VALID [2022-04-15 13:00:41,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {1876#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {1881#(= main_~i~0 0)} is VALID [2022-04-15 13:00:41,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {1881#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1882#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:41,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {1882#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1883#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:41,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {1883#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1884#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:00:41,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {1884#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1885#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:00:41,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {1885#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1886#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:00:41,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {1886#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1887#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:00:41,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {1887#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1932#(and (<= main_~j~0 30) (<= 30 main_~j~0))} is VALID [2022-04-15 13:00:41,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {1932#(and (<= main_~j~0 30) (<= 30 main_~j~0))} assume !(~i~0 < ~n~0); {1932#(and (<= main_~j~0 30) (<= 30 main_~j~0))} is VALID [2022-04-15 13:00:41,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {1932#(and (<= main_~j~0 30) (<= 30 main_~j~0))} ~k~0 := ~i~0; {1932#(and (<= main_~j~0 30) (<= 30 main_~j~0))} is VALID [2022-04-15 13:00:41,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {1932#(and (<= main_~j~0 30) (<= 30 main_~j~0))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {1877#false} is VALID [2022-04-15 13:00:41,938 INFO L272 TraceCheckUtils]: 17: Hoare triple {1877#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {1877#false} is VALID [2022-04-15 13:00:41,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {1877#false} ~cond := #in~cond; {1877#false} is VALID [2022-04-15 13:00:41,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {1877#false} assume 0 == ~cond; {1877#false} is VALID [2022-04-15 13:00:41,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {1877#false} assume !false; {1877#false} is VALID [2022-04-15 13:00:41,938 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:41,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:42,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {1877#false} assume !false; {1877#false} is VALID [2022-04-15 13:00:42,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {1877#false} assume 0 == ~cond; {1877#false} is VALID [2022-04-15 13:00:42,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {1877#false} ~cond := #in~cond; {1877#false} is VALID [2022-04-15 13:00:42,034 INFO L272 TraceCheckUtils]: 17: Hoare triple {1877#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {1877#false} is VALID [2022-04-15 13:00:42,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {1966#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {1877#false} is VALID [2022-04-15 13:00:42,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {1966#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {1966#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:42,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {1966#(= (mod main_~j~0 2) 0)} assume !(~i~0 < ~n~0); {1966#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:42,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {1976#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1966#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:42,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {1976#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1976#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:42,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {1976#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1976#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:42,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {1976#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1976#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:42,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {1976#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1976#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:42,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {1976#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1976#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:42,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {1976#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {1976#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:42,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {1876#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {1976#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:42,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {1876#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1876#true} is VALID [2022-04-15 13:00:42,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {1876#true} call #t~ret5 := main(); {1876#true} is VALID [2022-04-15 13:00:42,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1876#true} {1876#true} #62#return; {1876#true} is VALID [2022-04-15 13:00:42,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {1876#true} assume true; {1876#true} is VALID [2022-04-15 13:00:42,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {1876#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {1876#true} is VALID [2022-04-15 13:00:42,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {1876#true} call ULTIMATE.init(); {1876#true} is VALID [2022-04-15 13:00:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 13:00:42,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458149779] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:42,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:42,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 4] total 14 [2022-04-15 13:00:42,042 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:42,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1633028384] [2022-04-15 13:00:42,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1633028384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:42,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:42,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 13:00:42,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258149612] [2022-04-15 13:00:42,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:42,043 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 13:00:42,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:42,043 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-15 13:00:42,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:42,062 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 13:00:42,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:42,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 13:00:42,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-15 13:00:42,063 INFO L87 Difference]: Start difference. First operand 22 states and 22 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-15 13:00:42,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:42,452 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 13:00:42,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 13:00:42,452 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 13:00:42,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:00:42,453 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-15 13:00:42,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 30 transitions. [2022-04-15 13:00:42,454 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-15 13:00:42,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 30 transitions. [2022-04-15 13:00:42,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 30 transitions. [2022-04-15 13:00:42,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:42,491 INFO L225 Difference]: With dead ends: 30 [2022-04-15 13:00:42,492 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 13:00:42,492 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2022-04-15 13:00:42,493 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:00:42,494 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 56 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:00:42,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 13:00:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 13:00:42,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:00:42,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:42,508 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:42,508 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:42,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:42,509 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 13:00:42,509 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 13:00:42,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:42,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:42,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 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 23 states. [2022-04-15 13:00:42,509 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 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 23 states. [2022-04-15 13:00:42,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:42,510 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 13:00:42,510 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 13:00:42,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:42,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:42,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:00:42,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:00:42,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-15 13:00:42,512 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2022-04-15 13:00:42,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:00:42,512 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-15 13:00:42,512 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-15 13:00:42,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-15 13:00:42,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:42,537 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 13:00:42,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 13:00:42,537 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:42,537 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:00:42,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 13:00:42,738 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:42,738 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:42,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:42,738 INFO L85 PathProgramCache]: Analyzing trace with hash -282199055, now seen corresponding path program 15 times [2022-04-15 13:00:42,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:42,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [760467025] [2022-04-15 13:00:42,902 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:00:42,902 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:00:42,902 INFO L85 PathProgramCache]: Analyzing trace with hash -282199055, now seen corresponding path program 16 times [2022-04-15 13:00:42,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:42,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026406973] [2022-04-15 13:00:42,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:42,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:43,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:43,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {2200#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {2186#true} is VALID [2022-04-15 13:00:43,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {2186#true} assume true; {2186#true} is VALID [2022-04-15 13:00:43,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2186#true} {2186#true} #62#return; {2186#true} is VALID [2022-04-15 13:00:43,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {2186#true} call ULTIMATE.init(); {2200#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:43,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {2200#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {2186#true} is VALID [2022-04-15 13:00:43,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {2186#true} assume true; {2186#true} is VALID [2022-04-15 13:00:43,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2186#true} {2186#true} #62#return; {2186#true} is VALID [2022-04-15 13:00:43,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {2186#true} call #t~ret5 := main(); {2186#true} is VALID [2022-04-15 13:00:43,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {2186#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2186#true} is VALID [2022-04-15 13:00:43,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {2186#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {2191#(= main_~i~0 0)} is VALID [2022-04-15 13:00:43,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {2191#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2192#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:43,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {2192#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2193#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:43,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {2193#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2194#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:00:43,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {2194#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2195#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:00:43,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {2195#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2196#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:00:43,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {2196#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2197#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:00:43,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {2197#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2198#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:00:43,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {2198#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2199#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:43,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {2199#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {2199#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:43,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {2199#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {2199#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:43,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {2199#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {2187#false} is VALID [2022-04-15 13:00:43,078 INFO L272 TraceCheckUtils]: 18: Hoare triple {2187#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {2187#false} is VALID [2022-04-15 13:00:43,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {2187#false} ~cond := #in~cond; {2187#false} is VALID [2022-04-15 13:00:43,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {2187#false} assume 0 == ~cond; {2187#false} is VALID [2022-04-15 13:00:43,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {2187#false} assume !false; {2187#false} is VALID [2022-04-15 13:00:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:43,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:43,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026406973] [2022-04-15 13:00:43,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026406973] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:00:43,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562802922] [2022-04-15 13:00:43,079 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:00:43,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:43,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:00:43,084 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:00:43,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 13:00:43,120 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:00:43,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:00:43,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 13:00:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:43,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:00:43,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {2186#true} call ULTIMATE.init(); {2186#true} is VALID [2022-04-15 13:00:43,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {2186#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {2186#true} is VALID [2022-04-15 13:00:43,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {2186#true} assume true; {2186#true} is VALID [2022-04-15 13:00:43,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2186#true} {2186#true} #62#return; {2186#true} is VALID [2022-04-15 13:00:43,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {2186#true} call #t~ret5 := main(); {2186#true} is VALID [2022-04-15 13:00:43,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {2186#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2186#true} is VALID [2022-04-15 13:00:43,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {2186#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {2191#(= main_~i~0 0)} is VALID [2022-04-15 13:00:43,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {2191#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2192#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:43,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {2192#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2193#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:43,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {2193#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2194#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:00:43,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {2194#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2195#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:00:43,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {2195#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2196#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:00:43,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {2196#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2197#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:00:43,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {2197#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2198#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:00:43,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {2198#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2246#(and (<= main_~j~0 34) (<= 34 main_~j~0))} is VALID [2022-04-15 13:00:43,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {2246#(and (<= main_~j~0 34) (<= 34 main_~j~0))} assume !(~i~0 < ~n~0); {2246#(and (<= main_~j~0 34) (<= 34 main_~j~0))} is VALID [2022-04-15 13:00:43,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {2246#(and (<= main_~j~0 34) (<= 34 main_~j~0))} ~k~0 := ~i~0; {2246#(and (<= main_~j~0 34) (<= 34 main_~j~0))} is VALID [2022-04-15 13:00:43,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {2246#(and (<= main_~j~0 34) (<= 34 main_~j~0))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {2187#false} is VALID [2022-04-15 13:00:43,388 INFO L272 TraceCheckUtils]: 18: Hoare triple {2187#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {2187#false} is VALID [2022-04-15 13:00:43,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {2187#false} ~cond := #in~cond; {2187#false} is VALID [2022-04-15 13:00:43,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {2187#false} assume 0 == ~cond; {2187#false} is VALID [2022-04-15 13:00:43,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {2187#false} assume !false; {2187#false} is VALID [2022-04-15 13:00:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:43,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:43,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {2187#false} assume !false; {2187#false} is VALID [2022-04-15 13:00:43,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {2187#false} assume 0 == ~cond; {2187#false} is VALID [2022-04-15 13:00:43,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {2187#false} ~cond := #in~cond; {2187#false} is VALID [2022-04-15 13:00:43,578 INFO L272 TraceCheckUtils]: 18: Hoare triple {2187#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {2187#false} is VALID [2022-04-15 13:00:43,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {2199#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {2187#false} is VALID [2022-04-15 13:00:43,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {2199#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {2199#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:43,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {2199#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {2199#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:43,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {2289#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2199#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:43,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {2289#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2289#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:43,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {2289#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2289#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:43,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {2289#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2289#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:43,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {2289#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2289#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:43,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {2289#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2289#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:43,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {2289#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2289#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:43,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {2289#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2289#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:43,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {2186#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {2289#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:43,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {2186#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2186#true} is VALID [2022-04-15 13:00:43,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {2186#true} call #t~ret5 := main(); {2186#true} is VALID [2022-04-15 13:00:43,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2186#true} {2186#true} #62#return; {2186#true} is VALID [2022-04-15 13:00:43,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {2186#true} assume true; {2186#true} is VALID [2022-04-15 13:00:43,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {2186#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {2186#true} is VALID [2022-04-15 13:00:43,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {2186#true} call ULTIMATE.init(); {2186#true} is VALID [2022-04-15 13:00:43,590 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 13:00:43,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562802922] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:43,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:43,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 4] total 14 [2022-04-15 13:00:43,591 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:43,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [760467025] [2022-04-15 13:00:43,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [760467025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:43,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:43,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 13:00:43,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945110967] [2022-04-15 13:00:43,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:43,592 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 22 [2022-04-15 13:00:43,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:43,593 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-15 13:00:43,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:43,612 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 13:00:43,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:43,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 13:00:43,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-15 13:00:43,613 INFO L87 Difference]: Start difference. First operand 23 states and 23 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-15 13:00:44,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:44,041 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 13:00:44,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 13:00:44,042 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 22 [2022-04-15 13:00:44,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:00:44,042 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-15 13:00:44,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2022-04-15 13:00:44,043 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-15 13:00:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2022-04-15 13:00:44,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 31 transitions. [2022-04-15 13:00:44,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:44,082 INFO L225 Difference]: With dead ends: 31 [2022-04-15 13:00:44,083 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 13:00:44,083 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2022-04-15 13:00:44,083 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:00:44,084 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 60 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:00:44,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 13:00:44,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 13:00:44,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:00:44,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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-15 13:00:44,102 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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-15 13:00:44,103 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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-15 13:00:44,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:44,104 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 13:00:44,104 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 13:00:44,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:44,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:44,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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 24 states. [2022-04-15 13:00:44,107 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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 24 states. [2022-04-15 13:00:44,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:44,108 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 13:00:44,108 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 13:00:44,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:44,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:44,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:00:44,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:00:44,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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-15 13:00:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-15 13:00:44,109 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2022-04-15 13:00:44,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:00:44,109 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-15 13:00:44,110 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-15 13:00:44,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-15 13:00:44,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 13:00:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 13:00:44,138 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:44,139 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:00:44,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 13:00:44,359 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,SelfDestructingSolverStorable9 [2022-04-15 13:00:44,360 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:44,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:44,360 INFO L85 PathProgramCache]: Analyzing trace with hash 2074162494, now seen corresponding path program 17 times [2022-04-15 13:00:44,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:44,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [36936361] [2022-04-15 13:00:44,503 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:00:44,503 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:00:44,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2074162494, now seen corresponding path program 18 times [2022-04-15 13:00:44,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:44,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983148352] [2022-04-15 13:00:44,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:44,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:44,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:44,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {2525#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {2510#true} is VALID [2022-04-15 13:00:44,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {2510#true} assume true; {2510#true} is VALID [2022-04-15 13:00:44,668 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2510#true} {2510#true} #62#return; {2510#true} is VALID [2022-04-15 13:00:44,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {2510#true} call ULTIMATE.init(); {2525#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:44,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {2525#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {2510#true} is VALID [2022-04-15 13:00:44,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {2510#true} assume true; {2510#true} is VALID [2022-04-15 13:00:44,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2510#true} {2510#true} #62#return; {2510#true} is VALID [2022-04-15 13:00:44,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {2510#true} call #t~ret5 := main(); {2510#true} is VALID [2022-04-15 13:00:44,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {2510#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2510#true} is VALID [2022-04-15 13:00:44,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {2510#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {2515#(= main_~i~0 0)} is VALID [2022-04-15 13:00:44,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {2515#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2516#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:44,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {2516#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2517#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:44,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {2517#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2518#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:00:44,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {2518#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2519#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:00:44,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {2519#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2520#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:00:44,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {2520#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2521#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:00:44,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {2521#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2522#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:00:44,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {2522#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2523#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:00:44,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {2523#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2524#(and (<= 38 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:00:44,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {2524#(and (<= 38 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(~i~0 < ~n~0); {2524#(and (<= 38 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:00:44,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {2524#(and (<= 38 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} ~k~0 := ~i~0; {2524#(and (<= 38 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:00:44,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {2524#(and (<= 38 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {2511#false} is VALID [2022-04-15 13:00:44,677 INFO L272 TraceCheckUtils]: 19: Hoare triple {2511#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {2511#false} is VALID [2022-04-15 13:00:44,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {2511#false} ~cond := #in~cond; {2511#false} is VALID [2022-04-15 13:00:44,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {2511#false} assume 0 == ~cond; {2511#false} is VALID [2022-04-15 13:00:44,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {2511#false} assume !false; {2511#false} is VALID [2022-04-15 13:00:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:44,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:44,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983148352] [2022-04-15 13:00:44,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983148352] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:00:44,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817764654] [2022-04-15 13:00:44,678 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:00:44,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:44,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:00:44,679 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:00:44,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 13:00:44,719 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 13:00:44,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:00:44,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 13:00:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:44,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:00:45,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {2510#true} call ULTIMATE.init(); {2510#true} is VALID [2022-04-15 13:00:45,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {2510#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {2510#true} is VALID [2022-04-15 13:00:45,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {2510#true} assume true; {2510#true} is VALID [2022-04-15 13:00:45,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2510#true} {2510#true} #62#return; {2510#true} is VALID [2022-04-15 13:00:45,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {2510#true} call #t~ret5 := main(); {2510#true} is VALID [2022-04-15 13:00:45,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {2510#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2510#true} is VALID [2022-04-15 13:00:45,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {2510#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {2515#(= main_~i~0 0)} is VALID [2022-04-15 13:00:45,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {2515#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2516#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:45,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {2516#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2553#(and (< main_~i~0 (+ main_~n~0 4)) (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:45,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {2553#(and (< main_~i~0 (+ main_~n~0 4)) (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2557#(and (<= 12 main_~i~0) (<= main_~i~0 12) (< main_~i~0 (+ main_~n~0 8)))} is VALID [2022-04-15 13:00:45,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {2557#(and (<= 12 main_~i~0) (<= main_~i~0 12) (< main_~i~0 (+ main_~n~0 8)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2561#(and (<= main_~i~0 16) (<= 16 main_~i~0) (< main_~i~0 (+ main_~n~0 12)))} is VALID [2022-04-15 13:00:45,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {2561#(and (<= main_~i~0 16) (<= 16 main_~i~0) (< main_~i~0 (+ main_~n~0 12)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2565#(and (< main_~i~0 (+ main_~n~0 16)) (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:00:45,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {2565#(and (< main_~i~0 (+ main_~n~0 16)) (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2569#(and (<= 24 main_~i~0) (<= main_~i~0 24) (< main_~i~0 (+ main_~n~0 20)))} is VALID [2022-04-15 13:00:45,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {2569#(and (<= 24 main_~i~0) (<= main_~i~0 24) (< main_~i~0 (+ main_~n~0 20)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2573#(and (<= main_~i~0 28) (<= 28 main_~i~0) (< main_~i~0 (+ main_~n~0 24)))} is VALID [2022-04-15 13:00:45,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {2573#(and (<= main_~i~0 28) (<= 28 main_~i~0) (< main_~i~0 (+ main_~n~0 24)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2577#(and (< main_~i~0 (+ main_~n~0 28)) (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:00:45,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {2577#(and (< main_~i~0 (+ main_~n~0 28)) (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2581#(and (= main_~j~0 (+ main_~i~0 2)) (<= 36 main_~i~0) (< main_~i~0 (+ 32 main_~n~0)) (<= main_~i~0 36))} is VALID [2022-04-15 13:00:45,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {2581#(and (= main_~j~0 (+ main_~i~0 2)) (<= 36 main_~i~0) (< main_~i~0 (+ 32 main_~n~0)) (<= main_~i~0 36))} assume !(~i~0 < ~n~0); {2585#(and (<= main_~j~0 38) (<= 38 main_~j~0))} is VALID [2022-04-15 13:00:45,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {2585#(and (<= main_~j~0 38) (<= 38 main_~j~0))} ~k~0 := ~i~0; {2585#(and (<= main_~j~0 38) (<= 38 main_~j~0))} is VALID [2022-04-15 13:00:45,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {2585#(and (<= main_~j~0 38) (<= 38 main_~j~0))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {2511#false} is VALID [2022-04-15 13:00:45,194 INFO L272 TraceCheckUtils]: 19: Hoare triple {2511#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {2511#false} is VALID [2022-04-15 13:00:45,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {2511#false} ~cond := #in~cond; {2511#false} is VALID [2022-04-15 13:00:45,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {2511#false} assume 0 == ~cond; {2511#false} is VALID [2022-04-15 13:00:45,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {2511#false} assume !false; {2511#false} is VALID [2022-04-15 13:00:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:45,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:45,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {2511#false} assume !false; {2511#false} is VALID [2022-04-15 13:00:45,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {2511#false} assume 0 == ~cond; {2511#false} is VALID [2022-04-15 13:00:45,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {2511#false} ~cond := #in~cond; {2511#false} is VALID [2022-04-15 13:00:45,496 INFO L272 TraceCheckUtils]: 19: Hoare triple {2511#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {2511#false} is VALID [2022-04-15 13:00:45,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {2616#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {2511#false} is VALID [2022-04-15 13:00:45,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {2616#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {2616#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:45,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {2623#(or (< main_~i~0 main_~n~0) (= (mod main_~j~0 2) 0))} assume !(~i~0 < ~n~0); {2616#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:45,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {2627#(or (< (+ main_~i~0 4) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2623#(or (< main_~i~0 main_~n~0) (= (mod main_~j~0 2) 0))} is VALID [2022-04-15 13:00:45,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {2631#(or (< (+ main_~i~0 8) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2627#(or (< (+ main_~i~0 4) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:00:45,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {2635#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 12) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2631#(or (< (+ main_~i~0 8) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:00:45,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {2639#(or (< (+ main_~i~0 16) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2635#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 12) main_~n~0))} is VALID [2022-04-15 13:00:45,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {2643#(or (< (+ main_~i~0 20) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2639#(or (< (+ main_~i~0 16) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:00:45,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {2647#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 24) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2643#(or (< (+ main_~i~0 20) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:00:45,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {2651#(or (< (+ main_~i~0 28) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2647#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 24) main_~n~0))} is VALID [2022-04-15 13:00:45,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {2655#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2651#(or (< (+ main_~i~0 28) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:00:45,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {2655#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2655#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:45,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {2510#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {2655#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:45,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {2510#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2510#true} is VALID [2022-04-15 13:00:45,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {2510#true} call #t~ret5 := main(); {2510#true} is VALID [2022-04-15 13:00:45,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2510#true} {2510#true} #62#return; {2510#true} is VALID [2022-04-15 13:00:45,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {2510#true} assume true; {2510#true} is VALID [2022-04-15 13:00:45,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {2510#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {2510#true} is VALID [2022-04-15 13:00:45,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {2510#true} call ULTIMATE.init(); {2510#true} is VALID [2022-04-15 13:00:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 13:00:45,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817764654] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:45,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:45,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 32 [2022-04-15 13:00:45,531 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:45,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [36936361] [2022-04-15 13:00:45,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [36936361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:45,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:45,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 13:00:45,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665916336] [2022-04-15 13:00:45,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:45,532 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 13:00:45,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:45,532 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-15 13:00:45,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:45,549 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 13:00:45,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:45,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 13:00:45,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=750, Unknown=0, NotChecked=0, Total=992 [2022-04-15 13:00:45,550 INFO L87 Difference]: Start difference. First operand 24 states and 24 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-15 13:00:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:46,046 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 13:00:46,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 13:00:46,046 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 13:00:46,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:00:46,046 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-15 13:00:46,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 32 transitions. [2022-04-15 13:00:46,047 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-15 13:00:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 32 transitions. [2022-04-15 13:00:46,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 32 transitions. [2022-04-15 13:00:46,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:46,074 INFO L225 Difference]: With dead ends: 32 [2022-04-15 13:00:46,074 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 13:00:46,075 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=356, Invalid=1366, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 13:00:46,075 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:00:46,075 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 66 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:00:46,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 13:00:46,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 13:00:46,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:00:46,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:46,096 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:46,096 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:46,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:46,097 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 13:00:46,097 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 13:00:46,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:46,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:46,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 13:00:46,098 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 13:00:46,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:46,099 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 13:00:46,099 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 13:00:46,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:46,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:46,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:00:46,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:00:46,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:46,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-15 13:00:46,100 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2022-04-15 13:00:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:00:46,100 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-15 13:00:46,100 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-15 13:00:46,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-15 13:00:46,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 13:00:46,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 13:00:46,127 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:46,127 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:00:46,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 13:00:46,327 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:46,327 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:46,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:46,328 INFO L85 PathProgramCache]: Analyzing trace with hash 2106926481, now seen corresponding path program 19 times [2022-04-15 13:00:46,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:46,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1225606930] [2022-04-15 13:00:46,504 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:00:46,504 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:00:46,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2106926481, now seen corresponding path program 20 times [2022-04-15 13:00:46,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:46,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759603204] [2022-04-15 13:00:46,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:46,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:46,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:46,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {2882#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {2866#true} is VALID [2022-04-15 13:00:46,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {2866#true} assume true; {2866#true} is VALID [2022-04-15 13:00:46,736 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2866#true} {2866#true} #62#return; {2866#true} is VALID [2022-04-15 13:00:46,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {2866#true} call ULTIMATE.init(); {2882#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:46,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {2882#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {2866#true} is VALID [2022-04-15 13:00:46,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {2866#true} assume true; {2866#true} is VALID [2022-04-15 13:00:46,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2866#true} {2866#true} #62#return; {2866#true} is VALID [2022-04-15 13:00:46,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {2866#true} call #t~ret5 := main(); {2866#true} is VALID [2022-04-15 13:00:46,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {2866#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2866#true} is VALID [2022-04-15 13:00:46,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {2866#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {2871#(= main_~i~0 0)} is VALID [2022-04-15 13:00:46,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {2871#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2872#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:46,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {2872#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2873#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:46,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {2873#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2874#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:00:46,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {2874#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2875#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:00:46,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {2875#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2876#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:00:46,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {2876#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2877#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:00:46,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {2877#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2878#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:00:46,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {2878#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2879#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:00:46,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {2879#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2880#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:00:46,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {2880#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2881#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:46,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {2881#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {2881#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:46,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {2881#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {2881#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:46,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {2881#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {2867#false} is VALID [2022-04-15 13:00:46,745 INFO L272 TraceCheckUtils]: 20: Hoare triple {2867#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {2867#false} is VALID [2022-04-15 13:00:46,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {2867#false} ~cond := #in~cond; {2867#false} is VALID [2022-04-15 13:00:46,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {2867#false} assume 0 == ~cond; {2867#false} is VALID [2022-04-15 13:00:46,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {2867#false} assume !false; {2867#false} is VALID [2022-04-15 13:00:46,745 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:46,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:46,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759603204] [2022-04-15 13:00:46,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759603204] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:00:46,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893141498] [2022-04-15 13:00:46,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:00:46,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:46,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:00:46,747 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:00:46,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 13:00:46,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:00:46,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:00:46,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 13:00:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:46,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:00:47,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {2866#true} call ULTIMATE.init(); {2866#true} is VALID [2022-04-15 13:00:47,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {2866#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {2866#true} is VALID [2022-04-15 13:00:47,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {2866#true} assume true; {2866#true} is VALID [2022-04-15 13:00:47,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2866#true} {2866#true} #62#return; {2866#true} is VALID [2022-04-15 13:00:47,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {2866#true} call #t~ret5 := main(); {2866#true} is VALID [2022-04-15 13:00:47,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {2866#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2866#true} is VALID [2022-04-15 13:00:47,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {2866#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {2871#(= main_~i~0 0)} is VALID [2022-04-15 13:00:47,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {2871#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2872#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:47,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {2872#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2873#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:47,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {2873#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2874#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:00:47,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {2874#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2875#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:00:47,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {2875#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2876#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:00:47,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {2876#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2877#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:00:47,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {2877#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2878#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:00:47,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {2878#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2879#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:00:47,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {2879#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2880#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:00:47,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {2880#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2934#(and (<= 42 main_~j~0) (<= main_~j~0 42))} is VALID [2022-04-15 13:00:47,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {2934#(and (<= 42 main_~j~0) (<= main_~j~0 42))} assume !(~i~0 < ~n~0); {2934#(and (<= 42 main_~j~0) (<= main_~j~0 42))} is VALID [2022-04-15 13:00:47,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {2934#(and (<= 42 main_~j~0) (<= main_~j~0 42))} ~k~0 := ~i~0; {2934#(and (<= 42 main_~j~0) (<= main_~j~0 42))} is VALID [2022-04-15 13:00:47,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {2934#(and (<= 42 main_~j~0) (<= main_~j~0 42))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {2867#false} is VALID [2022-04-15 13:00:47,035 INFO L272 TraceCheckUtils]: 20: Hoare triple {2867#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {2867#false} is VALID [2022-04-15 13:00:47,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {2867#false} ~cond := #in~cond; {2867#false} is VALID [2022-04-15 13:00:47,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {2867#false} assume 0 == ~cond; {2867#false} is VALID [2022-04-15 13:00:47,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {2867#false} assume !false; {2867#false} is VALID [2022-04-15 13:00:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:47,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:47,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {2867#false} assume !false; {2867#false} is VALID [2022-04-15 13:00:47,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {2867#false} assume 0 == ~cond; {2867#false} is VALID [2022-04-15 13:00:47,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {2867#false} ~cond := #in~cond; {2867#false} is VALID [2022-04-15 13:00:47,255 INFO L272 TraceCheckUtils]: 20: Hoare triple {2867#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {2867#false} is VALID [2022-04-15 13:00:47,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {2881#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {2867#false} is VALID [2022-04-15 13:00:47,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {2881#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {2881#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:47,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {2881#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {2881#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:47,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {2977#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2881#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:47,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {2977#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2977#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:47,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {2977#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2977#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:47,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {2977#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2977#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:47,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {2977#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2977#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:47,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {2977#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2977#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:47,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {2977#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2977#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:47,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {2977#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2977#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:47,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {2977#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2977#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:47,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {2977#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {2977#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:47,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {2866#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {2977#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:47,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {2866#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2866#true} is VALID [2022-04-15 13:00:47,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {2866#true} call #t~ret5 := main(); {2866#true} is VALID [2022-04-15 13:00:47,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2866#true} {2866#true} #62#return; {2866#true} is VALID [2022-04-15 13:00:47,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {2866#true} assume true; {2866#true} is VALID [2022-04-15 13:00:47,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {2866#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {2866#true} is VALID [2022-04-15 13:00:47,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {2866#true} call ULTIMATE.init(); {2866#true} is VALID [2022-04-15 13:00:47,283 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-15 13:00:47,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893141498] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:47,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:47,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 4] total 16 [2022-04-15 13:00:47,284 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:47,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1225606930] [2022-04-15 13:00:47,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1225606930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:47,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:47,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 13:00:47,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933137207] [2022-04-15 13:00:47,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:47,284 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 13:00:47,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:47,285 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-15 13:00:47,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:47,305 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 13:00:47,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:47,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 13:00:47,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-04-15 13:00:47,306 INFO L87 Difference]: Start difference. First operand 25 states and 25 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-15 13:00:47,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:47,882 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 13:00:47,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 13:00:47,882 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 13:00:47,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:00:47,883 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-15 13:00:47,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2022-04-15 13:00:47,888 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-15 13:00:47,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2022-04-15 13:00:47,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 33 transitions. [2022-04-15 13:00:47,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:47,928 INFO L225 Difference]: With dead ends: 33 [2022-04-15 13:00:47,928 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 13:00:47,928 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2022-04-15 13:00:47,929 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:00:47,929 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 70 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:00:47,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 13:00:47,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 13:00:47,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:00:47,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:47,948 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:47,948 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:47,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:47,949 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 13:00:47,949 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 13:00:47,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:47,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:47,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 13:00:47,949 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 13:00:47,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:47,950 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 13:00:47,950 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 13:00:47,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:47,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:47,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:00:47,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:00:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-15 13:00:47,952 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2022-04-15 13:00:47,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:00:47,952 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-15 13:00:47,952 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-15 13:00:47,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-15 13:00:47,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:47,983 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 13:00:47,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 13:00:47,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:47,984 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:00:48,007 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-15 13:00:48,184 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,SelfDestructingSolverStorable11 [2022-04-15 13:00:48,185 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:48,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:48,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1172357218, now seen corresponding path program 21 times [2022-04-15 13:00:48,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:48,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [28301846] [2022-04-15 13:00:48,335 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:00:48,336 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:00:48,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1172357218, now seen corresponding path program 22 times [2022-04-15 13:00:48,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:48,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414760923] [2022-04-15 13:00:48,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:48,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:48,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:48,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {3237#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {3220#true} is VALID [2022-04-15 13:00:48,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {3220#true} assume true; {3220#true} is VALID [2022-04-15 13:00:48,547 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3220#true} {3220#true} #62#return; {3220#true} is VALID [2022-04-15 13:00:48,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {3220#true} call ULTIMATE.init(); {3237#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:48,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {3237#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {3220#true} is VALID [2022-04-15 13:00:48,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {3220#true} assume true; {3220#true} is VALID [2022-04-15 13:00:48,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3220#true} {3220#true} #62#return; {3220#true} is VALID [2022-04-15 13:00:48,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {3220#true} call #t~ret5 := main(); {3220#true} is VALID [2022-04-15 13:00:48,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {3220#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3220#true} is VALID [2022-04-15 13:00:48,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {3220#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {3225#(= main_~i~0 0)} is VALID [2022-04-15 13:00:48,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {3225#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3226#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:48,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {3226#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3227#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:48,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {3227#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3228#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:00:48,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {3228#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3229#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:00:48,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {3229#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3230#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:00:48,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {3230#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3231#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:00:48,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {3231#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3232#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:00:48,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {3232#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3233#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:00:48,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {3233#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3234#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:00:48,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {3234#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3235#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:00:48,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {3235#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3236#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:48,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {3236#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {3236#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:48,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {3236#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {3236#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:48,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {3236#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {3221#false} is VALID [2022-04-15 13:00:48,560 INFO L272 TraceCheckUtils]: 21: Hoare triple {3221#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {3221#false} is VALID [2022-04-15 13:00:48,560 INFO L290 TraceCheckUtils]: 22: Hoare triple {3221#false} ~cond := #in~cond; {3221#false} is VALID [2022-04-15 13:00:48,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {3221#false} assume 0 == ~cond; {3221#false} is VALID [2022-04-15 13:00:48,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {3221#false} assume !false; {3221#false} is VALID [2022-04-15 13:00:48,561 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:48,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:48,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414760923] [2022-04-15 13:00:48,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414760923] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:00:48,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905200314] [2022-04-15 13:00:48,561 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:00:48,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:48,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:00:48,565 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:00:48,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 13:00:48,598 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:00:48,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:00:48,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 13:00:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:48,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:00:48,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {3220#true} call ULTIMATE.init(); {3220#true} is VALID [2022-04-15 13:00:48,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {3220#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {3220#true} is VALID [2022-04-15 13:00:48,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {3220#true} assume true; {3220#true} is VALID [2022-04-15 13:00:48,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3220#true} {3220#true} #62#return; {3220#true} is VALID [2022-04-15 13:00:48,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {3220#true} call #t~ret5 := main(); {3220#true} is VALID [2022-04-15 13:00:48,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {3220#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3220#true} is VALID [2022-04-15 13:00:48,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {3220#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {3225#(= main_~i~0 0)} is VALID [2022-04-15 13:00:48,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {3225#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3226#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:48,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {3226#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3227#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:48,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {3227#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3228#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:00:48,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {3228#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3229#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:00:48,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {3229#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3230#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:00:48,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {3230#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3231#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:00:48,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {3231#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3232#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:00:48,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {3232#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3233#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:00:48,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {3233#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3234#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:00:48,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {3234#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3235#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:00:48,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {3235#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3292#(and (<= 46 main_~j~0) (<= main_~j~0 46))} is VALID [2022-04-15 13:00:48,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {3292#(and (<= 46 main_~j~0) (<= main_~j~0 46))} assume !(~i~0 < ~n~0); {3292#(and (<= 46 main_~j~0) (<= main_~j~0 46))} is VALID [2022-04-15 13:00:48,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {3292#(and (<= 46 main_~j~0) (<= main_~j~0 46))} ~k~0 := ~i~0; {3292#(and (<= 46 main_~j~0) (<= main_~j~0 46))} is VALID [2022-04-15 13:00:48,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {3292#(and (<= 46 main_~j~0) (<= main_~j~0 46))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {3221#false} is VALID [2022-04-15 13:00:48,897 INFO L272 TraceCheckUtils]: 21: Hoare triple {3221#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {3221#false} is VALID [2022-04-15 13:00:48,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {3221#false} ~cond := #in~cond; {3221#false} is VALID [2022-04-15 13:00:48,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {3221#false} assume 0 == ~cond; {3221#false} is VALID [2022-04-15 13:00:48,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {3221#false} assume !false; {3221#false} is VALID [2022-04-15 13:00:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:48,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:49,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {3221#false} assume !false; {3221#false} is VALID [2022-04-15 13:00:49,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {3221#false} assume 0 == ~cond; {3221#false} is VALID [2022-04-15 13:00:49,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {3221#false} ~cond := #in~cond; {3221#false} is VALID [2022-04-15 13:00:49,168 INFO L272 TraceCheckUtils]: 21: Hoare triple {3221#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {3221#false} is VALID [2022-04-15 13:00:49,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {3236#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {3221#false} is VALID [2022-04-15 13:00:49,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {3236#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {3236#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:49,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {3236#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {3236#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:49,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3236#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:49,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:49,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:49,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:49,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:49,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:49,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:49,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:49,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:49,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:49,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:49,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {3220#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {3335#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:00:49,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {3220#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3220#true} is VALID [2022-04-15 13:00:49,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {3220#true} call #t~ret5 := main(); {3220#true} is VALID [2022-04-15 13:00:49,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3220#true} {3220#true} #62#return; {3220#true} is VALID [2022-04-15 13:00:49,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {3220#true} assume true; {3220#true} is VALID [2022-04-15 13:00:49,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {3220#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {3220#true} is VALID [2022-04-15 13:00:49,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {3220#true} call ULTIMATE.init(); {3220#true} is VALID [2022-04-15 13:00:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-15 13:00:49,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905200314] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:49,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:49,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 4] total 17 [2022-04-15 13:00:49,181 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:49,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [28301846] [2022-04-15 13:00:49,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [28301846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:49,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:49,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 13:00:49,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362707361] [2022-04-15 13:00:49,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:49,182 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 25 [2022-04-15 13:00:49,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:49,182 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-15 13:00:49,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:49,199 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 13:00:49,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:49,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 13:00:49,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-04-15 13:00:49,200 INFO L87 Difference]: Start difference. First operand 26 states and 26 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-15 13:00:49,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:49,865 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 13:00:49,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 13:00:49,865 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 25 [2022-04-15 13:00:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:00:49,866 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-15 13:00:49,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 34 transitions. [2022-04-15 13:00:49,867 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-15 13:00:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 34 transitions. [2022-04-15 13:00:49,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 34 transitions. [2022-04-15 13:00:49,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:49,902 INFO L225 Difference]: With dead ends: 34 [2022-04-15 13:00:49,903 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 13:00:49,903 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 12 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2022-04-15 13:00:49,904 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:00:49,904 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 75 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:00:49,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 13:00:49,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 13:00:49,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:00:49,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:49,934 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:49,934 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:49,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:49,935 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 13:00:49,935 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 13:00:49,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:49,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:49,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 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 27 states. [2022-04-15 13:00:49,935 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 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 27 states. [2022-04-15 13:00:49,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:49,936 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 13:00:49,936 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 13:00:49,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:49,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:49,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:00:49,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:00:49,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:49,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-15 13:00:49,937 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2022-04-15 13:00:49,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:00:49,937 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-15 13:00:49,938 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-15 13:00:49,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-15 13:00:49,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:49,967 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 13:00:49,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 13:00:49,968 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:49,968 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:00:49,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 13:00:50,171 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,SelfDestructingSolverStorable12 [2022-04-15 13:00:50,172 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:50,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:50,172 INFO L85 PathProgramCache]: Analyzing trace with hash 249063217, now seen corresponding path program 23 times [2022-04-15 13:00:50,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:50,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [444710763] [2022-04-15 13:00:50,321 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:00:50,321 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:00:50,321 INFO L85 PathProgramCache]: Analyzing trace with hash 249063217, now seen corresponding path program 24 times [2022-04-15 13:00:50,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:50,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055433305] [2022-04-15 13:00:50,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:50,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:50,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:50,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {3607#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {3589#true} is VALID [2022-04-15 13:00:50,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {3589#true} assume true; {3589#true} is VALID [2022-04-15 13:00:50,555 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3589#true} {3589#true} #62#return; {3589#true} is VALID [2022-04-15 13:00:50,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {3589#true} call ULTIMATE.init(); {3607#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:50,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {3607#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {3589#true} is VALID [2022-04-15 13:00:50,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {3589#true} assume true; {3589#true} is VALID [2022-04-15 13:00:50,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3589#true} {3589#true} #62#return; {3589#true} is VALID [2022-04-15 13:00:50,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {3589#true} call #t~ret5 := main(); {3589#true} is VALID [2022-04-15 13:00:50,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {3589#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3589#true} is VALID [2022-04-15 13:00:50,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {3589#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {3594#(= main_~i~0 0)} is VALID [2022-04-15 13:00:50,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {3594#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3595#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:50,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {3595#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3596#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:50,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {3596#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3597#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:00:50,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {3597#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3598#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:00:50,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {3598#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3599#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:00:50,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {3599#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3600#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:00:50,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {3600#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3601#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:00:50,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {3601#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3602#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:00:50,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {3602#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3603#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:00:50,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {3603#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3604#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:00:50,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {3604#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3605#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:00:50,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {3605#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3606#(and (<= 50 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:00:50,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {3606#(and (<= 50 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(~i~0 < ~n~0); {3606#(and (<= 50 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:00:50,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {3606#(and (<= 50 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} ~k~0 := ~i~0; {3606#(and (<= 50 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:00:50,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {3606#(and (<= 50 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {3590#false} is VALID [2022-04-15 13:00:50,569 INFO L272 TraceCheckUtils]: 22: Hoare triple {3590#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {3590#false} is VALID [2022-04-15 13:00:50,569 INFO L290 TraceCheckUtils]: 23: Hoare triple {3590#false} ~cond := #in~cond; {3590#false} is VALID [2022-04-15 13:00:50,569 INFO L290 TraceCheckUtils]: 24: Hoare triple {3590#false} assume 0 == ~cond; {3590#false} is VALID [2022-04-15 13:00:50,569 INFO L290 TraceCheckUtils]: 25: Hoare triple {3590#false} assume !false; {3590#false} is VALID [2022-04-15 13:00:50,569 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:50,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:50,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055433305] [2022-04-15 13:00:50,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055433305] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:00:50,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027925076] [2022-04-15 13:00:50,570 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:00:50,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:50,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:00:50,571 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:00:50,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 13:00:50,615 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 13:00:50,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:00:50,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 13:00:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:50,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:00:51,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {3589#true} call ULTIMATE.init(); {3589#true} is VALID [2022-04-15 13:00:51,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {3589#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {3589#true} is VALID [2022-04-15 13:00:51,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {3589#true} assume true; {3589#true} is VALID [2022-04-15 13:00:51,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3589#true} {3589#true} #62#return; {3589#true} is VALID [2022-04-15 13:00:51,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {3589#true} call #t~ret5 := main(); {3589#true} is VALID [2022-04-15 13:00:51,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {3589#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3589#true} is VALID [2022-04-15 13:00:51,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {3589#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {3594#(= main_~i~0 0)} is VALID [2022-04-15 13:00:51,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {3594#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3595#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:51,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {3595#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3635#(and (< main_~i~0 (+ main_~n~0 4)) (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:51,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {3635#(and (< main_~i~0 (+ main_~n~0 4)) (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3639#(and (<= 12 main_~i~0) (<= main_~i~0 12) (< main_~i~0 (+ main_~n~0 8)))} is VALID [2022-04-15 13:00:51,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {3639#(and (<= 12 main_~i~0) (<= main_~i~0 12) (< main_~i~0 (+ main_~n~0 8)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3643#(and (<= main_~i~0 16) (<= 16 main_~i~0) (< main_~i~0 (+ main_~n~0 12)))} is VALID [2022-04-15 13:00:51,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {3643#(and (<= main_~i~0 16) (<= 16 main_~i~0) (< main_~i~0 (+ main_~n~0 12)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3647#(and (< main_~i~0 (+ main_~n~0 16)) (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:00:51,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {3647#(and (< main_~i~0 (+ main_~n~0 16)) (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3651#(and (<= 24 main_~i~0) (<= main_~i~0 24) (< main_~i~0 (+ main_~n~0 20)))} is VALID [2022-04-15 13:00:51,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {3651#(and (<= 24 main_~i~0) (<= main_~i~0 24) (< main_~i~0 (+ main_~n~0 20)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3655#(and (<= main_~i~0 28) (<= 28 main_~i~0) (< main_~i~0 (+ main_~n~0 24)))} is VALID [2022-04-15 13:00:51,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {3655#(and (<= main_~i~0 28) (<= 28 main_~i~0) (< main_~i~0 (+ main_~n~0 24)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3659#(and (< main_~i~0 (+ main_~n~0 28)) (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:00:51,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {3659#(and (< main_~i~0 (+ main_~n~0 28)) (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3663#(and (<= 36 main_~i~0) (< main_~i~0 (+ 32 main_~n~0)) (<= main_~i~0 36))} is VALID [2022-04-15 13:00:51,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {3663#(and (<= 36 main_~i~0) (< main_~i~0 (+ 32 main_~n~0)) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3667#(and (< main_~i~0 (+ main_~n~0 36)) (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:00:51,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {3667#(and (< main_~i~0 (+ main_~n~0 36)) (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3671#(and (<= 44 main_~i~0) (< main_~i~0 (+ 40 main_~n~0)) (<= main_~i~0 44))} is VALID [2022-04-15 13:00:51,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {3671#(and (<= 44 main_~i~0) (< main_~i~0 (+ 40 main_~n~0)) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3675#(and (= main_~j~0 (+ main_~i~0 2)) (<= 48 main_~i~0) (< main_~i~0 (+ 44 main_~n~0)) (<= main_~i~0 48))} is VALID [2022-04-15 13:00:51,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {3675#(and (= main_~j~0 (+ main_~i~0 2)) (<= 48 main_~i~0) (< main_~i~0 (+ 44 main_~n~0)) (<= main_~i~0 48))} assume !(~i~0 < ~n~0); {3679#(and (<= 50 main_~j~0) (<= main_~j~0 50))} is VALID [2022-04-15 13:00:51,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {3679#(and (<= 50 main_~j~0) (<= main_~j~0 50))} ~k~0 := ~i~0; {3679#(and (<= 50 main_~j~0) (<= main_~j~0 50))} is VALID [2022-04-15 13:00:51,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {3679#(and (<= 50 main_~j~0) (<= main_~j~0 50))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {3590#false} is VALID [2022-04-15 13:00:51,276 INFO L272 TraceCheckUtils]: 22: Hoare triple {3590#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {3590#false} is VALID [2022-04-15 13:00:51,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {3590#false} ~cond := #in~cond; {3590#false} is VALID [2022-04-15 13:00:51,276 INFO L290 TraceCheckUtils]: 24: Hoare triple {3590#false} assume 0 == ~cond; {3590#false} is VALID [2022-04-15 13:00:51,276 INFO L290 TraceCheckUtils]: 25: Hoare triple {3590#false} assume !false; {3590#false} is VALID [2022-04-15 13:00:51,276 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:51,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:51,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {3590#false} assume !false; {3590#false} is VALID [2022-04-15 13:00:51,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {3590#false} assume 0 == ~cond; {3590#false} is VALID [2022-04-15 13:00:51,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {3590#false} ~cond := #in~cond; {3590#false} is VALID [2022-04-15 13:00:51,757 INFO L272 TraceCheckUtils]: 22: Hoare triple {3590#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {3590#false} is VALID [2022-04-15 13:00:51,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {3710#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {3590#false} is VALID [2022-04-15 13:00:51,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {3710#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {3710#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:51,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {3717#(or (< main_~i~0 main_~n~0) (= (mod main_~j~0 2) 0))} assume !(~i~0 < ~n~0); {3710#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:51,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {3721#(or (< (+ main_~i~0 4) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3717#(or (< main_~i~0 main_~n~0) (= (mod main_~j~0 2) 0))} is VALID [2022-04-15 13:00:51,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {3725#(or (< (+ main_~i~0 8) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3721#(or (< (+ main_~i~0 4) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:00:51,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {3729#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 12) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3725#(or (< (+ main_~i~0 8) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:00:51,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {3733#(or (< (+ main_~i~0 16) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3729#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 12) main_~n~0))} is VALID [2022-04-15 13:00:51,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {3737#(or (< (+ main_~i~0 20) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3733#(or (< (+ main_~i~0 16) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:00:51,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {3741#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 24) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3737#(or (< (+ main_~i~0 20) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:00:51,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {3745#(or (< (+ main_~i~0 28) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3741#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 24) main_~n~0))} is VALID [2022-04-15 13:00:51,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {3749#(or (< (+ 32 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3745#(or (< (+ main_~i~0 28) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:00:51,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {3753#(or (< (+ main_~i~0 36) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3749#(or (< (+ 32 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:00:51,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {3757#(or (= 0 (mod main_~i~0 2)) (< (+ 40 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3753#(or (< (+ main_~i~0 36) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:00:51,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {3761#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3757#(or (= 0 (mod main_~i~0 2)) (< (+ 40 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:00:51,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {3761#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {3761#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:51,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {3589#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {3761#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:51,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {3589#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3589#true} is VALID [2022-04-15 13:00:51,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {3589#true} call #t~ret5 := main(); {3589#true} is VALID [2022-04-15 13:00:51,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3589#true} {3589#true} #62#return; {3589#true} is VALID [2022-04-15 13:00:51,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {3589#true} assume true; {3589#true} is VALID [2022-04-15 13:00:51,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {3589#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {3589#true} is VALID [2022-04-15 13:00:51,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {3589#true} call ULTIMATE.init(); {3589#true} is VALID [2022-04-15 13:00:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 13:00:51,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027925076] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:51,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:51,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 41 [2022-04-15 13:00:51,771 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:51,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [444710763] [2022-04-15 13:00:51,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [444710763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:51,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:51,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 13:00:51,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316049084] [2022-04-15 13:00:51,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:51,771 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 13:00:51,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:51,772 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-15 13:00:51,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:51,790 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 13:00:51,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:51,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 13:00:51,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 13:00:51,791 INFO L87 Difference]: Start difference. First operand 27 states and 27 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-15 13:00:52,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:52,507 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 13:00:52,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 13:00:52,507 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 13:00:52,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:00:52,507 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-15 13:00:52,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 35 transitions. [2022-04-15 13:00:52,508 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-15 13:00:52,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 35 transitions. [2022-04-15 13:00:52,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 35 transitions. [2022-04-15 13:00:52,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:52,560 INFO L225 Difference]: With dead ends: 35 [2022-04-15 13:00:52,560 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 13:00:52,561 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=593, Invalid=2269, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 13:00:52,561 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:00:52,561 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 81 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:00:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 13:00:52,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-15 13:00:52,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:00:52,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:52,580 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:52,581 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:52,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:52,581 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 13:00:52,581 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 13:00:52,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:52,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:52,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 13:00:52,582 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 13:00:52,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:52,583 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 13:00:52,583 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 13:00:52,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:52,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:52,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:00:52,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:00:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-15 13:00:52,584 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2022-04-15 13:00:52,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:00:52,584 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-15 13:00:52,584 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-15 13:00:52,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-15 13:00:52,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 13:00:52,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 13:00:52,620 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:52,620 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:00:52,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 13:00:52,823 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,SelfDestructingSolverStorable13 [2022-04-15 13:00:52,823 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:52,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:52,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1363423742, now seen corresponding path program 25 times [2022-04-15 13:00:52,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:52,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1825735363] [2022-04-15 13:00:52,987 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:00:52,987 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:00:52,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1363423742, now seen corresponding path program 26 times [2022-04-15 13:00:52,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:52,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066787181] [2022-04-15 13:00:52,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:52,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:53,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:53,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {4015#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {3996#true} is VALID [2022-04-15 13:00:53,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {3996#true} assume true; {3996#true} is VALID [2022-04-15 13:00:53,237 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3996#true} {3996#true} #62#return; {3996#true} is VALID [2022-04-15 13:00:53,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {3996#true} call ULTIMATE.init(); {4015#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:53,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {4015#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {3996#true} is VALID [2022-04-15 13:00:53,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {3996#true} assume true; {3996#true} is VALID [2022-04-15 13:00:53,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3996#true} {3996#true} #62#return; {3996#true} is VALID [2022-04-15 13:00:53,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {3996#true} call #t~ret5 := main(); {3996#true} is VALID [2022-04-15 13:00:53,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {3996#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3996#true} is VALID [2022-04-15 13:00:53,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {3996#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {4001#(= main_~i~0 0)} is VALID [2022-04-15 13:00:53,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {4001#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4002#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:53,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {4002#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4003#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:53,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {4003#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4004#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:00:53,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {4004#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4005#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:00:53,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {4005#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4006#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:00:53,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {4006#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4007#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:00:53,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {4007#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4008#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:00:53,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {4008#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4009#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:00:53,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {4009#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4010#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:00:53,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {4010#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4011#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:00:53,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {4011#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4012#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:00:53,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {4012#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4013#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:00:53,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {4013#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4014#(and (<= 54 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:00:53,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {4014#(and (<= 54 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(~i~0 < ~n~0); {4014#(and (<= 54 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:00:53,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {4014#(and (<= 54 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} ~k~0 := ~i~0; {4014#(and (<= 54 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:00:53,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {4014#(and (<= 54 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {3997#false} is VALID [2022-04-15 13:00:53,252 INFO L272 TraceCheckUtils]: 23: Hoare triple {3997#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {3997#false} is VALID [2022-04-15 13:00:53,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {3997#false} ~cond := #in~cond; {3997#false} is VALID [2022-04-15 13:00:53,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {3997#false} assume 0 == ~cond; {3997#false} is VALID [2022-04-15 13:00:53,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {3997#false} assume !false; {3997#false} is VALID [2022-04-15 13:00:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:53,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:53,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066787181] [2022-04-15 13:00:53,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066787181] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:00:53,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037724337] [2022-04-15 13:00:53,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:00:53,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:53,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:00:53,256 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:00:53,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 13:00:53,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:00:53,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:00:53,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 13:00:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:53,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:00:53,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {3996#true} call ULTIMATE.init(); {3996#true} is VALID [2022-04-15 13:00:53,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {3996#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {3996#true} is VALID [2022-04-15 13:00:53,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {3996#true} assume true; {3996#true} is VALID [2022-04-15 13:00:53,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3996#true} {3996#true} #62#return; {3996#true} is VALID [2022-04-15 13:00:53,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {3996#true} call #t~ret5 := main(); {3996#true} is VALID [2022-04-15 13:00:53,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {3996#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3996#true} is VALID [2022-04-15 13:00:53,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {3996#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {4001#(= main_~i~0 0)} is VALID [2022-04-15 13:00:53,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {4001#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4002#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:53,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {4002#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4003#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:53,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {4003#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4004#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:00:53,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {4004#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4005#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:00:53,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {4005#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4006#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:00:53,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {4006#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4007#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:00:53,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {4007#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4008#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:00:53,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {4008#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4009#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:00:53,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {4009#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4010#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:00:53,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {4010#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4011#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:00:53,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {4011#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4012#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:00:53,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {4012#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4013#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:00:53,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {4013#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4076#(and (<= 54 main_~j~0) (<= main_~j~0 54))} is VALID [2022-04-15 13:00:53,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {4076#(and (<= 54 main_~j~0) (<= main_~j~0 54))} assume !(~i~0 < ~n~0); {4076#(and (<= 54 main_~j~0) (<= main_~j~0 54))} is VALID [2022-04-15 13:00:53,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {4076#(and (<= 54 main_~j~0) (<= main_~j~0 54))} ~k~0 := ~i~0; {4076#(and (<= 54 main_~j~0) (<= main_~j~0 54))} is VALID [2022-04-15 13:00:53,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {4076#(and (<= 54 main_~j~0) (<= main_~j~0 54))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {3997#false} is VALID [2022-04-15 13:00:53,645 INFO L272 TraceCheckUtils]: 23: Hoare triple {3997#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {3997#false} is VALID [2022-04-15 13:00:53,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {3997#false} ~cond := #in~cond; {3997#false} is VALID [2022-04-15 13:00:53,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {3997#false} assume 0 == ~cond; {3997#false} is VALID [2022-04-15 13:00:53,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {3997#false} assume !false; {3997#false} is VALID [2022-04-15 13:00:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:53,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:53,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {3997#false} assume !false; {3997#false} is VALID [2022-04-15 13:00:53,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {3997#false} assume 0 == ~cond; {3997#false} is VALID [2022-04-15 13:00:53,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {3997#false} ~cond := #in~cond; {3997#false} is VALID [2022-04-15 13:00:53,769 INFO L272 TraceCheckUtils]: 23: Hoare triple {3997#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {3997#false} is VALID [2022-04-15 13:00:53,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {4110#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {3997#false} is VALID [2022-04-15 13:00:53,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {4110#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {4110#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:53,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {4110#(= (mod main_~j~0 2) 0)} assume !(~i~0 < ~n~0); {4110#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:53,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {4120#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4110#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:53,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {4120#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4120#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:53,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {4120#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4120#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:53,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {4120#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4120#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:53,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {4120#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4120#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:53,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {4120#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4120#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:53,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {4120#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4120#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:53,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {4120#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4120#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:53,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {4120#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4120#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:53,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {4120#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4120#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:53,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {4120#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4120#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:53,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {4120#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4120#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:53,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {4120#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4120#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:53,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {3996#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {4120#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:53,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {3996#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3996#true} is VALID [2022-04-15 13:00:53,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {3996#true} call #t~ret5 := main(); {3996#true} is VALID [2022-04-15 13:00:53,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3996#true} {3996#true} #62#return; {3996#true} is VALID [2022-04-15 13:00:53,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {3996#true} assume true; {3996#true} is VALID [2022-04-15 13:00:53,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {3996#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {3996#true} is VALID [2022-04-15 13:00:53,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {3996#true} call ULTIMATE.init(); {3996#true} is VALID [2022-04-15 13:00:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-15 13:00:53,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037724337] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:53,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:53,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 4] total 20 [2022-04-15 13:00:53,784 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:53,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1825735363] [2022-04-15 13:00:53,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1825735363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:53,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:53,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 13:00:53,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164034398] [2022-04-15 13:00:53,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:53,785 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 13:00:53,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:53,785 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-15 13:00:53,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:53,802 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 13:00:53,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:53,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 13:00:53,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-04-15 13:00:53,803 INFO L87 Difference]: Start difference. First operand 28 states and 28 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-15 13:00:54,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:54,621 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 13:00:54,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 13:00:54,621 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 13:00:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:00:54,622 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-15 13:00:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 36 transitions. [2022-04-15 13:00:54,624 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-15 13:00:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 36 transitions. [2022-04-15 13:00:54,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 36 transitions. [2022-04-15 13:00:54,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:54,657 INFO L225 Difference]: With dead ends: 36 [2022-04-15 13:00:54,657 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 13:00:54,657 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 13:00:54,658 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:00:54,658 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 86 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 13:00:54,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 13:00:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 13:00:54,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:00:54,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:54,677 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:54,677 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:54,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:54,678 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 13:00:54,678 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 13:00:54,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:54,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:54,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 13:00:54,678 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 13:00:54,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:54,679 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 13:00:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 13:00:54,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:54,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:54,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:00:54,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:00:54,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:54,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-15 13:00:54,680 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2022-04-15 13:00:54,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:00:54,680 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-15 13:00:54,680 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-15 13:00:54,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-15 13:00:54,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 13:00:54,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 13:00:54,712 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:54,712 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:00:54,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 13:00:54,915 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 13:00:54,915 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:54,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:54,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1548861649, now seen corresponding path program 27 times [2022-04-15 13:00:54,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:54,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [622836680] [2022-04-15 13:00:55,090 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:00:55,090 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:00:55,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1548861649, now seen corresponding path program 28 times [2022-04-15 13:00:55,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:55,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668485747] [2022-04-15 13:00:55,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:55,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:55,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:55,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {4416#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {4396#true} is VALID [2022-04-15 13:00:55,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {4396#true} assume true; {4396#true} is VALID [2022-04-15 13:00:55,373 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4396#true} {4396#true} #62#return; {4396#true} is VALID [2022-04-15 13:00:55,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {4396#true} call ULTIMATE.init(); {4416#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:55,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {4416#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {4396#true} is VALID [2022-04-15 13:00:55,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {4396#true} assume true; {4396#true} is VALID [2022-04-15 13:00:55,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4396#true} {4396#true} #62#return; {4396#true} is VALID [2022-04-15 13:00:55,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {4396#true} call #t~ret5 := main(); {4396#true} is VALID [2022-04-15 13:00:55,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {4396#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4396#true} is VALID [2022-04-15 13:00:55,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {4396#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {4401#(= main_~i~0 0)} is VALID [2022-04-15 13:00:55,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {4401#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4402#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:55,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {4402#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4403#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:55,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {4403#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4404#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:00:55,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {4404#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4405#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:00:55,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {4405#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4406#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:00:55,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {4406#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4407#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:00:55,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {4407#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4408#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:00:55,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {4408#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4409#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:00:55,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {4409#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4410#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:00:55,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {4410#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4411#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:00:55,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {4411#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4412#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:00:55,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {4412#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4413#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:00:55,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {4413#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4414#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:00:55,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {4414#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4415#(and (<= 58 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:00:55,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {4415#(and (<= 58 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(~i~0 < ~n~0); {4415#(and (<= 58 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:00:55,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {4415#(and (<= 58 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} ~k~0 := ~i~0; {4415#(and (<= 58 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:00:55,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {4415#(and (<= 58 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {4397#false} is VALID [2022-04-15 13:00:55,388 INFO L272 TraceCheckUtils]: 24: Hoare triple {4397#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {4397#false} is VALID [2022-04-15 13:00:55,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {4397#false} ~cond := #in~cond; {4397#false} is VALID [2022-04-15 13:00:55,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {4397#false} assume 0 == ~cond; {4397#false} is VALID [2022-04-15 13:00:55,388 INFO L290 TraceCheckUtils]: 27: Hoare triple {4397#false} assume !false; {4397#false} is VALID [2022-04-15 13:00:55,388 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:55,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:55,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668485747] [2022-04-15 13:00:55,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668485747] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:00:55,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671461563] [2022-04-15 13:00:55,388 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:00:55,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:55,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:00:55,389 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:00:55,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 13:00:55,426 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:00:55,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:00:55,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 13:00:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:55,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:00:55,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {4396#true} call ULTIMATE.init(); {4396#true} is VALID [2022-04-15 13:00:55,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {4396#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {4396#true} is VALID [2022-04-15 13:00:55,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {4396#true} assume true; {4396#true} is VALID [2022-04-15 13:00:55,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4396#true} {4396#true} #62#return; {4396#true} is VALID [2022-04-15 13:00:55,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {4396#true} call #t~ret5 := main(); {4396#true} is VALID [2022-04-15 13:00:55,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {4396#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4396#true} is VALID [2022-04-15 13:00:55,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {4396#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {4401#(= main_~i~0 0)} is VALID [2022-04-15 13:00:55,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {4401#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4402#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:55,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {4402#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4403#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:55,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {4403#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4404#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:00:55,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {4404#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4405#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:00:55,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {4405#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4406#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:00:55,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {4406#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4407#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:00:55,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {4407#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4408#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:00:55,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {4408#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4409#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:00:55,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {4409#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4410#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:00:55,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {4410#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4411#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:00:55,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {4411#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4412#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:00:55,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {4412#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4413#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:00:55,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {4413#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4414#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:00:55,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {4414#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4480#(and (<= 58 main_~j~0) (<= main_~j~0 58))} is VALID [2022-04-15 13:00:55,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {4480#(and (<= 58 main_~j~0) (<= main_~j~0 58))} assume !(~i~0 < ~n~0); {4480#(and (<= 58 main_~j~0) (<= main_~j~0 58))} is VALID [2022-04-15 13:00:55,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {4480#(and (<= 58 main_~j~0) (<= main_~j~0 58))} ~k~0 := ~i~0; {4480#(and (<= 58 main_~j~0) (<= main_~j~0 58))} is VALID [2022-04-15 13:00:55,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {4480#(and (<= 58 main_~j~0) (<= main_~j~0 58))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {4397#false} is VALID [2022-04-15 13:00:55,744 INFO L272 TraceCheckUtils]: 24: Hoare triple {4397#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {4397#false} is VALID [2022-04-15 13:00:55,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {4397#false} ~cond := #in~cond; {4397#false} is VALID [2022-04-15 13:00:55,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {4397#false} assume 0 == ~cond; {4397#false} is VALID [2022-04-15 13:00:55,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {4397#false} assume !false; {4397#false} is VALID [2022-04-15 13:00:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:55,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:55,860 INFO L290 TraceCheckUtils]: 27: Hoare triple {4397#false} assume !false; {4397#false} is VALID [2022-04-15 13:00:55,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {4397#false} assume 0 == ~cond; {4397#false} is VALID [2022-04-15 13:00:55,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {4397#false} ~cond := #in~cond; {4397#false} is VALID [2022-04-15 13:00:55,861 INFO L272 TraceCheckUtils]: 24: Hoare triple {4397#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {4397#false} is VALID [2022-04-15 13:00:55,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {4514#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {4397#false} is VALID [2022-04-15 13:00:55,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {4514#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {4514#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:55,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {4514#(= (mod main_~j~0 2) 0)} assume !(~i~0 < ~n~0); {4514#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:55,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {4524#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4514#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:00:55,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {4524#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4524#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:55,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {4524#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4524#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:55,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {4524#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4524#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:55,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {4524#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4524#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:55,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {4524#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4524#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:55,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {4524#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4524#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:55,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {4524#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4524#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:55,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {4524#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4524#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:55,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {4524#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4524#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:55,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {4524#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4524#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:55,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {4524#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4524#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:55,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {4524#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4524#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:55,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {4524#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4524#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:55,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {4396#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {4524#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:00:55,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {4396#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4396#true} is VALID [2022-04-15 13:00:55,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {4396#true} call #t~ret5 := main(); {4396#true} is VALID [2022-04-15 13:00:55,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4396#true} {4396#true} #62#return; {4396#true} is VALID [2022-04-15 13:00:55,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {4396#true} assume true; {4396#true} is VALID [2022-04-15 13:00:55,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {4396#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {4396#true} is VALID [2022-04-15 13:00:55,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {4396#true} call ULTIMATE.init(); {4396#true} is VALID [2022-04-15 13:00:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-15 13:00:55,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671461563] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:55,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:55,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 4] total 21 [2022-04-15 13:00:55,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:55,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [622836680] [2022-04-15 13:00:55,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [622836680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:55,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:55,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 13:00:55,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275016687] [2022-04-15 13:00:55,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:55,878 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 28 [2022-04-15 13:00:55,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:55,879 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-15 13:00:55,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:55,913 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 13:00:55,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:55,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 13:00:55,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2022-04-15 13:00:55,914 INFO L87 Difference]: Start difference. First operand 29 states and 29 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-15 13:00:56,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:56,834 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 13:00:56,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 13:00:56,835 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 28 [2022-04-15 13:00:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:00:56,835 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-15 13:00:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2022-04-15 13:00:56,836 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-15 13:00:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2022-04-15 13:00:56,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 37 transitions. [2022-04-15 13:00:56,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:56,870 INFO L225 Difference]: With dead ends: 37 [2022-04-15 13:00:56,870 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 13:00:56,870 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=1129, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 13:00:56,871 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:00:56,871 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 91 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 13:00:56,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 13:00:56,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 13:00:56,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:00:56,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:56,899 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:56,899 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:56,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:56,900 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 13:00:56,900 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 13:00:56,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:56,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:56,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 13:00:56,901 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 13:00:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:56,901 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 13:00:56,901 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 13:00:56,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:56,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:56,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:00:56,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:00:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:56,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-15 13:00:56,902 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2022-04-15 13:00:56,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:00:56,903 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-15 13:00:56,903 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-15 13:00:56,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-15 13:00:56,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:56,946 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 13:00:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 13:00:56,947 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:56,947 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:00:56,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-15 13:00:57,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:57,147 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:57,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:57,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1292497826, now seen corresponding path program 29 times [2022-04-15 13:00:57,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:57,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1687636705] [2022-04-15 13:00:57,304 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:00:57,304 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:00:57,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1292497826, now seen corresponding path program 30 times [2022-04-15 13:00:57,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:57,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877501523] [2022-04-15 13:00:57,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:57,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:57,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:57,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {4832#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {4811#true} is VALID [2022-04-15 13:00:57,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {4811#true} assume true; {4811#true} is VALID [2022-04-15 13:00:57,560 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4811#true} {4811#true} #62#return; {4811#true} is VALID [2022-04-15 13:00:57,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {4811#true} call ULTIMATE.init(); {4832#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:57,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {4832#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {4811#true} is VALID [2022-04-15 13:00:57,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {4811#true} assume true; {4811#true} is VALID [2022-04-15 13:00:57,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4811#true} {4811#true} #62#return; {4811#true} is VALID [2022-04-15 13:00:57,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {4811#true} call #t~ret5 := main(); {4811#true} is VALID [2022-04-15 13:00:57,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {4811#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4811#true} is VALID [2022-04-15 13:00:57,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {4811#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {4816#(= main_~i~0 0)} is VALID [2022-04-15 13:00:57,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {4816#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4817#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:00:57,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {4817#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4818#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:00:57,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {4818#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4819#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:00:57,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {4819#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4820#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:00:57,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {4820#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4821#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:00:57,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {4821#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4822#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:00:57,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {4822#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4823#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:00:57,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {4823#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4824#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:00:57,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {4824#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4825#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:00:57,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {4825#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4826#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:00:57,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {4826#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4827#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:00:57,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {4827#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4828#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:00:57,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {4828#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4829#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:00:57,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {4829#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4830#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:00:57,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {4830#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4831#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:57,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {4831#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {4831#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:57,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {4831#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {4831#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:57,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {4831#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {4812#false} is VALID [2022-04-15 13:00:57,577 INFO L272 TraceCheckUtils]: 25: Hoare triple {4812#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {4812#false} is VALID [2022-04-15 13:00:57,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {4812#false} ~cond := #in~cond; {4812#false} is VALID [2022-04-15 13:00:57,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {4812#false} assume 0 == ~cond; {4812#false} is VALID [2022-04-15 13:00:57,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {4812#false} assume !false; {4812#false} is VALID [2022-04-15 13:00:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:57,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:57,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877501523] [2022-04-15 13:00:57,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877501523] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:00:57,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476841255] [2022-04-15 13:00:57,578 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:00:57,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:57,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:00:57,580 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:00:57,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 13:00:57,618 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-15 13:00:57,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:00:57,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 13:00:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:57,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:00:58,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {4811#true} call ULTIMATE.init(); {4811#true} is VALID [2022-04-15 13:00:58,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {4811#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {4811#true} is VALID [2022-04-15 13:00:58,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {4811#true} assume true; {4811#true} is VALID [2022-04-15 13:00:58,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4811#true} {4811#true} #62#return; {4811#true} is VALID [2022-04-15 13:00:58,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {4811#true} call #t~ret5 := main(); {4811#true} is VALID [2022-04-15 13:00:58,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {4811#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4811#true} is VALID [2022-04-15 13:00:58,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {4811#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {4816#(= main_~i~0 0)} is VALID [2022-04-15 13:00:58,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {4816#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4857#(and (< 0 main_~n~0) (= main_~i~0 4))} is VALID [2022-04-15 13:00:58,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {4857#(and (< 0 main_~n~0) (= main_~i~0 4))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4861#(and (< 0 main_~n~0) (= main_~i~0 8))} is VALID [2022-04-15 13:00:58,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {4861#(and (< 0 main_~n~0) (= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4865#(and (< 0 main_~n~0) (= main_~i~0 12))} is VALID [2022-04-15 13:00:58,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {4865#(and (< 0 main_~n~0) (= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4869#(and (< 0 main_~n~0) (= main_~i~0 16))} is VALID [2022-04-15 13:00:58,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {4869#(and (< 0 main_~n~0) (= main_~i~0 16))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4873#(and (< 0 main_~n~0) (= 16 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:00:58,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {4873#(and (< 0 main_~n~0) (= 16 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4877#(and (< 0 main_~n~0) (= main_~i~0 24))} is VALID [2022-04-15 13:00:58,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {4877#(and (< 0 main_~n~0) (= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4881#(and (< 0 main_~n~0) (= main_~i~0 28))} is VALID [2022-04-15 13:00:58,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {4881#(and (< 0 main_~n~0) (= main_~i~0 28))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4885#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 4)) 28))} is VALID [2022-04-15 13:00:58,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {4885#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 4)) 28))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4889#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 8)) 28))} is VALID [2022-04-15 13:00:58,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {4889#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 8)) 28))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4893#(and (< 0 main_~n~0) (= 40 main_~i~0))} is VALID [2022-04-15 13:00:58,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {4893#(and (< 0 main_~n~0) (= 40 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4897#(and (< 0 main_~n~0) (= 44 main_~i~0))} is VALID [2022-04-15 13:00:58,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {4897#(and (< 0 main_~n~0) (= 44 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4901#(and (< 0 main_~n~0) (= 44 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:00:58,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {4901#(and (< 0 main_~n~0) (= 44 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4905#(and (< 0 main_~n~0) (= main_~i~0 52))} is VALID [2022-04-15 13:00:58,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {4905#(and (< 0 main_~n~0) (= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4909#(and (< 0 main_~n~0) (= 52 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:00:58,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {4909#(and (< 0 main_~n~0) (= 52 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4913#(and (< 0 main_~n~0) (= main_~j~0 (+ main_~i~0 2)) (= main_~i~0 60))} is VALID [2022-04-15 13:00:58,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {4913#(and (< 0 main_~n~0) (= main_~j~0 (+ main_~i~0 2)) (= main_~i~0 60))} assume !(~i~0 < ~n~0); {4917#(= main_~j~0 62)} is VALID [2022-04-15 13:00:58,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {4917#(= main_~j~0 62)} ~k~0 := ~i~0; {4917#(= main_~j~0 62)} is VALID [2022-04-15 13:00:58,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {4917#(= main_~j~0 62)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {4812#false} is VALID [2022-04-15 13:00:58,107 INFO L272 TraceCheckUtils]: 25: Hoare triple {4812#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {4812#false} is VALID [2022-04-15 13:00:58,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {4812#false} ~cond := #in~cond; {4812#false} is VALID [2022-04-15 13:00:58,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {4812#false} assume 0 == ~cond; {4812#false} is VALID [2022-04-15 13:00:58,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {4812#false} assume !false; {4812#false} is VALID [2022-04-15 13:00:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:58,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:59,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {4812#false} assume !false; {4812#false} is VALID [2022-04-15 13:00:59,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {4812#false} assume 0 == ~cond; {4812#false} is VALID [2022-04-15 13:00:59,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {4812#false} ~cond := #in~cond; {4812#false} is VALID [2022-04-15 13:00:59,013 INFO L272 TraceCheckUtils]: 25: Hoare triple {4812#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {4812#false} is VALID [2022-04-15 13:00:59,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {4831#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {4812#false} is VALID [2022-04-15 13:00:59,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {4831#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {4831#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:59,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {4954#(or (< main_~i~0 main_~n~0) (= (* 2 (div main_~j~0 2)) main_~j~0))} assume !(~i~0 < ~n~0); {4831#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:00:59,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {4958#(or (< (+ main_~i~0 4) main_~n~0) (= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4954#(or (< main_~i~0 main_~n~0) (= (* 2 (div main_~j~0 2)) main_~j~0))} is VALID [2022-04-15 13:00:59,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {4962#(or (< (+ main_~i~0 8) main_~n~0) (= (+ main_~i~0 10) (* 2 (div (+ main_~i~0 10) 2))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4958#(or (< (+ main_~i~0 4) main_~n~0) (= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2)))} is VALID [2022-04-15 13:00:59,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {4966#(or (= (+ main_~i~0 14) (* 2 (div (+ main_~i~0 14) 2))) (< (+ main_~i~0 12) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4962#(or (< (+ main_~i~0 8) main_~n~0) (= (+ main_~i~0 10) (* 2 (div (+ main_~i~0 10) 2))))} is VALID [2022-04-15 13:00:59,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {4970#(or (= (+ main_~i~0 18) (* 2 (div (+ main_~i~0 18) 2))) (< (+ main_~i~0 16) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4966#(or (= (+ main_~i~0 14) (* 2 (div (+ main_~i~0 14) 2))) (< (+ main_~i~0 12) main_~n~0))} is VALID [2022-04-15 13:00:59,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {4974#(or (< (+ main_~i~0 20) main_~n~0) (= (* (div (+ main_~i~0 22) 2) 2) (+ main_~i~0 22)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4970#(or (= (+ main_~i~0 18) (* 2 (div (+ main_~i~0 18) 2))) (< (+ main_~i~0 16) main_~n~0))} is VALID [2022-04-15 13:00:59,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {4978#(or (= (+ main_~i~0 26) (* 2 (div (+ main_~i~0 26) 2))) (< (+ main_~i~0 24) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4974#(or (< (+ main_~i~0 20) main_~n~0) (= (* (div (+ main_~i~0 22) 2) 2) (+ main_~i~0 22)))} is VALID [2022-04-15 13:00:59,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {4982#(or (< (+ main_~i~0 28) main_~n~0) (= (* 2 (div (+ 30 main_~i~0) 2)) (+ 30 main_~i~0)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4978#(or (= (+ main_~i~0 26) (* 2 (div (+ main_~i~0 26) 2))) (< (+ main_~i~0 24) main_~n~0))} is VALID [2022-04-15 13:00:59,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {4986#(or (< (+ 32 main_~i~0) main_~n~0) (= (+ main_~i~0 34) (* (div (+ main_~i~0 34) 2) 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4982#(or (< (+ main_~i~0 28) main_~n~0) (= (* 2 (div (+ 30 main_~i~0) 2)) (+ 30 main_~i~0)))} is VALID [2022-04-15 13:00:59,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {4990#(or (< (+ main_~i~0 36) main_~n~0) (= (* (div (+ main_~i~0 38) 2) 2) (+ main_~i~0 38)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4986#(or (< (+ 32 main_~i~0) main_~n~0) (= (+ main_~i~0 34) (* (div (+ main_~i~0 34) 2) 2)))} is VALID [2022-04-15 13:00:59,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {4994#(or (= (* (div (+ 42 main_~i~0) 2) 2) (+ 42 main_~i~0)) (< (+ 40 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4990#(or (< (+ main_~i~0 36) main_~n~0) (= (* (div (+ main_~i~0 38) 2) 2) (+ main_~i~0 38)))} is VALID [2022-04-15 13:00:59,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {4998#(or (< (+ 44 main_~i~0) main_~n~0) (= (* (div (+ main_~i~0 46) 2) 2) (+ main_~i~0 46)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4994#(or (= (* (div (+ 42 main_~i~0) 2) 2) (+ 42 main_~i~0)) (< (+ 40 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:00:59,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {5002#(or (= (+ main_~i~0 50) (* 2 (div (+ main_~i~0 50) 2))) (< (+ main_~i~0 48) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {4998#(or (< (+ 44 main_~i~0) main_~n~0) (= (* (div (+ main_~i~0 46) 2) 2) (+ main_~i~0 46)))} is VALID [2022-04-15 13:00:59,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {5006#(or (= (* 2 (div (+ main_~i~0 54) 2)) (+ main_~i~0 54)) (< (+ main_~i~0 52) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5002#(or (= (+ main_~i~0 50) (* 2 (div (+ main_~i~0 50) 2))) (< (+ main_~i~0 48) main_~n~0))} is VALID [2022-04-15 13:00:59,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {5010#(or (= (+ main_~i~0 58) (* 2 (div (+ main_~i~0 58) 2))) (< (+ 56 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5006#(or (= (* 2 (div (+ main_~i~0 54) 2)) (+ main_~i~0 54)) (< (+ main_~i~0 52) main_~n~0))} is VALID [2022-04-15 13:00:59,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {5014#(= (+ main_~i~0 62) (* 2 (div (+ main_~i~0 62) 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5010#(or (= (+ main_~i~0 58) (* 2 (div (+ main_~i~0 58) 2))) (< (+ 56 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:00:59,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {4811#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {5014#(= (+ main_~i~0 62) (* 2 (div (+ main_~i~0 62) 2)))} is VALID [2022-04-15 13:00:59,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {4811#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4811#true} is VALID [2022-04-15 13:00:59,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {4811#true} call #t~ret5 := main(); {4811#true} is VALID [2022-04-15 13:00:59,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4811#true} {4811#true} #62#return; {4811#true} is VALID [2022-04-15 13:00:59,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {4811#true} assume true; {4811#true} is VALID [2022-04-15 13:00:59,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {4811#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {4811#true} is VALID [2022-04-15 13:00:59,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {4811#true} call ULTIMATE.init(); {4811#true} is VALID [2022-04-15 13:00:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:59,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476841255] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:59,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:59,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 51 [2022-04-15 13:00:59,035 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:59,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1687636705] [2022-04-15 13:00:59,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1687636705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:59,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:59,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 13:00:59,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523432208] [2022-04-15 13:00:59,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:59,036 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 29 [2022-04-15 13:00:59,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:59,036 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-15 13:00:59,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:59,058 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 13:00:59,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:59,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 13:00:59,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=674, Invalid=1876, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 13:00:59,059 INFO L87 Difference]: Start difference. First operand 30 states and 30 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-15 13:01:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:00,299 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 13:01:00,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 13:01:00,300 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 29 [2022-04-15 13:01:00,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:00,300 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-15 13:01:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 38 transitions. [2022-04-15 13:01:00,301 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-15 13:01:00,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 38 transitions. [2022-04-15 13:01:00,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 38 transitions. [2022-04-15 13:01:00,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:00,348 INFO L225 Difference]: With dead ends: 38 [2022-04-15 13:01:00,349 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 13:01:00,350 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1009, Invalid=3413, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 13:01:00,350 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:00,350 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 95 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 13:01:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 13:01:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 13:01:00,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:00,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:00,375 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:00,375 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:00,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:00,376 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 13:01:00,376 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 13:01:00,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:00,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:00,377 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 13:01:00,377 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 13:01:00,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:00,377 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 13:01:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 13:01:00,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:00,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:00,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:00,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:00,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-15 13:01:00,379 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2022-04-15 13:01:00,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:00,379 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-15 13:01:00,379 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-15 13:01:00,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-15 13:01:00,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 13:01:00,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 13:01:00,439 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:00,439 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:00,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 13:01:00,639 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,SelfDestructingSolverStorable16 [2022-04-15 13:01:00,640 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:00,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:00,640 INFO L85 PathProgramCache]: Analyzing trace with hash 819671665, now seen corresponding path program 31 times [2022-04-15 13:01:00,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:00,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [398758103] [2022-04-15 13:01:00,816 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:01:00,816 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:01:00,817 INFO L85 PathProgramCache]: Analyzing trace with hash 819671665, now seen corresponding path program 32 times [2022-04-15 13:01:00,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:00,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67438180] [2022-04-15 13:01:00,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:00,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:01,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:01,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {5292#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {5270#true} is VALID [2022-04-15 13:01:01,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-04-15 13:01:01,102 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5270#true} {5270#true} #62#return; {5270#true} is VALID [2022-04-15 13:01:01,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {5270#true} call ULTIMATE.init(); {5292#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:01,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {5292#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {5270#true} is VALID [2022-04-15 13:01:01,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-04-15 13:01:01,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5270#true} {5270#true} #62#return; {5270#true} is VALID [2022-04-15 13:01:01,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {5270#true} call #t~ret5 := main(); {5270#true} is VALID [2022-04-15 13:01:01,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {5270#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {5270#true} is VALID [2022-04-15 13:01:01,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {5270#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {5275#(= main_~i~0 0)} is VALID [2022-04-15 13:01:01,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {5275#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5276#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:01:01,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {5276#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5277#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:01:01,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {5277#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5278#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:01:01,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {5278#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5279#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:01:01,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {5279#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5280#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:01:01,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {5280#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5281#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:01:01,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {5281#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5282#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:01:01,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {5282#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5283#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:01:01,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {5283#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5284#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:01:01,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {5284#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5285#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:01:01,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {5285#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5286#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:01:01,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {5286#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5287#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:01:01,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {5287#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5288#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:01:01,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {5288#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5289#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:01:01,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {5289#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5290#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:01:01,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {5290#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5291#(and (<= 66 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:01,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {5291#(and (<= 66 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(~i~0 < ~n~0); {5291#(and (<= 66 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:01,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {5291#(and (<= 66 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} ~k~0 := ~i~0; {5291#(and (<= 66 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:01,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {5291#(and (<= 66 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {5271#false} is VALID [2022-04-15 13:01:01,121 INFO L272 TraceCheckUtils]: 26: Hoare triple {5271#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {5271#false} is VALID [2022-04-15 13:01:01,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {5271#false} ~cond := #in~cond; {5271#false} is VALID [2022-04-15 13:01:01,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {5271#false} assume 0 == ~cond; {5271#false} is VALID [2022-04-15 13:01:01,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {5271#false} assume !false; {5271#false} is VALID [2022-04-15 13:01:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:01,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:01,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67438180] [2022-04-15 13:01:01,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67438180] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:01,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030376935] [2022-04-15 13:01:01,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:01:01,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:01,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:01,123 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:01,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 13:01:01,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:01:01,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:01:01,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 13:01:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:01,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:01,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {5270#true} call ULTIMATE.init(); {5270#true} is VALID [2022-04-15 13:01:01,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {5270#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {5270#true} is VALID [2022-04-15 13:01:01,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-04-15 13:01:01,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5270#true} {5270#true} #62#return; {5270#true} is VALID [2022-04-15 13:01:01,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {5270#true} call #t~ret5 := main(); {5270#true} is VALID [2022-04-15 13:01:01,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {5270#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {5270#true} is VALID [2022-04-15 13:01:01,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {5270#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {5275#(= main_~i~0 0)} is VALID [2022-04-15 13:01:01,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {5275#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5276#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:01:01,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {5276#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5277#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:01:01,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {5277#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5278#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:01:01,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {5278#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5279#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:01:01,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {5279#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5280#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:01:01,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {5280#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5281#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:01:01,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {5281#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5282#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:01:01,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {5282#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5283#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:01:01,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {5283#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5284#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:01:01,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {5284#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5285#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:01:01,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {5285#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5286#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:01:01,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {5286#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5287#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:01:01,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {5287#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5288#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:01:01,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {5288#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5289#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:01:01,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {5289#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5290#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:01:01,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {5290#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5362#(and (<= main_~j~0 66) (<= 66 main_~j~0))} is VALID [2022-04-15 13:01:01,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {5362#(and (<= main_~j~0 66) (<= 66 main_~j~0))} assume !(~i~0 < ~n~0); {5362#(and (<= main_~j~0 66) (<= 66 main_~j~0))} is VALID [2022-04-15 13:01:01,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {5362#(and (<= main_~j~0 66) (<= 66 main_~j~0))} ~k~0 := ~i~0; {5362#(and (<= main_~j~0 66) (<= 66 main_~j~0))} is VALID [2022-04-15 13:01:01,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {5362#(and (<= main_~j~0 66) (<= 66 main_~j~0))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {5271#false} is VALID [2022-04-15 13:01:01,495 INFO L272 TraceCheckUtils]: 26: Hoare triple {5271#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {5271#false} is VALID [2022-04-15 13:01:01,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {5271#false} ~cond := #in~cond; {5271#false} is VALID [2022-04-15 13:01:01,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {5271#false} assume 0 == ~cond; {5271#false} is VALID [2022-04-15 13:01:01,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {5271#false} assume !false; {5271#false} is VALID [2022-04-15 13:01:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:01,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:01,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {5271#false} assume !false; {5271#false} is VALID [2022-04-15 13:01:01,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {5271#false} assume 0 == ~cond; {5271#false} is VALID [2022-04-15 13:01:01,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {5271#false} ~cond := #in~cond; {5271#false} is VALID [2022-04-15 13:01:01,630 INFO L272 TraceCheckUtils]: 26: Hoare triple {5271#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {5271#false} is VALID [2022-04-15 13:01:01,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {5396#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {5271#false} is VALID [2022-04-15 13:01:01,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {5396#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {5396#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:01,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {5396#(= (mod main_~j~0 2) 0)} assume !(~i~0 < ~n~0); {5396#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:01,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {5406#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5396#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:01,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {5406#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5406#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:01,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {5406#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5406#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:01,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {5406#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5406#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:01,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {5406#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5406#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:01,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {5406#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5406#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:01,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {5406#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5406#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:01,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {5406#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5406#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:01,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {5406#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5406#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:01,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {5406#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5406#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:01,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {5406#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5406#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:01,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {5406#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5406#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:01,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {5406#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5406#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:01,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {5406#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5406#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:01,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {5406#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5406#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:01,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {5406#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5406#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:01,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {5270#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {5406#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:01,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {5270#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {5270#true} is VALID [2022-04-15 13:01:01,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {5270#true} call #t~ret5 := main(); {5270#true} is VALID [2022-04-15 13:01:01,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5270#true} {5270#true} #62#return; {5270#true} is VALID [2022-04-15 13:01:01,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-04-15 13:01:01,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {5270#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {5270#true} is VALID [2022-04-15 13:01:01,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {5270#true} call ULTIMATE.init(); {5270#true} is VALID [2022-04-15 13:01:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-15 13:01:01,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030376935] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:01,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:01,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 4] total 23 [2022-04-15 13:01:01,652 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:01,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [398758103] [2022-04-15 13:01:01,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [398758103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:01,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:01,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 13:01:01,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341187134] [2022-04-15 13:01:01,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:01,654 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 30 [2022-04-15 13:01:01,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:01,654 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-15 13:01:01,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:01,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 13:01:01,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:01,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 13:01:01,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-04-15 13:01:01,676 INFO L87 Difference]: Start difference. First operand 31 states and 31 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-15 13:01:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:02,959 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 13:01:02,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 13:01:02,959 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 30 [2022-04-15 13:01:02,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:02,959 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-15 13:01:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 39 transitions. [2022-04-15 13:01:02,961 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-15 13:01:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 39 transitions. [2022-04-15 13:01:02,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 39 transitions. [2022-04-15 13:01:03,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:03,011 INFO L225 Difference]: With dead ends: 39 [2022-04-15 13:01:03,011 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 13:01:03,012 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=1413, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 13:01:03,012 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:03,012 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 101 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 13:01:03,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 13:01:03,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 13:01:03,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:03,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 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-15 13:01:03,037 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 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-15 13:01:03,037 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 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-15 13:01:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:03,038 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 13:01:03,038 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 13:01:03,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:03,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:03,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 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 32 states. [2022-04-15 13:01:03,039 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 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 32 states. [2022-04-15 13:01:03,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:03,040 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 13:01:03,040 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 13:01:03,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:03,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:03,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:03,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 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-15 13:01:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-15 13:01:03,041 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2022-04-15 13:01:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:03,041 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-15 13:01:03,041 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-15 13:01:03,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-15 13:01:03,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:03,086 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 13:01:03,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 13:01:03,086 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:03,086 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:03,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 13:01:03,287 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 13:01:03,287 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:03,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:03,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1872416446, now seen corresponding path program 33 times [2022-04-15 13:01:03,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:03,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [348264820] [2022-04-15 13:01:03,456 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:01:03,457 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:01:03,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1872416446, now seen corresponding path program 34 times [2022-04-15 13:01:03,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:03,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109697856] [2022-04-15 13:01:03,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:03,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:03,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:03,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {5738#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {5715#true} is VALID [2022-04-15 13:01:03,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {5715#true} assume true; {5715#true} is VALID [2022-04-15 13:01:03,772 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5715#true} {5715#true} #62#return; {5715#true} is VALID [2022-04-15 13:01:03,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {5715#true} call ULTIMATE.init(); {5738#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:03,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {5738#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {5715#true} is VALID [2022-04-15 13:01:03,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {5715#true} assume true; {5715#true} is VALID [2022-04-15 13:01:03,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5715#true} {5715#true} #62#return; {5715#true} is VALID [2022-04-15 13:01:03,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {5715#true} call #t~ret5 := main(); {5715#true} is VALID [2022-04-15 13:01:03,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {5715#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {5715#true} is VALID [2022-04-15 13:01:03,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {5715#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {5720#(= main_~i~0 0)} is VALID [2022-04-15 13:01:03,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {5720#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5721#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:01:03,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {5721#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5722#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:01:03,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {5722#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5723#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:01:03,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {5723#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5724#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:01:03,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {5724#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5725#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:01:03,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {5725#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5726#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:01:03,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {5726#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5727#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:01:03,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {5727#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5728#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:01:03,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {5728#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5729#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:01:03,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {5729#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5730#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:01:03,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {5730#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5731#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:01:03,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {5731#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5732#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:01:03,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {5732#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5733#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:01:03,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {5733#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5734#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:01:03,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {5734#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5735#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:01:03,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {5735#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5736#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:01:03,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {5736#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5737#(and (<= 70 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:03,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {5737#(and (<= 70 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(~i~0 < ~n~0); {5737#(and (<= 70 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:03,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {5737#(and (<= 70 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} ~k~0 := ~i~0; {5737#(and (<= 70 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:03,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {5737#(and (<= 70 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {5716#false} is VALID [2022-04-15 13:01:03,794 INFO L272 TraceCheckUtils]: 27: Hoare triple {5716#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {5716#false} is VALID [2022-04-15 13:01:03,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {5716#false} ~cond := #in~cond; {5716#false} is VALID [2022-04-15 13:01:03,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {5716#false} assume 0 == ~cond; {5716#false} is VALID [2022-04-15 13:01:03,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {5716#false} assume !false; {5716#false} is VALID [2022-04-15 13:01:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:03,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:03,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109697856] [2022-04-15 13:01:03,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109697856] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:03,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832246782] [2022-04-15 13:01:03,795 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:01:03,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:03,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:03,796 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:03,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 13:01:03,835 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:01:03,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:01:03,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 13:01:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:03,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:04,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {5715#true} call ULTIMATE.init(); {5715#true} is VALID [2022-04-15 13:01:04,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {5715#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {5715#true} is VALID [2022-04-15 13:01:04,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {5715#true} assume true; {5715#true} is VALID [2022-04-15 13:01:04,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5715#true} {5715#true} #62#return; {5715#true} is VALID [2022-04-15 13:01:04,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {5715#true} call #t~ret5 := main(); {5715#true} is VALID [2022-04-15 13:01:04,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {5715#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {5715#true} is VALID [2022-04-15 13:01:04,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {5715#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {5720#(= main_~i~0 0)} is VALID [2022-04-15 13:01:04,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {5720#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5721#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:01:04,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {5721#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5722#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:01:04,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {5722#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5723#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:01:04,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {5723#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5724#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:01:04,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {5724#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5725#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:01:04,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {5725#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5726#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:01:04,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {5726#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5727#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:01:04,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {5727#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5728#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:01:04,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {5728#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5729#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:01:04,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {5729#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5730#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:01:04,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {5730#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5731#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:01:04,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {5731#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5732#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:01:04,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {5732#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5733#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:01:04,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {5733#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5734#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:01:04,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {5734#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5735#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:01:04,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {5735#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5736#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:01:04,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {5736#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5811#(and (<= 70 main_~j~0) (<= main_~j~0 70))} is VALID [2022-04-15 13:01:04,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {5811#(and (<= 70 main_~j~0) (<= main_~j~0 70))} assume !(~i~0 < ~n~0); {5811#(and (<= 70 main_~j~0) (<= main_~j~0 70))} is VALID [2022-04-15 13:01:04,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {5811#(and (<= 70 main_~j~0) (<= main_~j~0 70))} ~k~0 := ~i~0; {5811#(and (<= 70 main_~j~0) (<= main_~j~0 70))} is VALID [2022-04-15 13:01:04,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {5811#(and (<= 70 main_~j~0) (<= main_~j~0 70))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {5716#false} is VALID [2022-04-15 13:01:04,225 INFO L272 TraceCheckUtils]: 27: Hoare triple {5716#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {5716#false} is VALID [2022-04-15 13:01:04,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {5716#false} ~cond := #in~cond; {5716#false} is VALID [2022-04-15 13:01:04,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {5716#false} assume 0 == ~cond; {5716#false} is VALID [2022-04-15 13:01:04,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {5716#false} assume !false; {5716#false} is VALID [2022-04-15 13:01:04,225 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:04,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:04,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {5716#false} assume !false; {5716#false} is VALID [2022-04-15 13:01:04,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {5716#false} assume 0 == ~cond; {5716#false} is VALID [2022-04-15 13:01:04,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {5716#false} ~cond := #in~cond; {5716#false} is VALID [2022-04-15 13:01:04,353 INFO L272 TraceCheckUtils]: 27: Hoare triple {5716#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {5716#false} is VALID [2022-04-15 13:01:04,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {5845#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {5716#false} is VALID [2022-04-15 13:01:04,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {5845#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {5845#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:04,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {5845#(= (mod main_~j~0 2) 0)} assume !(~i~0 < ~n~0); {5845#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:04,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {5855#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5845#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:04,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {5855#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5855#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:04,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {5855#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5855#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:04,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {5855#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5855#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:04,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {5855#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5855#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:04,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {5855#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5855#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:04,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {5855#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5855#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:04,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {5855#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5855#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:04,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {5855#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5855#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:04,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {5855#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5855#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:04,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {5855#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5855#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:04,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {5855#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5855#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:04,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {5855#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5855#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:04,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {5855#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5855#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:04,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {5855#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5855#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:04,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {5855#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5855#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:04,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {5855#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {5855#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:04,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {5715#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {5855#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:04,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {5715#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {5715#true} is VALID [2022-04-15 13:01:04,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {5715#true} call #t~ret5 := main(); {5715#true} is VALID [2022-04-15 13:01:04,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5715#true} {5715#true} #62#return; {5715#true} is VALID [2022-04-15 13:01:04,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {5715#true} assume true; {5715#true} is VALID [2022-04-15 13:01:04,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {5715#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {5715#true} is VALID [2022-04-15 13:01:04,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {5715#true} call ULTIMATE.init(); {5715#true} is VALID [2022-04-15 13:01:04,376 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-15 13:01:04,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832246782] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:04,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:04,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 4] total 24 [2022-04-15 13:01:04,377 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:04,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [348264820] [2022-04-15 13:01:04,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [348264820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:04,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:04,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 13:01:04,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357272171] [2022-04-15 13:01:04,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:04,377 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 31 [2022-04-15 13:01:04,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:04,378 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-15 13:01:04,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:04,400 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 13:01:04,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:04,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 13:01:04,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2022-04-15 13:01:04,400 INFO L87 Difference]: Start difference. First operand 32 states and 32 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-15 13:01:05,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:05,909 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 13:01:05,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 13:01:05,909 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 31 [2022-04-15 13:01:05,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:05,909 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-15 13:01:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 40 transitions. [2022-04-15 13:01:05,910 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-15 13:01:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 40 transitions. [2022-04-15 13:01:05,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 40 transitions. [2022-04-15 13:01:05,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:05,946 INFO L225 Difference]: With dead ends: 40 [2022-04-15 13:01:05,946 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 13:01:05,947 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=1567, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 13:01:05,947 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:05,947 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 106 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 13:01:05,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 13:01:05,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 13:01:05,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:05,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:05,971 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:05,972 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:05,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:05,972 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 13:01:05,972 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 13:01:05,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:05,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:05,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 13:01:05,973 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 13:01:05,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:05,973 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 13:01:05,973 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 13:01:05,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:05,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:05,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:05,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-15 13:01:05,974 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2022-04-15 13:01:05,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:05,975 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-15 13:01:05,975 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-15 13:01:05,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-15 13:01:06,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 13:01:06,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 13:01:06,022 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:06,022 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:06,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 13:01:06,222 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:06,223 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:06,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:06,223 INFO L85 PathProgramCache]: Analyzing trace with hash 147766289, now seen corresponding path program 35 times [2022-04-15 13:01:06,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:06,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1444793860] [2022-04-15 13:01:06,406 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:01:06,406 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:01:06,406 INFO L85 PathProgramCache]: Analyzing trace with hash 147766289, now seen corresponding path program 36 times [2022-04-15 13:01:06,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:06,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646458263] [2022-04-15 13:01:06,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:06,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:06,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:06,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {6199#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {6175#true} is VALID [2022-04-15 13:01:06,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {6175#true} assume true; {6175#true} is VALID [2022-04-15 13:01:06,744 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6175#true} {6175#true} #62#return; {6175#true} is VALID [2022-04-15 13:01:06,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {6175#true} call ULTIMATE.init(); {6199#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:06,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {6199#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {6175#true} is VALID [2022-04-15 13:01:06,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2022-04-15 13:01:06,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6175#true} #62#return; {6175#true} is VALID [2022-04-15 13:01:06,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {6175#true} call #t~ret5 := main(); {6175#true} is VALID [2022-04-15 13:01:06,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {6175#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {6175#true} is VALID [2022-04-15 13:01:06,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {6175#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {6180#(= main_~i~0 0)} is VALID [2022-04-15 13:01:06,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {6180#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6181#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:01:06,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {6181#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6182#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:01:06,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {6182#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6183#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:01:06,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {6183#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6184#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:01:06,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {6184#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6185#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:01:06,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {6185#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6186#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:01:06,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {6186#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6187#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:01:06,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {6187#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6188#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:01:06,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {6188#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6189#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:01:06,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {6189#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6190#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:01:06,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {6190#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6191#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:01:06,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {6191#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6192#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:01:06,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {6192#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6193#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:01:06,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {6193#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6194#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:01:06,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {6194#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6195#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:01:06,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {6195#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6196#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:01:06,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {6196#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6197#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:01:06,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {6197#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6198#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:01:06,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {6198#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {6198#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:01:06,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {6198#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {6198#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:01:06,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {6198#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {6176#false} is VALID [2022-04-15 13:01:06,772 INFO L272 TraceCheckUtils]: 28: Hoare triple {6176#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {6176#false} is VALID [2022-04-15 13:01:06,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {6176#false} ~cond := #in~cond; {6176#false} is VALID [2022-04-15 13:01:06,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {6176#false} assume 0 == ~cond; {6176#false} is VALID [2022-04-15 13:01:06,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {6176#false} assume !false; {6176#false} is VALID [2022-04-15 13:01:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:06,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:06,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646458263] [2022-04-15 13:01:06,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646458263] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:06,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331689081] [2022-04-15 13:01:06,773 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:01:06,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:06,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:06,774 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:06,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 13:01:06,814 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-15 13:01:06,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:01:06,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-15 13:01:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:06,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:08,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {6175#true} call ULTIMATE.init(); {6175#true} is VALID [2022-04-15 13:01:08,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {6175#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {6175#true} is VALID [2022-04-15 13:01:08,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2022-04-15 13:01:08,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6175#true} #62#return; {6175#true} is VALID [2022-04-15 13:01:08,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {6175#true} call #t~ret5 := main(); {6175#true} is VALID [2022-04-15 13:01:08,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {6175#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {6175#true} is VALID [2022-04-15 13:01:08,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {6175#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {6180#(= main_~i~0 0)} is VALID [2022-04-15 13:01:08,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {6180#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6181#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:01:08,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {6181#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6227#(and (< main_~i~0 (+ main_~n~0 4)) (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:01:08,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {6227#(and (< main_~i~0 (+ main_~n~0 4)) (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6231#(and (<= 12 main_~i~0) (<= main_~i~0 12) (< main_~i~0 (+ main_~n~0 8)))} is VALID [2022-04-15 13:01:08,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {6231#(and (<= 12 main_~i~0) (<= main_~i~0 12) (< main_~i~0 (+ main_~n~0 8)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6235#(and (<= main_~i~0 16) (<= 16 main_~i~0) (< main_~i~0 (+ main_~n~0 12)))} is VALID [2022-04-15 13:01:08,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {6235#(and (<= main_~i~0 16) (<= 16 main_~i~0) (< main_~i~0 (+ main_~n~0 12)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6239#(and (< main_~i~0 (+ main_~n~0 16)) (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:01:08,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {6239#(and (< main_~i~0 (+ main_~n~0 16)) (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6243#(and (<= 24 main_~i~0) (<= main_~i~0 24) (< main_~i~0 (+ main_~n~0 20)))} is VALID [2022-04-15 13:01:08,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {6243#(and (<= 24 main_~i~0) (<= main_~i~0 24) (< main_~i~0 (+ main_~n~0 20)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6247#(and (<= main_~i~0 28) (<= 28 main_~i~0) (< main_~i~0 (+ main_~n~0 24)))} is VALID [2022-04-15 13:01:08,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {6247#(and (<= main_~i~0 28) (<= 28 main_~i~0) (< main_~i~0 (+ main_~n~0 24)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6251#(and (< main_~i~0 (+ main_~n~0 28)) (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:01:08,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {6251#(and (< main_~i~0 (+ main_~n~0 28)) (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6255#(and (<= 36 main_~i~0) (< main_~i~0 (+ 32 main_~n~0)) (<= main_~i~0 36))} is VALID [2022-04-15 13:01:08,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {6255#(and (<= 36 main_~i~0) (< main_~i~0 (+ 32 main_~n~0)) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6259#(and (< main_~i~0 (+ main_~n~0 36)) (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:01:08,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {6259#(and (< main_~i~0 (+ main_~n~0 36)) (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6263#(and (<= 44 main_~i~0) (< main_~i~0 (+ 40 main_~n~0)) (<= main_~i~0 44))} is VALID [2022-04-15 13:01:08,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {6263#(and (<= 44 main_~i~0) (< main_~i~0 (+ 40 main_~n~0)) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6267#(and (<= 48 main_~i~0) (< main_~i~0 (+ 44 main_~n~0)) (<= main_~i~0 48))} is VALID [2022-04-15 13:01:08,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {6267#(and (<= 48 main_~i~0) (< main_~i~0 (+ 44 main_~n~0)) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6271#(and (<= 52 main_~i~0) (<= main_~i~0 52) (< main_~i~0 (+ main_~n~0 48)))} is VALID [2022-04-15 13:01:08,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {6271#(and (<= 52 main_~i~0) (<= main_~i~0 52) (< main_~i~0 (+ main_~n~0 48)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6275#(and (<= main_~i~0 56) (<= 56 main_~i~0) (< main_~i~0 (+ main_~n~0 52)))} is VALID [2022-04-15 13:01:08,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {6275#(and (<= main_~i~0 56) (<= 56 main_~i~0) (< main_~i~0 (+ main_~n~0 52)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6279#(and (<= main_~i~0 60) (< main_~i~0 (+ 56 main_~n~0)) (<= 60 main_~i~0))} is VALID [2022-04-15 13:01:08,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {6279#(and (<= main_~i~0 60) (< main_~i~0 (+ 56 main_~n~0)) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6283#(and (< main_~i~0 (+ main_~n~0 60)) (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:01:08,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {6283#(and (< main_~i~0 (+ main_~n~0 60)) (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6287#(and (<= 68 main_~i~0) (<= main_~i~0 68) (< main_~i~0 (+ 64 main_~n~0)))} is VALID [2022-04-15 13:01:08,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {6287#(and (<= 68 main_~i~0) (<= main_~i~0 68) (< main_~i~0 (+ 64 main_~n~0)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6291#(and (= main_~j~0 (+ main_~i~0 2)) (<= main_~i~0 72) (<= 72 main_~i~0) (< main_~i~0 (+ 68 main_~n~0)))} is VALID [2022-04-15 13:01:08,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {6291#(and (= main_~j~0 (+ main_~i~0 2)) (<= main_~i~0 72) (<= 72 main_~i~0) (< main_~i~0 (+ 68 main_~n~0)))} assume !(~i~0 < ~n~0); {6295#(and (<= main_~j~0 74) (<= 74 main_~j~0))} is VALID [2022-04-15 13:01:08,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {6295#(and (<= main_~j~0 74) (<= 74 main_~j~0))} ~k~0 := ~i~0; {6295#(and (<= main_~j~0 74) (<= 74 main_~j~0))} is VALID [2022-04-15 13:01:08,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {6295#(and (<= main_~j~0 74) (<= 74 main_~j~0))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {6176#false} is VALID [2022-04-15 13:01:08,039 INFO L272 TraceCheckUtils]: 28: Hoare triple {6176#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {6176#false} is VALID [2022-04-15 13:01:08,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {6176#false} ~cond := #in~cond; {6176#false} is VALID [2022-04-15 13:01:08,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {6176#false} assume 0 == ~cond; {6176#false} is VALID [2022-04-15 13:01:08,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {6176#false} assume !false; {6176#false} is VALID [2022-04-15 13:01:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:08,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:09,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {6176#false} assume !false; {6176#false} is VALID [2022-04-15 13:01:09,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {6176#false} assume 0 == ~cond; {6176#false} is VALID [2022-04-15 13:01:09,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {6176#false} ~cond := #in~cond; {6176#false} is VALID [2022-04-15 13:01:09,374 INFO L272 TraceCheckUtils]: 28: Hoare triple {6176#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {6176#false} is VALID [2022-04-15 13:01:09,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {6198#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {6176#false} is VALID [2022-04-15 13:01:09,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {6198#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {6198#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:01:09,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {6332#(or (< main_~i~0 main_~n~0) (= (* 2 (div main_~j~0 2)) main_~j~0))} assume !(~i~0 < ~n~0); {6198#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:01:09,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {6336#(or (< (+ main_~i~0 4) main_~n~0) (= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6332#(or (< main_~i~0 main_~n~0) (= (* 2 (div main_~j~0 2)) main_~j~0))} is VALID [2022-04-15 13:01:09,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {6340#(or (< (+ main_~i~0 8) main_~n~0) (= (+ main_~i~0 10) (* 2 (div (+ main_~i~0 10) 2))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6336#(or (< (+ main_~i~0 4) main_~n~0) (= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2)))} is VALID [2022-04-15 13:01:09,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {6344#(or (= (+ main_~i~0 14) (* 2 (div (+ main_~i~0 14) 2))) (< (+ main_~i~0 12) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6340#(or (< (+ main_~i~0 8) main_~n~0) (= (+ main_~i~0 10) (* 2 (div (+ main_~i~0 10) 2))))} is VALID [2022-04-15 13:01:09,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {6348#(or (= (+ main_~i~0 18) (* 2 (div (+ main_~i~0 18) 2))) (< (+ main_~i~0 16) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6344#(or (= (+ main_~i~0 14) (* 2 (div (+ main_~i~0 14) 2))) (< (+ main_~i~0 12) main_~n~0))} is VALID [2022-04-15 13:01:09,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {6352#(or (< (+ main_~i~0 20) main_~n~0) (= (* (div (+ main_~i~0 22) 2) 2) (+ main_~i~0 22)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6348#(or (= (+ main_~i~0 18) (* 2 (div (+ main_~i~0 18) 2))) (< (+ main_~i~0 16) main_~n~0))} is VALID [2022-04-15 13:01:09,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {6356#(or (= (+ main_~i~0 26) (* 2 (div (+ main_~i~0 26) 2))) (< (+ main_~i~0 24) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6352#(or (< (+ main_~i~0 20) main_~n~0) (= (* (div (+ main_~i~0 22) 2) 2) (+ main_~i~0 22)))} is VALID [2022-04-15 13:01:09,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {6360#(or (< (+ main_~i~0 28) main_~n~0) (= (* 2 (div (+ 30 main_~i~0) 2)) (+ 30 main_~i~0)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6356#(or (= (+ main_~i~0 26) (* 2 (div (+ main_~i~0 26) 2))) (< (+ main_~i~0 24) main_~n~0))} is VALID [2022-04-15 13:01:09,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {6364#(or (< (+ 32 main_~i~0) main_~n~0) (= (+ main_~i~0 34) (* (div (+ main_~i~0 34) 2) 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6360#(or (< (+ main_~i~0 28) main_~n~0) (= (* 2 (div (+ 30 main_~i~0) 2)) (+ 30 main_~i~0)))} is VALID [2022-04-15 13:01:09,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {6368#(or (< (+ main_~i~0 36) main_~n~0) (= (* (div (+ main_~i~0 38) 2) 2) (+ main_~i~0 38)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6364#(or (< (+ 32 main_~i~0) main_~n~0) (= (+ main_~i~0 34) (* (div (+ main_~i~0 34) 2) 2)))} is VALID [2022-04-15 13:01:09,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {6372#(or (= (* (div (+ 42 main_~i~0) 2) 2) (+ 42 main_~i~0)) (< (+ 40 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6368#(or (< (+ main_~i~0 36) main_~n~0) (= (* (div (+ main_~i~0 38) 2) 2) (+ main_~i~0 38)))} is VALID [2022-04-15 13:01:09,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {6376#(or (< (+ 44 main_~i~0) main_~n~0) (= (* (div (+ main_~i~0 46) 2) 2) (+ main_~i~0 46)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6372#(or (= (* (div (+ 42 main_~i~0) 2) 2) (+ 42 main_~i~0)) (< (+ 40 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:01:09,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {6380#(or (= (+ main_~i~0 50) (* 2 (div (+ main_~i~0 50) 2))) (< (+ main_~i~0 48) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6376#(or (< (+ 44 main_~i~0) main_~n~0) (= (* (div (+ main_~i~0 46) 2) 2) (+ main_~i~0 46)))} is VALID [2022-04-15 13:01:09,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {6384#(or (= (* 2 (div (+ main_~i~0 54) 2)) (+ main_~i~0 54)) (< (+ main_~i~0 52) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6380#(or (= (+ main_~i~0 50) (* 2 (div (+ main_~i~0 50) 2))) (< (+ main_~i~0 48) main_~n~0))} is VALID [2022-04-15 13:01:09,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {6388#(or (= (+ main_~i~0 58) (* 2 (div (+ main_~i~0 58) 2))) (< (+ 56 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6384#(or (= (* 2 (div (+ main_~i~0 54) 2)) (+ main_~i~0 54)) (< (+ main_~i~0 52) main_~n~0))} is VALID [2022-04-15 13:01:09,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {6392#(or (= (+ main_~i~0 62) (* 2 (div (+ main_~i~0 62) 2))) (< (+ main_~i~0 60) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6388#(or (= (+ main_~i~0 58) (* 2 (div (+ main_~i~0 58) 2))) (< (+ 56 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:01:09,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {6396#(or (< (+ 64 main_~i~0) main_~n~0) (= (+ 66 main_~i~0) (* (div (+ 66 main_~i~0) 2) 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6392#(or (= (+ main_~i~0 62) (* 2 (div (+ main_~i~0 62) 2))) (< (+ main_~i~0 60) main_~n~0))} is VALID [2022-04-15 13:01:09,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {6400#(= (+ main_~i~0 70) (* 2 (div (+ main_~i~0 70) 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6396#(or (< (+ 64 main_~i~0) main_~n~0) (= (+ 66 main_~i~0) (* (div (+ 66 main_~i~0) 2) 2)))} is VALID [2022-04-15 13:01:09,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {6400#(= (+ main_~i~0 70) (* 2 (div (+ main_~i~0 70) 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6400#(= (+ main_~i~0 70) (* 2 (div (+ main_~i~0 70) 2)))} is VALID [2022-04-15 13:01:09,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {6175#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {6400#(= (+ main_~i~0 70) (* 2 (div (+ main_~i~0 70) 2)))} is VALID [2022-04-15 13:01:09,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {6175#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {6175#true} is VALID [2022-04-15 13:01:09,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {6175#true} call #t~ret5 := main(); {6175#true} is VALID [2022-04-15 13:01:09,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6175#true} #62#return; {6175#true} is VALID [2022-04-15 13:01:09,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2022-04-15 13:01:09,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {6175#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {6175#true} is VALID [2022-04-15 13:01:09,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {6175#true} call ULTIMATE.init(); {6175#true} is VALID [2022-04-15 13:01:09,414 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 13:01:09,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331689081] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:09,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:09,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 21] total 58 [2022-04-15 13:01:09,415 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:09,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1444793860] [2022-04-15 13:01:09,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1444793860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:09,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:09,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 13:01:09,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417242853] [2022-04-15 13:01:09,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:09,415 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 32 [2022-04-15 13:01:09,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:09,416 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-15 13:01:09,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:09,445 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 13:01:09,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:09,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 13:01:09,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=866, Invalid=2440, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 13:01:09,447 INFO L87 Difference]: Start difference. First operand 33 states and 33 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-15 13:01:11,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:11,440 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 13:01:11,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 13:01:11,440 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 32 [2022-04-15 13:01:11,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:11,441 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-15 13:01:11,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 41 transitions. [2022-04-15 13:01:11,441 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-15 13:01:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 41 transitions. [2022-04-15 13:01:11,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 41 transitions. [2022-04-15 13:01:11,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:11,490 INFO L225 Difference]: With dead ends: 41 [2022-04-15 13:01:11,490 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 13:01:11,491 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1295 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1303, Invalid=4549, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 13:01:11,491 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:11,492 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 110 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 13:01:11,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 13:01:11,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 13:01:11,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:11,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 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-15 13:01:11,518 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 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-15 13:01:11,518 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 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-15 13:01:11,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:11,519 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 13:01:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 13:01:11,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:11,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:11,519 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 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 34 states. [2022-04-15 13:01:11,519 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 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 34 states. [2022-04-15 13:01:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:11,520 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 13:01:11,520 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 13:01:11,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:11,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:11,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:11,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 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-15 13:01:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-15 13:01:11,520 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2022-04-15 13:01:11,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:11,521 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-15 13:01:11,521 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-15 13:01:11,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-15 13:01:11,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:11,567 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 13:01:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 13:01:11,567 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:11,568 INFO L499 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:11,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 13:01:11,768 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:11,768 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:11,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:11,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1776781026, now seen corresponding path program 37 times [2022-04-15 13:01:11,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:11,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1552288769] [2022-04-15 13:01:11,940 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:01:11,940 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:01:11,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1776781026, now seen corresponding path program 38 times [2022-04-15 13:01:11,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:11,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382131295] [2022-04-15 13:01:11,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:11,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:12,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:12,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {6708#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {6683#true} is VALID [2022-04-15 13:01:12,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {6683#true} assume true; {6683#true} is VALID [2022-04-15 13:01:12,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6683#true} {6683#true} #62#return; {6683#true} is VALID [2022-04-15 13:01:12,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {6683#true} call ULTIMATE.init(); {6708#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:12,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {6708#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {6683#true} is VALID [2022-04-15 13:01:12,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {6683#true} assume true; {6683#true} is VALID [2022-04-15 13:01:12,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6683#true} {6683#true} #62#return; {6683#true} is VALID [2022-04-15 13:01:12,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {6683#true} call #t~ret5 := main(); {6683#true} is VALID [2022-04-15 13:01:12,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {6683#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {6683#true} is VALID [2022-04-15 13:01:12,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {6683#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {6688#(= main_~i~0 0)} is VALID [2022-04-15 13:01:12,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {6688#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6689#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:01:12,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {6689#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6690#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:01:12,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {6690#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6691#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:01:12,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {6691#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6692#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:01:12,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {6692#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6693#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:01:12,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {6693#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6694#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:01:12,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {6694#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6695#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:01:12,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {6695#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6696#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:01:12,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {6696#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6697#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:01:12,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {6697#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6698#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:01:12,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {6698#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6699#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:01:12,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {6699#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6700#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:01:12,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {6700#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6701#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:01:12,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {6701#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6702#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:01:12,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {6702#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6703#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:01:12,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {6703#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6704#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:01:12,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {6704#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6705#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:01:12,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {6705#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6706#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:01:12,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {6706#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6707#(and (<= 78 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:12,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {6707#(and (<= 78 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(~i~0 < ~n~0); {6707#(and (<= 78 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:12,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {6707#(and (<= 78 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} ~k~0 := ~i~0; {6707#(and (<= 78 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:12,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {6707#(and (<= 78 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {6684#false} is VALID [2022-04-15 13:01:12,316 INFO L272 TraceCheckUtils]: 29: Hoare triple {6684#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {6684#false} is VALID [2022-04-15 13:01:12,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {6684#false} ~cond := #in~cond; {6684#false} is VALID [2022-04-15 13:01:12,316 INFO L290 TraceCheckUtils]: 31: Hoare triple {6684#false} assume 0 == ~cond; {6684#false} is VALID [2022-04-15 13:01:12,316 INFO L290 TraceCheckUtils]: 32: Hoare triple {6684#false} assume !false; {6684#false} is VALID [2022-04-15 13:01:12,316 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:12,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:12,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382131295] [2022-04-15 13:01:12,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382131295] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:12,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452354805] [2022-04-15 13:01:12,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:01:12,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:12,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:12,320 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:12,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 13:01:12,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:01:12,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:01:12,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-15 13:01:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:12,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:12,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {6683#true} call ULTIMATE.init(); {6683#true} is VALID [2022-04-15 13:01:12,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {6683#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {6683#true} is VALID [2022-04-15 13:01:12,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {6683#true} assume true; {6683#true} is VALID [2022-04-15 13:01:12,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6683#true} {6683#true} #62#return; {6683#true} is VALID [2022-04-15 13:01:12,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {6683#true} call #t~ret5 := main(); {6683#true} is VALID [2022-04-15 13:01:12,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {6683#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {6683#true} is VALID [2022-04-15 13:01:12,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {6683#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {6688#(= main_~i~0 0)} is VALID [2022-04-15 13:01:12,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {6688#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6689#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:01:12,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {6689#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6690#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:01:12,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {6690#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6691#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:01:12,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {6691#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6692#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:01:12,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {6692#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6693#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:01:12,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {6693#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6694#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:01:12,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {6694#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6695#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:01:12,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {6695#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6696#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:01:12,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {6696#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6697#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:01:12,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {6697#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6698#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:01:12,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {6698#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6699#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:01:12,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {6699#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6700#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:01:12,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {6700#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6701#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:01:12,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {6701#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6702#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:01:12,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {6702#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6703#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:01:12,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {6703#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6704#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:01:12,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {6704#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6705#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:01:12,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {6705#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6706#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:01:12,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {6706#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6787#(and (<= 78 main_~j~0) (<= main_~j~0 78))} is VALID [2022-04-15 13:01:12,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {6787#(and (<= 78 main_~j~0) (<= main_~j~0 78))} assume !(~i~0 < ~n~0); {6787#(and (<= 78 main_~j~0) (<= main_~j~0 78))} is VALID [2022-04-15 13:01:12,757 INFO L290 TraceCheckUtils]: 27: Hoare triple {6787#(and (<= 78 main_~j~0) (<= main_~j~0 78))} ~k~0 := ~i~0; {6787#(and (<= 78 main_~j~0) (<= main_~j~0 78))} is VALID [2022-04-15 13:01:12,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {6787#(and (<= 78 main_~j~0) (<= main_~j~0 78))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {6684#false} is VALID [2022-04-15 13:01:12,758 INFO L272 TraceCheckUtils]: 29: Hoare triple {6684#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {6684#false} is VALID [2022-04-15 13:01:12,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {6684#false} ~cond := #in~cond; {6684#false} is VALID [2022-04-15 13:01:12,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {6684#false} assume 0 == ~cond; {6684#false} is VALID [2022-04-15 13:01:12,758 INFO L290 TraceCheckUtils]: 32: Hoare triple {6684#false} assume !false; {6684#false} is VALID [2022-04-15 13:01:12,758 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:12,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:12,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {6684#false} assume !false; {6684#false} is VALID [2022-04-15 13:01:12,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {6684#false} assume 0 == ~cond; {6684#false} is VALID [2022-04-15 13:01:12,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {6684#false} ~cond := #in~cond; {6684#false} is VALID [2022-04-15 13:01:12,898 INFO L272 TraceCheckUtils]: 29: Hoare triple {6684#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {6684#false} is VALID [2022-04-15 13:01:12,899 INFO L290 TraceCheckUtils]: 28: Hoare triple {6821#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {6684#false} is VALID [2022-04-15 13:01:12,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {6821#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {6821#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:12,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {6821#(= (mod main_~j~0 2) 0)} assume !(~i~0 < ~n~0); {6821#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:12,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {6831#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6821#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:12,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {6831#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6831#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:12,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {6831#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6831#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:12,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {6831#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6831#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:12,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {6831#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6831#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:12,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {6831#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6831#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:12,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {6831#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6831#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:12,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {6831#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6831#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:12,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {6831#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6831#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:12,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {6831#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6831#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:12,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {6831#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6831#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:12,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {6831#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6831#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:12,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {6831#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6831#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:12,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {6831#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6831#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:12,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {6831#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6831#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:12,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {6831#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6831#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:12,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {6831#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6831#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:12,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {6831#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6831#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:12,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {6831#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {6831#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:12,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {6683#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {6831#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:12,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {6683#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {6683#true} is VALID [2022-04-15 13:01:12,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {6683#true} call #t~ret5 := main(); {6683#true} is VALID [2022-04-15 13:01:12,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6683#true} {6683#true} #62#return; {6683#true} is VALID [2022-04-15 13:01:12,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {6683#true} assume true; {6683#true} is VALID [2022-04-15 13:01:12,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {6683#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {6683#true} is VALID [2022-04-15 13:01:12,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {6683#true} call ULTIMATE.init(); {6683#true} is VALID [2022-04-15 13:01:12,930 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-04-15 13:01:12,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452354805] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:12,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:12,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 4] total 26 [2022-04-15 13:01:12,930 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:12,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1552288769] [2022-04-15 13:01:12,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1552288769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:12,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:12,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 13:01:12,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548346918] [2022-04-15 13:01:12,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:12,931 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 33 [2022-04-15 13:01:12,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:12,931 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-15 13:01:12,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:12,958 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 13:01:12,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:12,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 13:01:12,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2022-04-15 13:01:12,959 INFO L87 Difference]: Start difference. First operand 34 states and 34 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-15 13:01:14,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:14,826 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 13:01:14,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 13:01:14,827 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 33 [2022-04-15 13:01:14,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:14,827 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-15 13:01:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 42 transitions. [2022-04-15 13:01:14,828 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-15 13:01:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 42 transitions. [2022-04-15 13:01:14,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 42 transitions. [2022-04-15 13:01:14,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:14,870 INFO L225 Difference]: With dead ends: 42 [2022-04-15 13:01:14,870 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 13:01:14,871 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=1899, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 13:01:14,871 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:14,871 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 116 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 13:01:14,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 13:01:14,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 13:01:14,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:14,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:14,903 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:14,903 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:14,904 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 13:01:14,904 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 13:01:14,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:14,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:14,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 13:01:14,904 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 13:01:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:14,904 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 13:01:14,905 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 13:01:14,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:14,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:14,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:14,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:14,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:14,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-15 13:01:14,905 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2022-04-15 13:01:14,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:14,905 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-15 13:01:14,906 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-15 13:01:14,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-15 13:01:14,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:14,956 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 13:01:14,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 13:01:14,956 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:14,956 INFO L499 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:14,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 13:01:15,157 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:15,157 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:15,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:15,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1308205647, now seen corresponding path program 39 times [2022-04-15 13:01:15,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:15,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [241730504] [2022-04-15 13:01:15,338 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:01:15,339 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:01:15,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1308205647, now seen corresponding path program 40 times [2022-04-15 13:01:15,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:15,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752948329] [2022-04-15 13:01:15,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:15,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:15,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:15,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {7199#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {7173#true} is VALID [2022-04-15 13:01:15,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {7173#true} assume true; {7173#true} is VALID [2022-04-15 13:01:15,716 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7173#true} {7173#true} #62#return; {7173#true} is VALID [2022-04-15 13:01:15,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {7173#true} call ULTIMATE.init(); {7199#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:15,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {7199#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {7173#true} is VALID [2022-04-15 13:01:15,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {7173#true} assume true; {7173#true} is VALID [2022-04-15 13:01:15,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7173#true} {7173#true} #62#return; {7173#true} is VALID [2022-04-15 13:01:15,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {7173#true} call #t~ret5 := main(); {7173#true} is VALID [2022-04-15 13:01:15,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {7173#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {7173#true} is VALID [2022-04-15 13:01:15,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {7173#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {7178#(= main_~i~0 0)} is VALID [2022-04-15 13:01:15,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {7178#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7179#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:01:15,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {7179#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7180#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:01:15,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {7180#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7181#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:01:15,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {7181#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7182#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:01:15,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {7182#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7183#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:01:15,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {7183#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7184#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:01:15,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {7184#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7185#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:01:15,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {7185#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7186#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:01:15,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {7186#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7187#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:01:15,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {7187#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7188#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:01:15,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {7188#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7189#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:01:15,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {7189#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7190#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:01:15,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {7190#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7191#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:01:15,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {7191#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7192#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:01:15,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {7192#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7193#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:01:15,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {7193#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7194#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:01:15,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {7194#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7195#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:01:15,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {7195#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7196#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:01:15,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {7196#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7197#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:01:15,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {7197#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7198#(and (not (<= (div main_~j~0 2) 40)) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:15,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {7198#(and (not (<= (div main_~j~0 2) 40)) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(~i~0 < ~n~0); {7198#(and (not (<= (div main_~j~0 2) 40)) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:15,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {7198#(and (not (<= (div main_~j~0 2) 40)) (<= main_~j~0 (* 2 (div main_~j~0 2))))} ~k~0 := ~i~0; {7198#(and (not (<= (div main_~j~0 2) 40)) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:15,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {7198#(and (not (<= (div main_~j~0 2) 40)) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {7174#false} is VALID [2022-04-15 13:01:15,752 INFO L272 TraceCheckUtils]: 30: Hoare triple {7174#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {7174#false} is VALID [2022-04-15 13:01:15,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {7174#false} ~cond := #in~cond; {7174#false} is VALID [2022-04-15 13:01:15,753 INFO L290 TraceCheckUtils]: 32: Hoare triple {7174#false} assume 0 == ~cond; {7174#false} is VALID [2022-04-15 13:01:15,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {7174#false} assume !false; {7174#false} is VALID [2022-04-15 13:01:15,753 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:15,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:15,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752948329] [2022-04-15 13:01:15,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752948329] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:15,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737545551] [2022-04-15 13:01:15,754 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:01:15,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:15,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:15,755 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:15,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 13:01:15,798 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:01:15,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:01:15,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-15 13:01:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:15,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:16,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {7173#true} call ULTIMATE.init(); {7173#true} is VALID [2022-04-15 13:01:16,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {7173#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {7173#true} is VALID [2022-04-15 13:01:16,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {7173#true} assume true; {7173#true} is VALID [2022-04-15 13:01:16,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7173#true} {7173#true} #62#return; {7173#true} is VALID [2022-04-15 13:01:16,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {7173#true} call #t~ret5 := main(); {7173#true} is VALID [2022-04-15 13:01:16,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {7173#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {7173#true} is VALID [2022-04-15 13:01:16,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {7173#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {7178#(= main_~i~0 0)} is VALID [2022-04-15 13:01:16,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {7178#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7179#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:01:16,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {7179#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7180#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:01:16,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {7180#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7181#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:01:16,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {7181#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7182#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:01:16,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {7182#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7183#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:01:16,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {7183#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7184#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:01:16,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {7184#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7185#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:01:16,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {7185#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7186#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:01:16,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {7186#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7187#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:01:16,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {7187#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7188#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:01:16,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {7188#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7189#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:01:16,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {7189#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7190#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:01:16,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {7190#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7191#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:01:16,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {7191#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7192#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:01:16,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {7192#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7193#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:01:16,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {7193#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7194#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:01:16,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {7194#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7195#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:01:16,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {7195#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7196#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:01:16,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {7196#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7197#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:01:16,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {7197#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7281#(and (<= 82 main_~j~0) (<= main_~j~0 82))} is VALID [2022-04-15 13:01:16,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {7281#(and (<= 82 main_~j~0) (<= main_~j~0 82))} assume !(~i~0 < ~n~0); {7281#(and (<= 82 main_~j~0) (<= main_~j~0 82))} is VALID [2022-04-15 13:01:16,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {7281#(and (<= 82 main_~j~0) (<= main_~j~0 82))} ~k~0 := ~i~0; {7281#(and (<= 82 main_~j~0) (<= main_~j~0 82))} is VALID [2022-04-15 13:01:16,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {7281#(and (<= 82 main_~j~0) (<= main_~j~0 82))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {7174#false} is VALID [2022-04-15 13:01:16,207 INFO L272 TraceCheckUtils]: 30: Hoare triple {7174#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {7174#false} is VALID [2022-04-15 13:01:16,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {7174#false} ~cond := #in~cond; {7174#false} is VALID [2022-04-15 13:01:16,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {7174#false} assume 0 == ~cond; {7174#false} is VALID [2022-04-15 13:01:16,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {7174#false} assume !false; {7174#false} is VALID [2022-04-15 13:01:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:16,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:16,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {7174#false} assume !false; {7174#false} is VALID [2022-04-15 13:01:16,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {7174#false} assume 0 == ~cond; {7174#false} is VALID [2022-04-15 13:01:16,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {7174#false} ~cond := #in~cond; {7174#false} is VALID [2022-04-15 13:01:16,386 INFO L272 TraceCheckUtils]: 30: Hoare triple {7174#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {7174#false} is VALID [2022-04-15 13:01:16,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {7315#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {7174#false} is VALID [2022-04-15 13:01:16,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {7315#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {7315#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:16,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {7315#(= (mod main_~j~0 2) 0)} assume !(~i~0 < ~n~0); {7315#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:16,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {7325#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7315#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:16,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {7325#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7325#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:16,394 INFO L290 TraceCheckUtils]: 24: Hoare triple {7325#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7325#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:16,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {7325#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7325#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:16,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {7325#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7325#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:16,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {7325#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7325#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:16,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {7325#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7325#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:16,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {7325#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7325#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:16,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {7325#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7325#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:16,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {7325#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7325#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:16,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {7325#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7325#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:16,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {7325#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7325#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:16,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {7325#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7325#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:16,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {7325#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7325#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:16,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {7325#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7325#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:16,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {7325#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7325#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:16,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {7325#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7325#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:16,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {7325#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7325#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:16,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {7325#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7325#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:16,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {7325#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7325#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:16,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {7173#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {7325#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:16,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {7173#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {7173#true} is VALID [2022-04-15 13:01:16,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {7173#true} call #t~ret5 := main(); {7173#true} is VALID [2022-04-15 13:01:16,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7173#true} {7173#true} #62#return; {7173#true} is VALID [2022-04-15 13:01:16,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {7173#true} assume true; {7173#true} is VALID [2022-04-15 13:01:16,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {7173#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {7173#true} is VALID [2022-04-15 13:01:16,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {7173#true} call ULTIMATE.init(); {7173#true} is VALID [2022-04-15 13:01:16,423 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-15 13:01:16,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737545551] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:16,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:16,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 4] total 27 [2022-04-15 13:01:16,423 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:16,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [241730504] [2022-04-15 13:01:16,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [241730504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:16,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:16,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 13:01:16,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288871002] [2022-04-15 13:01:16,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:16,424 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 34 [2022-04-15 13:01:16,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:16,424 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-15 13:01:16,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:16,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 13:01:16,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:16,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 13:01:16,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2022-04-15 13:01:16,452 INFO L87 Difference]: Start difference. First operand 35 states and 35 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-15 13:01:18,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:18,605 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 13:01:18,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 13:01:18,605 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 34 [2022-04-15 13:01:18,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:18,606 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-15 13:01:18,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 43 transitions. [2022-04-15 13:01:18,607 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-15 13:01:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 43 transitions. [2022-04-15 13:01:18,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 43 transitions. [2022-04-15 13:01:18,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:18,665 INFO L225 Difference]: With dead ends: 43 [2022-04-15 13:01:18,665 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 13:01:18,666 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=2077, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 13:01:18,666 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:18,667 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 121 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 13:01:18,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 13:01:18,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 13:01:18,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:18,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:18,697 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:18,697 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:18,698 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 13:01:18,698 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 13:01:18,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:18,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:18,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 13:01:18,698 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 13:01:18,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:18,699 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 13:01:18,699 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 13:01:18,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:18,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:18,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:18,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:18,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-04-15 13:01:18,700 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2022-04-15 13:01:18,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:18,700 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-04-15 13:01:18,700 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-15 13:01:18,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2022-04-15 13:01:18,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 13:01:18,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 13:01:18,756 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:18,756 INFO L499 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:18,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 13:01:18,956 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,SelfDestructingSolverStorable21 [2022-04-15 13:01:18,957 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:18,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:18,958 INFO L85 PathProgramCache]: Analyzing trace with hash 332729214, now seen corresponding path program 41 times [2022-04-15 13:01:18,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:18,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [772111608] [2022-04-15 13:01:19,160 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:01:19,161 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:01:19,161 INFO L85 PathProgramCache]: Analyzing trace with hash 332729214, now seen corresponding path program 42 times [2022-04-15 13:01:19,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:19,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584469145] [2022-04-15 13:01:19,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:19,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:19,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:19,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {7705#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {7678#true} is VALID [2022-04-15 13:01:19,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {7678#true} assume true; {7678#true} is VALID [2022-04-15 13:01:19,644 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7678#true} {7678#true} #62#return; {7678#true} is VALID [2022-04-15 13:01:19,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {7678#true} call ULTIMATE.init(); {7705#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:19,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {7705#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {7678#true} is VALID [2022-04-15 13:01:19,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {7678#true} assume true; {7678#true} is VALID [2022-04-15 13:01:19,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7678#true} {7678#true} #62#return; {7678#true} is VALID [2022-04-15 13:01:19,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {7678#true} call #t~ret5 := main(); {7678#true} is VALID [2022-04-15 13:01:19,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {7678#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {7678#true} is VALID [2022-04-15 13:01:19,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {7678#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {7683#(= main_~i~0 0)} is VALID [2022-04-15 13:01:19,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {7683#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7684#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:01:19,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {7684#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7685#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:01:19,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {7685#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7686#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:01:19,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {7686#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7687#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:01:19,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {7687#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7688#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:01:19,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {7688#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7689#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:01:19,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {7689#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7690#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:01:19,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {7690#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7691#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:01:19,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {7691#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7692#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:01:19,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {7692#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7693#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:01:19,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {7693#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7694#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:01:19,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {7694#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7695#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:01:19,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {7695#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7696#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:01:19,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {7696#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7697#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:01:19,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {7697#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7698#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:01:19,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {7698#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7699#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:01:19,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {7699#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7700#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:01:19,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {7700#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7701#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:01:19,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {7701#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7702#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:01:19,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {7702#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7703#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:01:19,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {7703#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7704#(and (<= 86 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:19,681 INFO L290 TraceCheckUtils]: 28: Hoare triple {7704#(and (<= 86 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(~i~0 < ~n~0); {7704#(and (<= 86 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:19,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {7704#(and (<= 86 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} ~k~0 := ~i~0; {7704#(and (<= 86 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:19,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {7704#(and (<= 86 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {7679#false} is VALID [2022-04-15 13:01:19,683 INFO L272 TraceCheckUtils]: 31: Hoare triple {7679#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {7679#false} is VALID [2022-04-15 13:01:19,683 INFO L290 TraceCheckUtils]: 32: Hoare triple {7679#false} ~cond := #in~cond; {7679#false} is VALID [2022-04-15 13:01:19,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {7679#false} assume 0 == ~cond; {7679#false} is VALID [2022-04-15 13:01:19,683 INFO L290 TraceCheckUtils]: 34: Hoare triple {7679#false} assume !false; {7679#false} is VALID [2022-04-15 13:01:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:19,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:19,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584469145] [2022-04-15 13:01:19,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584469145] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:19,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638191737] [2022-04-15 13:01:19,684 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:01:19,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:19,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:19,685 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:19,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 13:01:19,740 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-15 13:01:19,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:01:19,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-15 13:01:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:19,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:20,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {7678#true} call ULTIMATE.init(); {7678#true} is VALID [2022-04-15 13:01:20,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {7678#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {7678#true} is VALID [2022-04-15 13:01:20,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {7678#true} assume true; {7678#true} is VALID [2022-04-15 13:01:20,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7678#true} {7678#true} #62#return; {7678#true} is VALID [2022-04-15 13:01:20,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {7678#true} call #t~ret5 := main(); {7678#true} is VALID [2022-04-15 13:01:20,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {7678#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {7678#true} is VALID [2022-04-15 13:01:20,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {7678#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {7683#(= main_~i~0 0)} is VALID [2022-04-15 13:01:20,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {7683#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7730#(and (< 0 main_~n~0) (= main_~i~0 4))} is VALID [2022-04-15 13:01:20,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {7730#(and (< 0 main_~n~0) (= main_~i~0 4))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7734#(and (< 0 main_~n~0) (= main_~i~0 8))} is VALID [2022-04-15 13:01:20,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {7734#(and (< 0 main_~n~0) (= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7738#(and (< 0 main_~n~0) (= main_~i~0 12))} is VALID [2022-04-15 13:01:20,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {7738#(and (< 0 main_~n~0) (= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7742#(and (< 0 main_~n~0) (= 12 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:01:20,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {7742#(and (< 0 main_~n~0) (= 12 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7746#(and (< 0 main_~n~0) (= main_~i~0 20))} is VALID [2022-04-15 13:01:20,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {7746#(and (< 0 main_~n~0) (= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7750#(and (< 0 main_~n~0) (= main_~i~0 24))} is VALID [2022-04-15 13:01:20,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {7750#(and (< 0 main_~n~0) (= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7754#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 4)) 24))} is VALID [2022-04-15 13:01:20,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {7754#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 4)) 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7758#(and (< 0 main_~n~0) (= 32 main_~i~0))} is VALID [2022-04-15 13:01:20,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {7758#(and (< 0 main_~n~0) (= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7762#(and (< 0 main_~n~0) (= 32 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:01:20,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {7762#(and (< 0 main_~n~0) (= 32 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7766#(and (< 0 main_~n~0) (= 32 (+ main_~i~0 (- 8))))} is VALID [2022-04-15 13:01:20,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {7766#(and (< 0 main_~n~0) (= 32 (+ main_~i~0 (- 8))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7770#(and (< 0 main_~n~0) (= 32 (+ main_~i~0 (- 12))))} is VALID [2022-04-15 13:01:20,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {7770#(and (< 0 main_~n~0) (= 32 (+ main_~i~0 (- 12))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7774#(and (< 0 main_~n~0) (= main_~i~0 48))} is VALID [2022-04-15 13:01:20,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {7774#(and (< 0 main_~n~0) (= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7778#(and (< 0 main_~n~0) (= 48 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:01:20,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {7778#(and (< 0 main_~n~0) (= 48 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7782#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 8)) 48))} is VALID [2022-04-15 13:01:20,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {7782#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 8)) 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7786#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 12)) 48))} is VALID [2022-04-15 13:01:20,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {7786#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 12)) 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7790#(and (< 0 main_~n~0) (= (+ (- 16) main_~i~0) 48))} is VALID [2022-04-15 13:01:20,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {7790#(and (< 0 main_~n~0) (= (+ (- 16) main_~i~0) 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7794#(and (< 0 main_~n~0) (= 68 main_~i~0))} is VALID [2022-04-15 13:01:20,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {7794#(and (< 0 main_~n~0) (= 68 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7798#(and (< 0 main_~n~0) (= 72 main_~i~0))} is VALID [2022-04-15 13:01:20,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {7798#(and (< 0 main_~n~0) (= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7802#(and (< 0 main_~n~0) (= 72 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:01:20,489 INFO L290 TraceCheckUtils]: 26: Hoare triple {7802#(and (< 0 main_~n~0) (= 72 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7806#(and (< 0 main_~n~0) (= main_~i~0 80))} is VALID [2022-04-15 13:01:20,489 INFO L290 TraceCheckUtils]: 27: Hoare triple {7806#(and (< 0 main_~n~0) (= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7810#(and (< 0 main_~n~0) (= main_~j~0 (+ main_~i~0 2)) (= (+ main_~i~0 (- 4)) 80))} is VALID [2022-04-15 13:01:20,490 INFO L290 TraceCheckUtils]: 28: Hoare triple {7810#(and (< 0 main_~n~0) (= main_~j~0 (+ main_~i~0 2)) (= (+ main_~i~0 (- 4)) 80))} assume !(~i~0 < ~n~0); {7814#(= main_~j~0 86)} is VALID [2022-04-15 13:01:20,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {7814#(= main_~j~0 86)} ~k~0 := ~i~0; {7814#(= main_~j~0 86)} is VALID [2022-04-15 13:01:20,490 INFO L290 TraceCheckUtils]: 30: Hoare triple {7814#(= main_~j~0 86)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {7679#false} is VALID [2022-04-15 13:01:20,490 INFO L272 TraceCheckUtils]: 31: Hoare triple {7679#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {7679#false} is VALID [2022-04-15 13:01:20,491 INFO L290 TraceCheckUtils]: 32: Hoare triple {7679#false} ~cond := #in~cond; {7679#false} is VALID [2022-04-15 13:01:20,491 INFO L290 TraceCheckUtils]: 33: Hoare triple {7679#false} assume 0 == ~cond; {7679#false} is VALID [2022-04-15 13:01:20,491 INFO L290 TraceCheckUtils]: 34: Hoare triple {7679#false} assume !false; {7679#false} is VALID [2022-04-15 13:01:20,491 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:20,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:22,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {7679#false} assume !false; {7679#false} is VALID [2022-04-15 13:01:22,312 INFO L290 TraceCheckUtils]: 33: Hoare triple {7679#false} assume 0 == ~cond; {7679#false} is VALID [2022-04-15 13:01:22,312 INFO L290 TraceCheckUtils]: 32: Hoare triple {7679#false} ~cond := #in~cond; {7679#false} is VALID [2022-04-15 13:01:22,312 INFO L272 TraceCheckUtils]: 31: Hoare triple {7679#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {7679#false} is VALID [2022-04-15 13:01:22,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {7845#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {7679#false} is VALID [2022-04-15 13:01:22,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {7845#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {7845#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:22,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {7852#(or (< main_~i~0 main_~n~0) (= (mod main_~j~0 2) 0))} assume !(~i~0 < ~n~0); {7845#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:22,317 INFO L290 TraceCheckUtils]: 27: Hoare triple {7856#(or (< (+ main_~i~0 4) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7852#(or (< main_~i~0 main_~n~0) (= (mod main_~j~0 2) 0))} is VALID [2022-04-15 13:01:22,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {7860#(or (< (+ main_~i~0 8) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7856#(or (< (+ main_~i~0 4) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:01:22,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {7864#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 12) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7860#(or (< (+ main_~i~0 8) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:01:22,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {7868#(or (< (+ main_~i~0 16) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7864#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 12) main_~n~0))} is VALID [2022-04-15 13:01:22,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {7872#(or (< (+ main_~i~0 20) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7868#(or (< (+ main_~i~0 16) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:01:22,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {7876#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 24) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7872#(or (< (+ main_~i~0 20) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:01:22,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {7880#(or (< (+ main_~i~0 28) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7876#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 24) main_~n~0))} is VALID [2022-04-15 13:01:22,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {7884#(or (< (+ 32 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7880#(or (< (+ main_~i~0 28) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:01:22,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {7888#(or (< (+ main_~i~0 36) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7884#(or (< (+ 32 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:01:22,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {7892#(or (= 0 (mod main_~i~0 2)) (< (+ 40 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7888#(or (< (+ main_~i~0 36) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:01:22,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {7896#(or (= 0 (mod main_~i~0 2)) (< (+ 44 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7892#(or (= 0 (mod main_~i~0 2)) (< (+ 40 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:01:22,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {7900#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 48) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7896#(or (= 0 (mod main_~i~0 2)) (< (+ 44 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:01:22,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {7904#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 52) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7900#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 48) main_~n~0))} is VALID [2022-04-15 13:01:22,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {7908#(or (= 0 (mod main_~i~0 2)) (< (+ 56 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7904#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 52) main_~n~0))} is VALID [2022-04-15 13:01:22,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {7912#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 60) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7908#(or (= 0 (mod main_~i~0 2)) (< (+ 56 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:01:22,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {7916#(or (= 0 (mod main_~i~0 2)) (< (+ 64 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7912#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 60) main_~n~0))} is VALID [2022-04-15 13:01:22,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {7920#(or (= 0 (mod main_~i~0 2)) (< (+ 68 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7916#(or (= 0 (mod main_~i~0 2)) (< (+ 64 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:01:22,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {7924#(or (= 0 (mod main_~i~0 2)) (< (+ 72 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7920#(or (= 0 (mod main_~i~0 2)) (< (+ 68 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:01:22,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {7928#(or (< (+ 76 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7924#(or (= 0 (mod main_~i~0 2)) (< (+ 72 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:01:22,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {7932#(or (< (+ main_~i~0 80) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7928#(or (< (+ 76 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:01:22,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {7936#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {7932#(or (< (+ main_~i~0 80) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:01:22,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {7678#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {7936#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:22,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {7678#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {7678#true} is VALID [2022-04-15 13:01:22,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {7678#true} call #t~ret5 := main(); {7678#true} is VALID [2022-04-15 13:01:22,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7678#true} {7678#true} #62#return; {7678#true} is VALID [2022-04-15 13:01:22,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {7678#true} assume true; {7678#true} is VALID [2022-04-15 13:01:22,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {7678#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {7678#true} is VALID [2022-04-15 13:01:22,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {7678#true} call ULTIMATE.init(); {7678#true} is VALID [2022-04-15 13:01:22,351 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:22,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638191737] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:22,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:22,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 70 [2022-04-15 13:01:22,351 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:22,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [772111608] [2022-04-15 13:01:22,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [772111608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:22,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:22,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 13:01:22,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802788997] [2022-04-15 13:01:22,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:22,352 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 35 [2022-04-15 13:01:22,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:22,352 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-15 13:01:22,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:22,383 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 13:01:22,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:22,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 13:01:22,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=3571, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 13:01:22,384 INFO L87 Difference]: Start difference. First operand 36 states and 36 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-15 13:01:24,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:24,959 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 13:01:24,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 13:01:24,959 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 35 [2022-04-15 13:01:24,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:24,959 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-15 13:01:24,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. [2022-04-15 13:01:24,960 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-15 13:01:24,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. [2022-04-15 13:01:24,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 44 transitions. [2022-04-15 13:01:25,008 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-15 13:01:25,009 INFO L225 Difference]: With dead ends: 44 [2022-04-15 13:01:25,009 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 13:01:25,011 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1790, Invalid=6582, Unknown=0, NotChecked=0, Total=8372 [2022-04-15 13:01:25,011 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:25,011 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 126 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 13:01:25,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 13:01:25,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 13:01:25,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:25,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:25,041 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:25,041 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:25,042 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 13:01:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 13:01:25,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:25,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:25,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 13:01:25,042 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 13:01:25,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:25,043 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 13:01:25,043 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 13:01:25,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:25,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:25,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:25,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:25,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-15 13:01:25,044 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2022-04-15 13:01:25,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:25,045 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-15 13:01:25,045 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-15 13:01:25,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-15 13:01:25,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:25,101 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 13:01:25,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 13:01:25,101 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:25,102 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:25,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 13:01:25,302 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,SelfDestructingSolverStorable22 [2022-04-15 13:01:25,302 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:25,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:25,303 INFO L85 PathProgramCache]: Analyzing trace with hash -337897647, now seen corresponding path program 43 times [2022-04-15 13:01:25,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:25,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1901624307] [2022-04-15 13:01:25,509 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:01:25,509 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:01:25,509 INFO L85 PathProgramCache]: Analyzing trace with hash -337897647, now seen corresponding path program 44 times [2022-04-15 13:01:25,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:25,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254156484] [2022-04-15 13:01:25,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:25,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:25,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:25,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {8268#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {8240#true} is VALID [2022-04-15 13:01:25,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {8240#true} assume true; {8240#true} is VALID [2022-04-15 13:01:25,934 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8240#true} {8240#true} #62#return; {8240#true} is VALID [2022-04-15 13:01:25,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {8240#true} call ULTIMATE.init(); {8268#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:25,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {8268#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {8240#true} is VALID [2022-04-15 13:01:25,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {8240#true} assume true; {8240#true} is VALID [2022-04-15 13:01:25,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8240#true} {8240#true} #62#return; {8240#true} is VALID [2022-04-15 13:01:25,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {8240#true} call #t~ret5 := main(); {8240#true} is VALID [2022-04-15 13:01:25,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {8240#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {8240#true} is VALID [2022-04-15 13:01:25,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {8240#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {8245#(= main_~i~0 0)} is VALID [2022-04-15 13:01:25,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {8245#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8246#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:01:25,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {8246#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8247#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:01:25,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {8247#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8248#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:01:25,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {8248#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8249#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:01:25,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {8249#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8250#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:01:25,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {8250#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8251#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:01:25,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {8251#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8252#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:01:25,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {8252#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8253#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:01:25,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {8253#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8254#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:01:25,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {8254#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8255#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:01:25,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {8255#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8256#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:01:25,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {8256#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8257#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:01:25,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {8257#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8258#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:01:25,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {8258#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8259#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:01:25,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {8259#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8260#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:01:25,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {8260#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8261#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:01:25,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {8261#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8262#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:01:25,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {8262#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8263#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:01:25,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {8263#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8264#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:01:25,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {8264#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8265#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:01:25,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {8265#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8266#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:01:25,973 INFO L290 TraceCheckUtils]: 28: Hoare triple {8266#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8267#(and (not (<= (div main_~j~0 2) 44)) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:25,973 INFO L290 TraceCheckUtils]: 29: Hoare triple {8267#(and (not (<= (div main_~j~0 2) 44)) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(~i~0 < ~n~0); {8267#(and (not (<= (div main_~j~0 2) 44)) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:25,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {8267#(and (not (<= (div main_~j~0 2) 44)) (<= main_~j~0 (* 2 (div main_~j~0 2))))} ~k~0 := ~i~0; {8267#(and (not (<= (div main_~j~0 2) 44)) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:25,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {8267#(and (not (<= (div main_~j~0 2) 44)) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {8241#false} is VALID [2022-04-15 13:01:25,974 INFO L272 TraceCheckUtils]: 32: Hoare triple {8241#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {8241#false} is VALID [2022-04-15 13:01:25,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {8241#false} ~cond := #in~cond; {8241#false} is VALID [2022-04-15 13:01:25,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {8241#false} assume 0 == ~cond; {8241#false} is VALID [2022-04-15 13:01:25,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {8241#false} assume !false; {8241#false} is VALID [2022-04-15 13:01:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:25,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:25,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254156484] [2022-04-15 13:01:25,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254156484] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:25,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647023618] [2022-04-15 13:01:25,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:01:25,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:25,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:25,976 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:25,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 13:01:26,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:01:26,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:01:26,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-15 13:01:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:26,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:26,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {8240#true} call ULTIMATE.init(); {8240#true} is VALID [2022-04-15 13:01:26,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {8240#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {8240#true} is VALID [2022-04-15 13:01:26,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {8240#true} assume true; {8240#true} is VALID [2022-04-15 13:01:26,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8240#true} {8240#true} #62#return; {8240#true} is VALID [2022-04-15 13:01:26,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {8240#true} call #t~ret5 := main(); {8240#true} is VALID [2022-04-15 13:01:26,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {8240#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {8240#true} is VALID [2022-04-15 13:01:26,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {8240#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {8245#(= main_~i~0 0)} is VALID [2022-04-15 13:01:26,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {8245#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8246#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:01:26,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {8246#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8247#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:01:26,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {8247#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8248#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:01:26,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {8248#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8249#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:01:26,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {8249#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8250#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:01:26,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {8250#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8251#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:01:26,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {8251#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8252#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:01:26,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {8252#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8253#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:01:26,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {8253#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8254#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:01:26,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {8254#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8255#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:01:26,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {8255#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8256#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:01:26,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {8256#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8257#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:01:26,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {8257#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8258#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:01:26,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {8258#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8259#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:01:26,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {8259#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8260#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:01:26,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {8260#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8261#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:01:26,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {8261#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8262#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:01:26,438 INFO L290 TraceCheckUtils]: 24: Hoare triple {8262#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8263#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:01:26,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {8263#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8264#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:01:26,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {8264#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8265#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:01:26,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {8265#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8266#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:01:26,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {8266#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8356#(and (<= main_~j~0 90) (<= 90 main_~j~0))} is VALID [2022-04-15 13:01:26,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {8356#(and (<= main_~j~0 90) (<= 90 main_~j~0))} assume !(~i~0 < ~n~0); {8356#(and (<= main_~j~0 90) (<= 90 main_~j~0))} is VALID [2022-04-15 13:01:26,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {8356#(and (<= main_~j~0 90) (<= 90 main_~j~0))} ~k~0 := ~i~0; {8356#(and (<= main_~j~0 90) (<= 90 main_~j~0))} is VALID [2022-04-15 13:01:26,446 INFO L290 TraceCheckUtils]: 31: Hoare triple {8356#(and (<= main_~j~0 90) (<= 90 main_~j~0))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {8241#false} is VALID [2022-04-15 13:01:26,446 INFO L272 TraceCheckUtils]: 32: Hoare triple {8241#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {8241#false} is VALID [2022-04-15 13:01:26,446 INFO L290 TraceCheckUtils]: 33: Hoare triple {8241#false} ~cond := #in~cond; {8241#false} is VALID [2022-04-15 13:01:26,446 INFO L290 TraceCheckUtils]: 34: Hoare triple {8241#false} assume 0 == ~cond; {8241#false} is VALID [2022-04-15 13:01:26,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {8241#false} assume !false; {8241#false} is VALID [2022-04-15 13:01:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:26,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:26,609 INFO L290 TraceCheckUtils]: 35: Hoare triple {8241#false} assume !false; {8241#false} is VALID [2022-04-15 13:01:26,609 INFO L290 TraceCheckUtils]: 34: Hoare triple {8241#false} assume 0 == ~cond; {8241#false} is VALID [2022-04-15 13:01:26,609 INFO L290 TraceCheckUtils]: 33: Hoare triple {8241#false} ~cond := #in~cond; {8241#false} is VALID [2022-04-15 13:01:26,609 INFO L272 TraceCheckUtils]: 32: Hoare triple {8241#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {8241#false} is VALID [2022-04-15 13:01:26,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {8390#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {8241#false} is VALID [2022-04-15 13:01:26,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {8390#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {8390#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:26,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {8390#(= (mod main_~j~0 2) 0)} assume !(~i~0 < ~n~0); {8390#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:26,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8390#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:26,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {8400#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {8240#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {8400#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:26,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {8240#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {8240#true} is VALID [2022-04-15 13:01:26,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {8240#true} call #t~ret5 := main(); {8240#true} is VALID [2022-04-15 13:01:26,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8240#true} {8240#true} #62#return; {8240#true} is VALID [2022-04-15 13:01:26,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {8240#true} assume true; {8240#true} is VALID [2022-04-15 13:01:26,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {8240#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {8240#true} is VALID [2022-04-15 13:01:26,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {8240#true} call ULTIMATE.init(); {8240#true} is VALID [2022-04-15 13:01:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-04-15 13:01:26,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647023618] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:26,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:26,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 4] total 29 [2022-04-15 13:01:26,657 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:26,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1901624307] [2022-04-15 13:01:26,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1901624307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:26,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:26,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 13:01:26,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549097369] [2022-04-15 13:01:26,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:26,657 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 36 [2022-04-15 13:01:26,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:26,658 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-15 13:01:26,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:26,687 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 13:01:26,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:26,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 13:01:26,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2022-04-15 13:01:26,688 INFO L87 Difference]: Start difference. First operand 37 states and 37 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-15 13:01:29,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:29,546 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 13:01:29,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 13:01:29,547 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 36 [2022-04-15 13:01:29,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:29,547 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-15 13:01:29,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2022-04-15 13:01:29,548 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-15 13:01:29,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2022-04-15 13:01:29,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 45 transitions. [2022-04-15 13:01:29,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:29,619 INFO L225 Difference]: With dead ends: 45 [2022-04-15 13:01:29,619 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 13:01:29,620 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=2457, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 13:01:29,620 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:29,621 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 131 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 13:01:29,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 13:01:29,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 13:01:29,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:29,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:29,653 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:29,653 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:29,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:29,653 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 13:01:29,654 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 13:01:29,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:29,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:29,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 13:01:29,654 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 13:01:29,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:29,655 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 13:01:29,655 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 13:01:29,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:29,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:29,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:29,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:29,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-04-15 13:01:29,656 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2022-04-15 13:01:29,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:29,656 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-04-15 13:01:29,656 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-15 13:01:29,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2022-04-15 13:01:29,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:29,746 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 13:01:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 13:01:29,746 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:29,746 INFO L499 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:29,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 13:01:29,947 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:29,947 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:29,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:29,947 INFO L85 PathProgramCache]: Analyzing trace with hash 347506142, now seen corresponding path program 45 times [2022-04-15 13:01:29,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:29,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [881717423] [2022-04-15 13:01:30,154 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:01:30,154 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:01:30,154 INFO L85 PathProgramCache]: Analyzing trace with hash 347506142, now seen corresponding path program 46 times [2022-04-15 13:01:30,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:30,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480486013] [2022-04-15 13:01:30,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:30,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:30,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:30,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {8804#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {8775#true} is VALID [2022-04-15 13:01:30,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {8775#true} assume true; {8775#true} is VALID [2022-04-15 13:01:30,626 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8775#true} {8775#true} #62#return; {8775#true} is VALID [2022-04-15 13:01:30,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {8775#true} call ULTIMATE.init(); {8804#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:30,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {8804#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {8775#true} is VALID [2022-04-15 13:01:30,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {8775#true} assume true; {8775#true} is VALID [2022-04-15 13:01:30,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8775#true} {8775#true} #62#return; {8775#true} is VALID [2022-04-15 13:01:30,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {8775#true} call #t~ret5 := main(); {8775#true} is VALID [2022-04-15 13:01:30,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {8775#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {8775#true} is VALID [2022-04-15 13:01:30,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {8775#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {8780#(= main_~i~0 0)} is VALID [2022-04-15 13:01:30,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {8780#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8781#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:01:30,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {8781#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8782#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:01:30,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {8782#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8783#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:01:30,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {8783#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8784#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:01:30,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {8784#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8785#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:01:30,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {8785#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8786#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:01:30,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {8786#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8787#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:01:30,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {8787#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8788#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:01:30,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {8788#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8789#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:01:30,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {8789#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8790#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:01:30,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {8790#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8791#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:01:30,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {8791#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8792#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:01:30,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {8792#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8793#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:01:30,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {8793#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8794#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:01:30,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {8794#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8795#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:01:30,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {8795#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8796#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:01:30,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {8796#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8797#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:01:30,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {8797#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8798#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:01:30,664 INFO L290 TraceCheckUtils]: 25: Hoare triple {8798#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8799#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:01:30,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {8799#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8800#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:01:30,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {8800#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8801#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:01:30,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {8801#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8802#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:01:30,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {8802#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8803#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:01:30,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {8803#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {8803#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:01:30,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {8803#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {8803#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:01:30,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {8803#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {8776#false} is VALID [2022-04-15 13:01:30,673 INFO L272 TraceCheckUtils]: 33: Hoare triple {8776#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {8776#false} is VALID [2022-04-15 13:01:30,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {8776#false} ~cond := #in~cond; {8776#false} is VALID [2022-04-15 13:01:30,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {8776#false} assume 0 == ~cond; {8776#false} is VALID [2022-04-15 13:01:30,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {8776#false} assume !false; {8776#false} is VALID [2022-04-15 13:01:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:30,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:30,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480486013] [2022-04-15 13:01:30,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480486013] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:30,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484777343] [2022-04-15 13:01:30,674 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:01:30,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:30,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:30,675 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:30,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 13:01:30,714 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:01:30,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:01:30,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-15 13:01:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:30,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:31,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {8775#true} call ULTIMATE.init(); {8775#true} is VALID [2022-04-15 13:01:31,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {8775#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {8775#true} is VALID [2022-04-15 13:01:31,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {8775#true} assume true; {8775#true} is VALID [2022-04-15 13:01:31,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8775#true} {8775#true} #62#return; {8775#true} is VALID [2022-04-15 13:01:31,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {8775#true} call #t~ret5 := main(); {8775#true} is VALID [2022-04-15 13:01:31,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {8775#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {8775#true} is VALID [2022-04-15 13:01:31,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {8775#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {8780#(= main_~i~0 0)} is VALID [2022-04-15 13:01:31,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {8780#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8781#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:01:31,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {8781#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8782#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:01:31,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {8782#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8783#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:01:31,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {8783#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8784#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:01:31,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {8784#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8785#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:01:31,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {8785#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8786#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:01:31,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {8786#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8787#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:01:31,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {8787#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8788#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:01:31,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {8788#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8789#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:01:31,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {8789#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8790#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:01:31,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {8790#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8791#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:01:31,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {8791#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8792#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:01:31,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {8792#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8793#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:01:31,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {8793#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8794#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:01:31,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {8794#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8795#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:01:31,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {8795#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8796#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:01:31,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {8796#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8797#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:01:31,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {8797#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8798#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:01:31,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {8798#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8799#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:01:31,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {8799#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8800#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:01:31,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {8800#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8801#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:01:31,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {8801#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8802#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:01:31,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {8802#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8895#(and (<= main_~j~0 94) (<= 94 main_~j~0))} is VALID [2022-04-15 13:01:31,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {8895#(and (<= main_~j~0 94) (<= 94 main_~j~0))} assume !(~i~0 < ~n~0); {8895#(and (<= main_~j~0 94) (<= 94 main_~j~0))} is VALID [2022-04-15 13:01:31,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {8895#(and (<= main_~j~0 94) (<= 94 main_~j~0))} ~k~0 := ~i~0; {8895#(and (<= main_~j~0 94) (<= 94 main_~j~0))} is VALID [2022-04-15 13:01:31,134 INFO L290 TraceCheckUtils]: 32: Hoare triple {8895#(and (<= main_~j~0 94) (<= 94 main_~j~0))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {8776#false} is VALID [2022-04-15 13:01:31,134 INFO L272 TraceCheckUtils]: 33: Hoare triple {8776#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {8776#false} is VALID [2022-04-15 13:01:31,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {8776#false} ~cond := #in~cond; {8776#false} is VALID [2022-04-15 13:01:31,135 INFO L290 TraceCheckUtils]: 35: Hoare triple {8776#false} assume 0 == ~cond; {8776#false} is VALID [2022-04-15 13:01:31,135 INFO L290 TraceCheckUtils]: 36: Hoare triple {8776#false} assume !false; {8776#false} is VALID [2022-04-15 13:01:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:31,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:32,294 INFO L290 TraceCheckUtils]: 36: Hoare triple {8776#false} assume !false; {8776#false} is VALID [2022-04-15 13:01:32,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {8776#false} assume 0 == ~cond; {8776#false} is VALID [2022-04-15 13:01:32,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {8776#false} ~cond := #in~cond; {8776#false} is VALID [2022-04-15 13:01:32,295 INFO L272 TraceCheckUtils]: 33: Hoare triple {8776#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {8776#false} is VALID [2022-04-15 13:01:32,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {8803#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {8776#false} is VALID [2022-04-15 13:01:32,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {8803#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {8803#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:01:32,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {8803#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {8803#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:01:32,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8803#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:01:32,309 INFO L290 TraceCheckUtils]: 28: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,311 INFO L290 TraceCheckUtils]: 27: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {8775#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {8938#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:01:32,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {8775#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {8775#true} is VALID [2022-04-15 13:01:32,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {8775#true} call #t~ret5 := main(); {8775#true} is VALID [2022-04-15 13:01:32,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8775#true} {8775#true} #62#return; {8775#true} is VALID [2022-04-15 13:01:32,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {8775#true} assume true; {8775#true} is VALID [2022-04-15 13:01:32,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {8775#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {8775#true} is VALID [2022-04-15 13:01:32,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {8775#true} call ULTIMATE.init(); {8775#true} is VALID [2022-04-15 13:01:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-04-15 13:01:32,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484777343] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:32,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:32,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 4] total 29 [2022-04-15 13:01:32,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:32,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [881717423] [2022-04-15 13:01:32,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [881717423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:32,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:32,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 13:01:32,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931825272] [2022-04-15 13:01:32,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:32,363 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 37 [2022-04-15 13:01:32,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:32,363 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-15 13:01:32,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:32,398 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 13:01:32,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:32,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 13:01:32,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2022-04-15 13:01:32,399 INFO L87 Difference]: Start difference. First operand 38 states and 38 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-15 13:01:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:36,451 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 13:01:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 13:01:36,451 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 37 [2022-04-15 13:01:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:36,451 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-15 13:01:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2022-04-15 13:01:36,452 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-15 13:01:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2022-04-15 13:01:36,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 46 transitions. [2022-04-15 13:01:36,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:36,550 INFO L225 Difference]: With dead ends: 46 [2022-04-15 13:01:36,550 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 13:01:36,551 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 50 SyntacticMatches, 24 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=244, Invalid=2512, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 13:01:36,551 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:36,551 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 135 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 13:01:36,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 13:01:36,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 13:01:36,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:36,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:36,584 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:36,584 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:36,585 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 13:01:36,585 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 13:01:36,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:36,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:36,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 13:01:36,585 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 13:01:36,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:36,586 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 13:01:36,586 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 13:01:36,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:36,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:36,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:36,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-15 13:01:36,587 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2022-04-15 13:01:36,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:36,587 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-15 13:01:36,587 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-15 13:01:36,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-15 13:01:36,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:36,706 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 13:01:36,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 13:01:36,706 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:36,706 INFO L499 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:36,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 13:01:36,906 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:36,907 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:36,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:36,907 INFO L85 PathProgramCache]: Analyzing trace with hash 120187121, now seen corresponding path program 47 times [2022-04-15 13:01:36,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:36,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [9367078] [2022-04-15 13:01:37,166 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:01:37,166 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:01:37,166 INFO L85 PathProgramCache]: Analyzing trace with hash 120187121, now seen corresponding path program 48 times [2022-04-15 13:01:37,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:37,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986721097] [2022-04-15 13:01:37,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:37,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:37,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:37,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {9354#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {9324#true} is VALID [2022-04-15 13:01:37,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {9324#true} assume true; {9324#true} is VALID [2022-04-15 13:01:37,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9324#true} {9324#true} #62#return; {9324#true} is VALID [2022-04-15 13:01:37,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {9324#true} call ULTIMATE.init(); {9354#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:37,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {9354#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {9324#true} is VALID [2022-04-15 13:01:37,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {9324#true} assume true; {9324#true} is VALID [2022-04-15 13:01:37,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9324#true} {9324#true} #62#return; {9324#true} is VALID [2022-04-15 13:01:37,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {9324#true} call #t~ret5 := main(); {9324#true} is VALID [2022-04-15 13:01:37,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {9324#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {9324#true} is VALID [2022-04-15 13:01:37,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {9324#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {9329#(= main_~i~0 0)} is VALID [2022-04-15 13:01:37,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {9329#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9330#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:01:37,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {9330#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9331#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:01:37,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {9331#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9332#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:01:37,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {9332#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9333#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:01:37,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {9333#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9334#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:01:37,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {9334#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9335#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:01:37,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {9335#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9336#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:01:37,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {9336#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9337#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:01:37,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {9337#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9338#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:01:37,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {9338#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9339#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:01:37,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {9339#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9340#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:01:37,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {9340#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9341#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:01:37,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {9341#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9342#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:01:37,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {9342#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9343#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:01:37,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {9343#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9344#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:01:37,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {9344#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9345#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:01:37,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {9345#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9346#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:01:37,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {9346#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9347#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:01:37,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {9347#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9348#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:01:37,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {9348#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9349#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:01:37,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {9349#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9350#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:01:37,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {9350#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9351#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:01:37,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {9351#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9352#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:01:37,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {9352#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9353#(and (<= 98 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:37,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {9353#(and (<= 98 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(~i~0 < ~n~0); {9353#(and (<= 98 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:37,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {9353#(and (<= 98 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} ~k~0 := ~i~0; {9353#(and (<= 98 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:37,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {9353#(and (<= 98 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {9325#false} is VALID [2022-04-15 13:01:37,735 INFO L272 TraceCheckUtils]: 34: Hoare triple {9325#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {9325#false} is VALID [2022-04-15 13:01:37,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {9325#false} ~cond := #in~cond; {9325#false} is VALID [2022-04-15 13:01:37,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {9325#false} assume 0 == ~cond; {9325#false} is VALID [2022-04-15 13:01:37,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {9325#false} assume !false; {9325#false} is VALID [2022-04-15 13:01:37,736 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:37,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:37,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986721097] [2022-04-15 13:01:37,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986721097] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:37,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314050988] [2022-04-15 13:01:37,736 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:01:37,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:37,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:37,737 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:37,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 13:01:37,783 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-15 13:01:37,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:01:37,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-15 13:01:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:37,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:38,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {9324#true} call ULTIMATE.init(); {9324#true} is VALID [2022-04-15 13:01:38,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {9324#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {9324#true} is VALID [2022-04-15 13:01:38,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {9324#true} assume true; {9324#true} is VALID [2022-04-15 13:01:38,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9324#true} {9324#true} #62#return; {9324#true} is VALID [2022-04-15 13:01:38,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {9324#true} call #t~ret5 := main(); {9324#true} is VALID [2022-04-15 13:01:38,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {9324#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {9324#true} is VALID [2022-04-15 13:01:38,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {9324#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {9329#(= main_~i~0 0)} is VALID [2022-04-15 13:01:38,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {9329#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9379#(and (< 0 main_~n~0) (= main_~i~0 4))} is VALID [2022-04-15 13:01:38,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {9379#(and (< 0 main_~n~0) (= main_~i~0 4))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9383#(and (< 0 main_~n~0) (= main_~i~0 8))} is VALID [2022-04-15 13:01:38,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {9383#(and (< 0 main_~n~0) (= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9387#(and (< 0 main_~n~0) (= main_~i~0 12))} is VALID [2022-04-15 13:01:38,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {9387#(and (< 0 main_~n~0) (= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9391#(and (< 0 main_~n~0) (= main_~i~0 16))} is VALID [2022-04-15 13:01:38,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {9391#(and (< 0 main_~n~0) (= main_~i~0 16))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9395#(and (< 0 main_~n~0) (= 16 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:01:38,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {9395#(and (< 0 main_~n~0) (= 16 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9399#(and (< 0 main_~n~0) (= 16 (+ main_~i~0 (- 8))))} is VALID [2022-04-15 13:01:38,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {9399#(and (< 0 main_~n~0) (= 16 (+ main_~i~0 (- 8))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9403#(and (< 0 main_~n~0) (= main_~i~0 28))} is VALID [2022-04-15 13:01:38,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {9403#(and (< 0 main_~n~0) (= main_~i~0 28))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9407#(and (< 0 main_~n~0) (= 32 main_~i~0))} is VALID [2022-04-15 13:01:38,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {9407#(and (< 0 main_~n~0) (= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9411#(and (< 0 main_~n~0) (= 32 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:01:38,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {9411#(and (< 0 main_~n~0) (= 32 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9415#(and (< 0 main_~n~0) (= 40 main_~i~0))} is VALID [2022-04-15 13:01:38,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {9415#(and (< 0 main_~n~0) (= 40 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9419#(and (< 0 main_~n~0) (= 44 main_~i~0))} is VALID [2022-04-15 13:01:38,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {9419#(and (< 0 main_~n~0) (= 44 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9423#(and (< 0 main_~n~0) (= 44 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:01:38,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {9423#(and (< 0 main_~n~0) (= 44 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9427#(and (< 0 main_~n~0) (= main_~i~0 52))} is VALID [2022-04-15 13:01:38,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {9427#(and (< 0 main_~n~0) (= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9431#(and (< 0 main_~n~0) (= 56 main_~i~0))} is VALID [2022-04-15 13:01:38,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {9431#(and (< 0 main_~n~0) (= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9435#(and (< 0 main_~n~0) (= main_~i~0 60))} is VALID [2022-04-15 13:01:38,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {9435#(and (< 0 main_~n~0) (= main_~i~0 60))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9439#(and (< 0 main_~n~0) (= 64 main_~i~0))} is VALID [2022-04-15 13:01:38,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {9439#(and (< 0 main_~n~0) (= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9443#(and (< 0 main_~n~0) (= 68 main_~i~0))} is VALID [2022-04-15 13:01:38,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {9443#(and (< 0 main_~n~0) (= 68 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9447#(and (< 0 main_~n~0) (= 72 main_~i~0))} is VALID [2022-04-15 13:01:38,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {9447#(and (< 0 main_~n~0) (= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9451#(and (< 0 main_~n~0) (= 72 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:01:38,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {9451#(and (< 0 main_~n~0) (= 72 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9455#(and (< 0 main_~n~0) (= main_~i~0 80))} is VALID [2022-04-15 13:01:38,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {9455#(and (< 0 main_~n~0) (= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9459#(and (< 0 main_~n~0) (= 84 main_~i~0))} is VALID [2022-04-15 13:01:38,662 INFO L290 TraceCheckUtils]: 28: Hoare triple {9459#(and (< 0 main_~n~0) (= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9463#(and (< 0 main_~n~0) (= 88 main_~i~0))} is VALID [2022-04-15 13:01:38,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {9463#(and (< 0 main_~n~0) (= 88 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9467#(and (< 0 main_~n~0) (= 88 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:01:38,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {9467#(and (< 0 main_~n~0) (= 88 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9471#(and (< 0 main_~n~0) (= main_~j~0 (+ main_~i~0 2)) (= main_~i~0 96))} is VALID [2022-04-15 13:01:38,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {9471#(and (< 0 main_~n~0) (= main_~j~0 (+ main_~i~0 2)) (= main_~i~0 96))} assume !(~i~0 < ~n~0); {9475#(= 98 main_~j~0)} is VALID [2022-04-15 13:01:38,663 INFO L290 TraceCheckUtils]: 32: Hoare triple {9475#(= 98 main_~j~0)} ~k~0 := ~i~0; {9475#(= 98 main_~j~0)} is VALID [2022-04-15 13:01:38,664 INFO L290 TraceCheckUtils]: 33: Hoare triple {9475#(= 98 main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {9325#false} is VALID [2022-04-15 13:01:38,664 INFO L272 TraceCheckUtils]: 34: Hoare triple {9325#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {9325#false} is VALID [2022-04-15 13:01:38,664 INFO L290 TraceCheckUtils]: 35: Hoare triple {9325#false} ~cond := #in~cond; {9325#false} is VALID [2022-04-15 13:01:38,664 INFO L290 TraceCheckUtils]: 36: Hoare triple {9325#false} assume 0 == ~cond; {9325#false} is VALID [2022-04-15 13:01:38,664 INFO L290 TraceCheckUtils]: 37: Hoare triple {9325#false} assume !false; {9325#false} is VALID [2022-04-15 13:01:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:38,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:41,543 INFO L290 TraceCheckUtils]: 37: Hoare triple {9325#false} assume !false; {9325#false} is VALID [2022-04-15 13:01:41,544 INFO L290 TraceCheckUtils]: 36: Hoare triple {9325#false} assume 0 == ~cond; {9325#false} is VALID [2022-04-15 13:01:41,544 INFO L290 TraceCheckUtils]: 35: Hoare triple {9325#false} ~cond := #in~cond; {9325#false} is VALID [2022-04-15 13:01:41,544 INFO L272 TraceCheckUtils]: 34: Hoare triple {9325#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {9325#false} is VALID [2022-04-15 13:01:41,544 INFO L290 TraceCheckUtils]: 33: Hoare triple {9506#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {9325#false} is VALID [2022-04-15 13:01:41,544 INFO L290 TraceCheckUtils]: 32: Hoare triple {9506#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {9506#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:41,545 INFO L290 TraceCheckUtils]: 31: Hoare triple {9513#(or (< main_~i~0 main_~n~0) (= (mod main_~j~0 2) 0))} assume !(~i~0 < ~n~0); {9506#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:41,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {9517#(or (< (+ main_~i~0 4) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9513#(or (< main_~i~0 main_~n~0) (= (mod main_~j~0 2) 0))} is VALID [2022-04-15 13:01:41,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {9521#(or (< (+ main_~i~0 8) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9517#(or (< (+ main_~i~0 4) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:01:41,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {9525#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 12) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9521#(or (< (+ main_~i~0 8) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:01:41,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {9529#(or (< (+ main_~i~0 16) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9525#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 12) main_~n~0))} is VALID [2022-04-15 13:01:41,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {9533#(or (< (+ main_~i~0 20) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9529#(or (< (+ main_~i~0 16) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:01:41,569 INFO L290 TraceCheckUtils]: 25: Hoare triple {9537#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 24) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9533#(or (< (+ main_~i~0 20) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:01:41,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {9541#(or (< (+ main_~i~0 28) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9537#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 24) main_~n~0))} is VALID [2022-04-15 13:01:41,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {9545#(or (< (+ 32 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9541#(or (< (+ main_~i~0 28) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:01:41,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {9549#(or (< (+ main_~i~0 36) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9545#(or (< (+ 32 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:01:41,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {9553#(or (= 0 (mod main_~i~0 2)) (< (+ 40 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9549#(or (< (+ main_~i~0 36) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:01:41,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {9557#(or (= 0 (mod main_~i~0 2)) (< (+ 44 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9553#(or (= 0 (mod main_~i~0 2)) (< (+ 40 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:01:41,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {9561#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 48) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9557#(or (= 0 (mod main_~i~0 2)) (< (+ 44 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:01:41,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {9565#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 52) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9561#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 48) main_~n~0))} is VALID [2022-04-15 13:01:41,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {9569#(or (= 0 (mod main_~i~0 2)) (< (+ 56 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9565#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 52) main_~n~0))} is VALID [2022-04-15 13:01:41,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {9573#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 60) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9569#(or (= 0 (mod main_~i~0 2)) (< (+ 56 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:01:41,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {9577#(or (= 0 (mod main_~i~0 2)) (< (+ 64 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9573#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 60) main_~n~0))} is VALID [2022-04-15 13:01:41,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {9581#(or (= 0 (mod main_~i~0 2)) (< (+ 68 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9577#(or (= 0 (mod main_~i~0 2)) (< (+ 64 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:01:41,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {9585#(or (= 0 (mod main_~i~0 2)) (< (+ 72 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9581#(or (= 0 (mod main_~i~0 2)) (< (+ 68 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:01:41,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {9589#(or (< (+ 76 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9585#(or (= 0 (mod main_~i~0 2)) (< (+ 72 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:01:41,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {9593#(or (< (+ main_~i~0 80) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9589#(or (< (+ 76 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:01:41,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {9597#(or (= 0 (mod main_~i~0 2)) (< (+ 84 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9593#(or (< (+ main_~i~0 80) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:01:41,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {9601#(or (= 0 (mod main_~i~0 2)) (< (+ 88 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9597#(or (= 0 (mod main_~i~0 2)) (< (+ 84 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:01:41,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {9605#(or (= 0 (mod main_~i~0 2)) (< (+ 92 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9601#(or (= 0 (mod main_~i~0 2)) (< (+ 88 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:01:41,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {9609#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9605#(or (= 0 (mod main_~i~0 2)) (< (+ 92 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:01:41,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {9324#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {9609#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:41,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {9324#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {9324#true} is VALID [2022-04-15 13:01:41,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {9324#true} call #t~ret5 := main(); {9324#true} is VALID [2022-04-15 13:01:41,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9324#true} {9324#true} #62#return; {9324#true} is VALID [2022-04-15 13:01:41,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {9324#true} assume true; {9324#true} is VALID [2022-04-15 13:01:41,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {9324#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {9324#true} is VALID [2022-04-15 13:01:41,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {9324#true} call ULTIMATE.init(); {9324#true} is VALID [2022-04-15 13:01:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:41,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314050988] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:41,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:41,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 79 [2022-04-15 13:01:41,630 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:41,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [9367078] [2022-04-15 13:01:41,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [9367078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:41,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:41,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 13:01:41,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068745811] [2022-04-15 13:01:41,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:41,631 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 38 [2022-04-15 13:01:41,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:41,631 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-15 13:01:41,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:41,711 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 13:01:41,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:41,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 13:01:41,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1616, Invalid=4546, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 13:01:41,713 INFO L87 Difference]: Start difference. First operand 39 states and 39 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-15 13:01:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:46,187 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 13:01:46,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 13:01:46,187 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 38 [2022-04-15 13:01:46,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:46,187 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-15 13:01:46,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 47 transitions. [2022-04-15 13:01:46,188 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-15 13:01:46,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 47 transitions. [2022-04-15 13:01:46,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 47 transitions. [2022-04-15 13:01:46,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:46,248 INFO L225 Difference]: With dead ends: 47 [2022-04-15 13:01:46,248 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 13:01:46,249 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2476 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2294, Invalid=8418, Unknown=0, NotChecked=0, Total=10712 [2022-04-15 13:01:46,249 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:46,250 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 141 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 13:01:46,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 13:01:46,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-15 13:01:46,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:46,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:46,286 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:46,286 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:46,287 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 13:01:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 13:01:46,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:46,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:46,287 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 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 40 states. [2022-04-15 13:01:46,287 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 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 40 states. [2022-04-15 13:01:46,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:46,288 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 13:01:46,288 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 13:01:46,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:46,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:46,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:46,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-04-15 13:01:46,289 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2022-04-15 13:01:46,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:46,289 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-04-15 13:01:46,289 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-15 13:01:46,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 40 transitions. [2022-04-15 13:01:46,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:46,390 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 13:01:46,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 13:01:46,391 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:46,391 INFO L499 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:46,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 13:01:46,591 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,SelfDestructingSolverStorable25 [2022-04-15 13:01:46,591 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:46,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:46,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1663232062, now seen corresponding path program 49 times [2022-04-15 13:01:46,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:46,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [389829176] [2022-04-15 13:01:46,846 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:01:46,846 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:01:46,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1663232062, now seen corresponding path program 50 times [2022-04-15 13:01:46,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:46,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386128271] [2022-04-15 13:01:46,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:46,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:47,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:47,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {9968#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {9937#true} is VALID [2022-04-15 13:01:47,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {9937#true} assume true; {9937#true} is VALID [2022-04-15 13:01:47,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9937#true} {9937#true} #62#return; {9937#true} is VALID [2022-04-15 13:01:47,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {9937#true} call ULTIMATE.init(); {9968#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:47,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {9968#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {9937#true} is VALID [2022-04-15 13:01:47,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {9937#true} assume true; {9937#true} is VALID [2022-04-15 13:01:47,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9937#true} {9937#true} #62#return; {9937#true} is VALID [2022-04-15 13:01:47,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {9937#true} call #t~ret5 := main(); {9937#true} is VALID [2022-04-15 13:01:47,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {9937#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {9937#true} is VALID [2022-04-15 13:01:47,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {9937#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {9942#(= main_~i~0 0)} is VALID [2022-04-15 13:01:47,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {9942#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9943#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:01:47,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {9943#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9944#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:01:47,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {9944#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9945#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:01:47,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {9945#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9946#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:01:47,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {9946#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9947#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:01:47,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {9947#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9948#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:01:47,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {9948#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9949#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:01:47,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {9949#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9950#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:01:47,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {9950#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9951#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:01:47,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {9951#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9952#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:01:47,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {9952#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9953#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:01:47,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {9953#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9954#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:01:47,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {9954#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9955#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:01:47,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {9955#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9956#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:01:47,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {9956#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9957#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:01:47,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {9957#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9958#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:01:47,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {9958#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9959#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:01:47,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {9959#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9960#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:01:47,468 INFO L290 TraceCheckUtils]: 25: Hoare triple {9960#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9961#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:01:47,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {9961#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9962#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:01:47,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {9962#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9963#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:01:47,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {9963#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9964#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:01:47,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {9964#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9965#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:01:47,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {9965#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9966#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:01:47,485 INFO L290 TraceCheckUtils]: 31: Hoare triple {9966#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9967#(and (<= 102 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:47,486 INFO L290 TraceCheckUtils]: 32: Hoare triple {9967#(and (<= 102 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(~i~0 < ~n~0); {9967#(and (<= 102 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:47,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {9967#(and (<= 102 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} ~k~0 := ~i~0; {9967#(and (<= 102 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:01:47,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {9967#(and (<= 102 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {9938#false} is VALID [2022-04-15 13:01:47,487 INFO L272 TraceCheckUtils]: 35: Hoare triple {9938#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {9938#false} is VALID [2022-04-15 13:01:47,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {9938#false} ~cond := #in~cond; {9938#false} is VALID [2022-04-15 13:01:47,487 INFO L290 TraceCheckUtils]: 37: Hoare triple {9938#false} assume 0 == ~cond; {9938#false} is VALID [2022-04-15 13:01:47,487 INFO L290 TraceCheckUtils]: 38: Hoare triple {9938#false} assume !false; {9938#false} is VALID [2022-04-15 13:01:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:47,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:47,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386128271] [2022-04-15 13:01:47,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386128271] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:47,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407272222] [2022-04-15 13:01:47,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:01:47,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:47,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:47,489 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:47,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 13:01:47,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:01:47,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:01:47,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-15 13:01:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:47,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:47,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {9937#true} call ULTIMATE.init(); {9937#true} is VALID [2022-04-15 13:01:47,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {9937#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {9937#true} is VALID [2022-04-15 13:01:47,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {9937#true} assume true; {9937#true} is VALID [2022-04-15 13:01:47,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9937#true} {9937#true} #62#return; {9937#true} is VALID [2022-04-15 13:01:47,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {9937#true} call #t~ret5 := main(); {9937#true} is VALID [2022-04-15 13:01:47,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {9937#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {9937#true} is VALID [2022-04-15 13:01:47,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {9937#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {9942#(= main_~i~0 0)} is VALID [2022-04-15 13:01:47,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {9942#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9943#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:01:47,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {9943#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9944#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:01:47,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {9944#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9945#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:01:47,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {9945#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9946#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:01:47,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {9946#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9947#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:01:47,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {9947#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9948#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:01:47,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {9948#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9949#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:01:47,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {9949#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9950#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:01:47,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {9950#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9951#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:01:47,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {9951#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9952#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:01:47,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {9952#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9953#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:01:47,964 INFO L290 TraceCheckUtils]: 18: Hoare triple {9953#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9954#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:01:47,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {9954#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9955#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:01:47,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {9955#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9956#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:01:47,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {9956#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9957#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:01:47,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {9957#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9958#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:01:47,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {9958#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9959#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:01:47,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {9959#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9960#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:01:47,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {9960#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9961#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:01:47,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {9961#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9962#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:01:47,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {9962#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9963#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:01:47,993 INFO L290 TraceCheckUtils]: 28: Hoare triple {9963#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9964#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:01:47,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {9964#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9965#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:01:47,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {9965#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {9966#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:01:47,999 INFO L290 TraceCheckUtils]: 31: Hoare triple {9966#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10065#(and (<= 102 main_~j~0) (<= main_~j~0 102))} is VALID [2022-04-15 13:01:48,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {10065#(and (<= 102 main_~j~0) (<= main_~j~0 102))} assume !(~i~0 < ~n~0); {10065#(and (<= 102 main_~j~0) (<= main_~j~0 102))} is VALID [2022-04-15 13:01:48,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {10065#(and (<= 102 main_~j~0) (<= main_~j~0 102))} ~k~0 := ~i~0; {10065#(and (<= 102 main_~j~0) (<= main_~j~0 102))} is VALID [2022-04-15 13:01:48,001 INFO L290 TraceCheckUtils]: 34: Hoare triple {10065#(and (<= 102 main_~j~0) (<= main_~j~0 102))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {9938#false} is VALID [2022-04-15 13:01:48,001 INFO L272 TraceCheckUtils]: 35: Hoare triple {9938#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {9938#false} is VALID [2022-04-15 13:01:48,001 INFO L290 TraceCheckUtils]: 36: Hoare triple {9938#false} ~cond := #in~cond; {9938#false} is VALID [2022-04-15 13:01:48,001 INFO L290 TraceCheckUtils]: 37: Hoare triple {9938#false} assume 0 == ~cond; {9938#false} is VALID [2022-04-15 13:01:48,001 INFO L290 TraceCheckUtils]: 38: Hoare triple {9938#false} assume !false; {9938#false} is VALID [2022-04-15 13:01:48,002 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:48,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:48,198 INFO L290 TraceCheckUtils]: 38: Hoare triple {9938#false} assume !false; {9938#false} is VALID [2022-04-15 13:01:48,198 INFO L290 TraceCheckUtils]: 37: Hoare triple {9938#false} assume 0 == ~cond; {9938#false} is VALID [2022-04-15 13:01:48,198 INFO L290 TraceCheckUtils]: 36: Hoare triple {9938#false} ~cond := #in~cond; {9938#false} is VALID [2022-04-15 13:01:48,198 INFO L272 TraceCheckUtils]: 35: Hoare triple {9938#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {9938#false} is VALID [2022-04-15 13:01:48,198 INFO L290 TraceCheckUtils]: 34: Hoare triple {10099#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {9938#false} is VALID [2022-04-15 13:01:48,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {10099#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {10099#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:48,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {10099#(= (mod main_~j~0 2) 0)} assume !(~i~0 < ~n~0); {10099#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:48,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10099#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:48,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {10109#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {9937#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {10109#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:48,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {9937#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {9937#true} is VALID [2022-04-15 13:01:48,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {9937#true} call #t~ret5 := main(); {9937#true} is VALID [2022-04-15 13:01:48,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9937#true} {9937#true} #62#return; {9937#true} is VALID [2022-04-15 13:01:48,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {9937#true} assume true; {9937#true} is VALID [2022-04-15 13:01:48,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {9937#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {9937#true} is VALID [2022-04-15 13:01:48,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {9937#true} call ULTIMATE.init(); {9937#true} is VALID [2022-04-15 13:01:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-04-15 13:01:48,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407272222] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:48,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:48,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 4] total 32 [2022-04-15 13:01:48,279 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:48,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [389829176] [2022-04-15 13:01:48,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [389829176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:48,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:48,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 13:01:48,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824481560] [2022-04-15 13:01:48,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:48,280 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 39 [2022-04-15 13:01:48,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:48,280 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-15 13:01:48,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:48,323 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 13:01:48,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:48,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 13:01:48,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2022-04-15 13:01:48,324 INFO L87 Difference]: Start difference. First operand 40 states and 40 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-15 13:01:52,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:52,980 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 13:01:52,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 13:01:52,981 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 39 [2022-04-15 13:01:52,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:52,981 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-15 13:01:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 48 transitions. [2022-04-15 13:01:52,982 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-15 13:01:52,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 48 transitions. [2022-04-15 13:01:52,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 48 transitions. [2022-04-15 13:01:53,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:53,074 INFO L225 Difference]: With dead ends: 48 [2022-04-15 13:01:53,074 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 13:01:53,075 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=219, Invalid=3087, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 13:01:53,077 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:53,077 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 146 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 13:01:53,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 13:01:53,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-15 13:01:53,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:53,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:53,119 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:53,120 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:53,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:53,120 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 13:01:53,121 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 13:01:53,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:53,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:53,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 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 41 states. [2022-04-15 13:01:53,121 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 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 41 states. [2022-04-15 13:01:53,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:53,122 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 13:01:53,122 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 13:01:53,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:53,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:53,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:53,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:53,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-15 13:01:53,124 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2022-04-15 13:01:53,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:53,124 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-15 13:01:53,124 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-15 13:01:53,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-15 13:01:53,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:53,292 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 13:01:53,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 13:01:53,292 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:53,292 INFO L499 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:53,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 13:01:53,493 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,SelfDestructingSolverStorable26 [2022-04-15 13:01:53,493 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:53,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:53,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2041982319, now seen corresponding path program 51 times [2022-04-15 13:01:53,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:53,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [220323130] [2022-04-15 13:01:53,740 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:01:53,740 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:01:53,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2041982319, now seen corresponding path program 52 times [2022-04-15 13:01:53,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:53,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342634298] [2022-04-15 13:01:53,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:53,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:54,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:54,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {10549#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {10517#true} is VALID [2022-04-15 13:01:54,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {10517#true} assume true; {10517#true} is VALID [2022-04-15 13:01:54,290 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10517#true} {10517#true} #62#return; {10517#true} is VALID [2022-04-15 13:01:54,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {10517#true} call ULTIMATE.init(); {10549#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:54,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {10549#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {10517#true} is VALID [2022-04-15 13:01:54,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {10517#true} assume true; {10517#true} is VALID [2022-04-15 13:01:54,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10517#true} {10517#true} #62#return; {10517#true} is VALID [2022-04-15 13:01:54,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {10517#true} call #t~ret5 := main(); {10517#true} is VALID [2022-04-15 13:01:54,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {10517#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {10517#true} is VALID [2022-04-15 13:01:54,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {10517#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {10522#(= main_~i~0 0)} is VALID [2022-04-15 13:01:54,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {10522#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10523#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:01:54,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {10523#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10524#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:01:54,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {10524#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10525#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:01:54,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {10525#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10526#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:01:54,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {10526#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10527#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:01:54,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {10527#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10528#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:01:54,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {10528#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10529#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:01:54,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {10529#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10530#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:01:54,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {10530#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10531#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:01:54,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {10531#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10532#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:01:54,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {10532#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10533#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:01:54,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {10533#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10534#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:01:54,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {10534#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10535#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:01:54,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {10535#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10536#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:01:54,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {10536#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10537#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:01:54,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {10537#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10538#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:01:54,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {10538#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10539#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:01:54,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {10539#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10540#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:01:54,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {10540#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10541#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:01:54,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {10541#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10542#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:01:54,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {10542#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10543#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:01:54,350 INFO L290 TraceCheckUtils]: 28: Hoare triple {10543#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10544#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:01:54,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {10544#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10545#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:01:54,354 INFO L290 TraceCheckUtils]: 30: Hoare triple {10545#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10546#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:01:54,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {10546#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10547#(and (<= 100 main_~i~0) (<= main_~i~0 100))} is VALID [2022-04-15 13:01:54,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {10547#(and (<= 100 main_~i~0) (<= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10548#(and (<= main_~j~0 (* 2 (div main_~j~0 2))) (not (<= (div main_~j~0 2) 52)))} is VALID [2022-04-15 13:01:54,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {10548#(and (<= main_~j~0 (* 2 (div main_~j~0 2))) (not (<= (div main_~j~0 2) 52)))} assume !(~i~0 < ~n~0); {10548#(and (<= main_~j~0 (* 2 (div main_~j~0 2))) (not (<= (div main_~j~0 2) 52)))} is VALID [2022-04-15 13:01:54,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {10548#(and (<= main_~j~0 (* 2 (div main_~j~0 2))) (not (<= (div main_~j~0 2) 52)))} ~k~0 := ~i~0; {10548#(and (<= main_~j~0 (* 2 (div main_~j~0 2))) (not (<= (div main_~j~0 2) 52)))} is VALID [2022-04-15 13:01:54,361 INFO L290 TraceCheckUtils]: 35: Hoare triple {10548#(and (<= main_~j~0 (* 2 (div main_~j~0 2))) (not (<= (div main_~j~0 2) 52)))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {10518#false} is VALID [2022-04-15 13:01:54,361 INFO L272 TraceCheckUtils]: 36: Hoare triple {10518#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {10518#false} is VALID [2022-04-15 13:01:54,361 INFO L290 TraceCheckUtils]: 37: Hoare triple {10518#false} ~cond := #in~cond; {10518#false} is VALID [2022-04-15 13:01:54,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {10518#false} assume 0 == ~cond; {10518#false} is VALID [2022-04-15 13:01:54,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {10518#false} assume !false; {10518#false} is VALID [2022-04-15 13:01:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:54,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:54,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342634298] [2022-04-15 13:01:54,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342634298] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:54,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061491858] [2022-04-15 13:01:54,362 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:01:54,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:54,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:54,363 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:54,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 13:01:54,405 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:01:54,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:01:54,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-15 13:01:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:54,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:54,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {10517#true} call ULTIMATE.init(); {10517#true} is VALID [2022-04-15 13:01:54,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {10517#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {10517#true} is VALID [2022-04-15 13:01:54,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {10517#true} assume true; {10517#true} is VALID [2022-04-15 13:01:54,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10517#true} {10517#true} #62#return; {10517#true} is VALID [2022-04-15 13:01:54,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {10517#true} call #t~ret5 := main(); {10517#true} is VALID [2022-04-15 13:01:54,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {10517#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {10517#true} is VALID [2022-04-15 13:01:54,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {10517#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {10522#(= main_~i~0 0)} is VALID [2022-04-15 13:01:54,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {10522#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10523#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:01:54,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {10523#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10524#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:01:54,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {10524#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10525#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:01:54,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {10525#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10526#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:01:54,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {10526#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10527#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:01:54,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {10527#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10528#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:01:54,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {10528#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10529#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:01:54,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {10529#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10530#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:01:54,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {10530#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10531#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:01:54,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {10531#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10532#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:01:54,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {10532#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10533#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:01:54,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {10533#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10534#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:01:54,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {10534#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10535#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:01:54,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {10535#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10536#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:01:54,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {10536#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10537#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:01:54,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {10537#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10538#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:01:54,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {10538#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10539#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:01:54,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {10539#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10540#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:01:54,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {10540#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10541#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:01:54,878 INFO L290 TraceCheckUtils]: 26: Hoare triple {10541#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10542#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:01:54,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {10542#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10543#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:01:54,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {10543#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10544#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:01:54,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {10544#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10545#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:01:54,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {10545#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10546#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:01:54,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {10546#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10547#(and (<= 100 main_~i~0) (<= main_~i~0 100))} is VALID [2022-04-15 13:01:54,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {10547#(and (<= 100 main_~i~0) (<= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10649#(and (<= 106 main_~j~0) (<= main_~j~0 106))} is VALID [2022-04-15 13:01:54,892 INFO L290 TraceCheckUtils]: 33: Hoare triple {10649#(and (<= 106 main_~j~0) (<= main_~j~0 106))} assume !(~i~0 < ~n~0); {10649#(and (<= 106 main_~j~0) (<= main_~j~0 106))} is VALID [2022-04-15 13:01:54,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {10649#(and (<= 106 main_~j~0) (<= main_~j~0 106))} ~k~0 := ~i~0; {10649#(and (<= 106 main_~j~0) (<= main_~j~0 106))} is VALID [2022-04-15 13:01:54,893 INFO L290 TraceCheckUtils]: 35: Hoare triple {10649#(and (<= 106 main_~j~0) (<= main_~j~0 106))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {10518#false} is VALID [2022-04-15 13:01:54,893 INFO L272 TraceCheckUtils]: 36: Hoare triple {10518#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {10518#false} is VALID [2022-04-15 13:01:54,893 INFO L290 TraceCheckUtils]: 37: Hoare triple {10518#false} ~cond := #in~cond; {10518#false} is VALID [2022-04-15 13:01:54,893 INFO L290 TraceCheckUtils]: 38: Hoare triple {10518#false} assume 0 == ~cond; {10518#false} is VALID [2022-04-15 13:01:54,893 INFO L290 TraceCheckUtils]: 39: Hoare triple {10518#false} assume !false; {10518#false} is VALID [2022-04-15 13:01:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:54,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:55,108 INFO L290 TraceCheckUtils]: 39: Hoare triple {10518#false} assume !false; {10518#false} is VALID [2022-04-15 13:01:55,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {10518#false} assume 0 == ~cond; {10518#false} is VALID [2022-04-15 13:01:55,108 INFO L290 TraceCheckUtils]: 37: Hoare triple {10518#false} ~cond := #in~cond; {10518#false} is VALID [2022-04-15 13:01:55,108 INFO L272 TraceCheckUtils]: 36: Hoare triple {10518#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {10518#false} is VALID [2022-04-15 13:01:55,108 INFO L290 TraceCheckUtils]: 35: Hoare triple {10683#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {10518#false} is VALID [2022-04-15 13:01:55,109 INFO L290 TraceCheckUtils]: 34: Hoare triple {10683#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {10683#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:55,109 INFO L290 TraceCheckUtils]: 33: Hoare triple {10683#(= (mod main_~j~0 2) 0)} assume !(~i~0 < ~n~0); {10683#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:55,116 INFO L290 TraceCheckUtils]: 32: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10683#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:01:55,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {10693#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {10517#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {10693#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:01:55,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {10517#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {10517#true} is VALID [2022-04-15 13:01:55,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {10517#true} call #t~ret5 := main(); {10517#true} is VALID [2022-04-15 13:01:55,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10517#true} {10517#true} #62#return; {10517#true} is VALID [2022-04-15 13:01:55,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {10517#true} assume true; {10517#true} is VALID [2022-04-15 13:01:55,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {10517#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {10517#true} is VALID [2022-04-15 13:01:55,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {10517#true} call ULTIMATE.init(); {10517#true} is VALID [2022-04-15 13:01:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-04-15 13:01:55,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061491858] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:55,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:55,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 4] total 33 [2022-04-15 13:01:55,194 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:55,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [220323130] [2022-04-15 13:01:55,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [220323130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:55,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:55,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 13:01:55,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843829554] [2022-04-15 13:01:55,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:55,195 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 40 [2022-04-15 13:01:55,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:55,195 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-15 13:01:55,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:55,247 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 13:01:55,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:55,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 13:01:55,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 13:01:55,248 INFO L87 Difference]: Start difference. First operand 41 states and 41 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-15 13:02:00,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:00,989 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 13:02:00,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 13:02:00,990 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 40 [2022-04-15 13:02:00,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:02:00,990 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-15 13:02:00,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2022-04-15 13:02:00,990 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-15 13:02:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2022-04-15 13:02:00,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 49 transitions. [2022-04-15 13:02:01,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:01,060 INFO L225 Difference]: With dead ends: 49 [2022-04-15 13:02:01,060 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 13:02:01,061 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=227, Invalid=3313, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 13:02:01,061 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:02:01,061 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 151 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 13:02:01,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 13:02:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-15 13:02:01,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:02:01,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:01,098 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:01,098 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:01,098 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 13:02:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 13:02:01,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:01,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:01,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-15 13:02:01,099 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-15 13:02:01,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:01,099 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 13:02:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 13:02:01,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:01,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:01,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:02:01,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:02:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:01,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-04-15 13:02:01,100 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2022-04-15 13:02:01,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:02:01,100 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-04-15 13:02:01,100 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-15 13:02:01,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2022-04-15 13:02:01,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 13:02:01,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 13:02:01,221 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:02:01,221 INFO L499 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:02:01,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-15 13:02:01,421 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,SelfDestructingSolverStorable27 [2022-04-15 13:02:01,421 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:02:01,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:02:01,421 INFO L85 PathProgramCache]: Analyzing trace with hash -939511138, now seen corresponding path program 53 times [2022-04-15 13:02:01,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:01,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1508622408] [2022-04-15 13:02:01,699 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:02:01,699 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:02:01,699 INFO L85 PathProgramCache]: Analyzing trace with hash -939511138, now seen corresponding path program 54 times [2022-04-15 13:02:01,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:02:01,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440719743] [2022-04-15 13:02:01,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:02:01,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:02:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:02,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:02:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:02,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {11145#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {11112#true} is VALID [2022-04-15 13:02:02,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {11112#true} assume true; {11112#true} is VALID [2022-04-15 13:02:02,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11112#true} {11112#true} #62#return; {11112#true} is VALID [2022-04-15 13:02:02,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {11112#true} call ULTIMATE.init(); {11145#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:02:02,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {11145#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {11112#true} is VALID [2022-04-15 13:02:02,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {11112#true} assume true; {11112#true} is VALID [2022-04-15 13:02:02,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11112#true} {11112#true} #62#return; {11112#true} is VALID [2022-04-15 13:02:02,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {11112#true} call #t~ret5 := main(); {11112#true} is VALID [2022-04-15 13:02:02,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {11112#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {11112#true} is VALID [2022-04-15 13:02:02,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {11112#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {11117#(= main_~i~0 0)} is VALID [2022-04-15 13:02:02,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {11117#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11118#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:02:02,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {11118#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11119#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:02:02,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {11119#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11120#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:02:02,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {11120#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11121#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:02:02,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {11121#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11122#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:02:02,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {11122#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11123#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:02:02,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {11123#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11124#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:02:02,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {11124#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11125#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:02:02,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {11125#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11126#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:02:02,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {11126#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11127#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:02:02,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {11127#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11128#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:02:02,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {11128#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11129#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:02:02,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {11129#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11130#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:02:02,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {11130#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11131#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:02:02,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {11131#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11132#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:02:02,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {11132#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11133#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:02:02,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {11133#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11134#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:02:02,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {11134#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11135#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:02:02,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {11135#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11136#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:02:02,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {11136#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11137#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:02:02,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {11137#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11138#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:02:02,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {11138#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11139#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:02:02,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {11139#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11140#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:02:02,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {11140#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11141#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:02:02,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {11141#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11142#(and (<= 100 main_~i~0) (<= main_~i~0 100))} is VALID [2022-04-15 13:02:02,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {11142#(and (<= 100 main_~i~0) (<= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11143#(and (<= main_~i~0 104) (<= 104 main_~i~0))} is VALID [2022-04-15 13:02:02,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {11143#(and (<= main_~i~0 104) (<= 104 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11144#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:02:02,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {11144#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {11144#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:02:02,374 INFO L290 TraceCheckUtils]: 35: Hoare triple {11144#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {11144#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:02:02,377 INFO L290 TraceCheckUtils]: 36: Hoare triple {11144#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {11113#false} is VALID [2022-04-15 13:02:02,377 INFO L272 TraceCheckUtils]: 37: Hoare triple {11113#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {11113#false} is VALID [2022-04-15 13:02:02,377 INFO L290 TraceCheckUtils]: 38: Hoare triple {11113#false} ~cond := #in~cond; {11113#false} is VALID [2022-04-15 13:02:02,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {11113#false} assume 0 == ~cond; {11113#false} is VALID [2022-04-15 13:02:02,377 INFO L290 TraceCheckUtils]: 40: Hoare triple {11113#false} assume !false; {11113#false} is VALID [2022-04-15 13:02:02,378 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:02:02,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:02:02,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440719743] [2022-04-15 13:02:02,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440719743] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:02:02,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244235033] [2022-04-15 13:02:02,378 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:02:02,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:02:02,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:02:02,404 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:02:02,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 13:02:02,462 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-15 13:02:02,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:02:02,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-15 13:02:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:02,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:02:03,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {11112#true} call ULTIMATE.init(); {11112#true} is VALID [2022-04-15 13:02:03,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {11112#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {11112#true} is VALID [2022-04-15 13:02:03,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {11112#true} assume true; {11112#true} is VALID [2022-04-15 13:02:03,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11112#true} {11112#true} #62#return; {11112#true} is VALID [2022-04-15 13:02:03,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {11112#true} call #t~ret5 := main(); {11112#true} is VALID [2022-04-15 13:02:03,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {11112#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {11112#true} is VALID [2022-04-15 13:02:03,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {11112#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {11117#(= main_~i~0 0)} is VALID [2022-04-15 13:02:03,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {11117#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11170#(and (< main_~i~0 (+ main_~n~0 4)) (= (+ main_~i~0 (- 4)) 0))} is VALID [2022-04-15 13:02:03,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {11170#(and (< main_~i~0 (+ main_~n~0 4)) (= (+ main_~i~0 (- 4)) 0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11174#(and (< 0 main_~n~0) (= main_~i~0 8))} is VALID [2022-04-15 13:02:03,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {11174#(and (< 0 main_~n~0) (= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11178#(and (< 0 main_~n~0) (= main_~i~0 12))} is VALID [2022-04-15 13:02:03,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {11178#(and (< 0 main_~n~0) (= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11182#(and (< 0 main_~n~0) (= 12 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:02:03,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {11182#(and (< 0 main_~n~0) (= 12 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11186#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 8)) 12))} is VALID [2022-04-15 13:02:03,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {11186#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 8)) 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11190#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 12)) 12))} is VALID [2022-04-15 13:02:03,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {11190#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 12)) 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11194#(and (< 0 main_~n~0) (= main_~i~0 28))} is VALID [2022-04-15 13:02:03,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {11194#(and (< 0 main_~n~0) (= main_~i~0 28))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11198#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 4)) 28))} is VALID [2022-04-15 13:02:03,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {11198#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 4)) 28))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11202#(and (< 0 main_~n~0) (= main_~i~0 36))} is VALID [2022-04-15 13:02:03,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {11202#(and (< 0 main_~n~0) (= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11206#(and (< 0 main_~n~0) (= 36 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:02:03,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {11206#(and (< 0 main_~n~0) (= 36 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11210#(and (< 0 main_~n~0) (= 44 main_~i~0))} is VALID [2022-04-15 13:02:03,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {11210#(and (< 0 main_~n~0) (= 44 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11214#(and (< 0 main_~n~0) (= 44 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:02:03,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {11214#(and (< 0 main_~n~0) (= 44 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11218#(and (< 0 main_~n~0) (= main_~i~0 52))} is VALID [2022-04-15 13:02:03,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {11218#(and (< 0 main_~n~0) (= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11222#(and (< 0 main_~n~0) (= 56 main_~i~0))} is VALID [2022-04-15 13:02:03,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {11222#(and (< 0 main_~n~0) (= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11226#(and (< 0 main_~n~0) (= main_~i~0 60))} is VALID [2022-04-15 13:02:03,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {11226#(and (< 0 main_~n~0) (= main_~i~0 60))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11230#(and (< 0 main_~n~0) (= 60 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:02:03,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {11230#(and (< 0 main_~n~0) (= 60 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11234#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 8)) 60))} is VALID [2022-04-15 13:02:03,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {11234#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 8)) 60))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11238#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 12)) 60))} is VALID [2022-04-15 13:02:03,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {11238#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 12)) 60))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11242#(and (< 0 main_~n~0) (= 76 main_~i~0))} is VALID [2022-04-15 13:02:03,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {11242#(and (< 0 main_~n~0) (= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11246#(and (< 0 main_~n~0) (= 76 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:02:03,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {11246#(and (< 0 main_~n~0) (= 76 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11250#(and (< 0 main_~n~0) (= 76 (+ main_~i~0 (- 8))))} is VALID [2022-04-15 13:02:03,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {11250#(and (< 0 main_~n~0) (= 76 (+ main_~i~0 (- 8))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11254#(and (< 0 main_~n~0) (= 76 (+ main_~i~0 (- 12))))} is VALID [2022-04-15 13:02:03,562 INFO L290 TraceCheckUtils]: 29: Hoare triple {11254#(and (< 0 main_~n~0) (= 76 (+ main_~i~0 (- 12))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11258#(and (< 0 main_~n~0) (= 76 (+ (- 16) main_~i~0)))} is VALID [2022-04-15 13:02:03,562 INFO L290 TraceCheckUtils]: 30: Hoare triple {11258#(and (< 0 main_~n~0) (= 76 (+ (- 16) main_~i~0)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11262#(and (< 0 main_~n~0) (= main_~i~0 96))} is VALID [2022-04-15 13:02:03,563 INFO L290 TraceCheckUtils]: 31: Hoare triple {11262#(and (< 0 main_~n~0) (= main_~i~0 96))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11266#(and (< 0 main_~n~0) (= main_~i~0 100))} is VALID [2022-04-15 13:02:03,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {11266#(and (< 0 main_~n~0) (= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11270#(and (< 0 main_~n~0) (= 104 main_~i~0))} is VALID [2022-04-15 13:02:03,564 INFO L290 TraceCheckUtils]: 33: Hoare triple {11270#(and (< 0 main_~n~0) (= 104 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11274#(and (< 0 main_~n~0) (= main_~j~0 (+ main_~i~0 2)) (= 104 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:02:03,564 INFO L290 TraceCheckUtils]: 34: Hoare triple {11274#(and (< 0 main_~n~0) (= main_~j~0 (+ main_~i~0 2)) (= 104 (+ main_~i~0 (- 4))))} assume !(~i~0 < ~n~0); {11278#(= 110 main_~j~0)} is VALID [2022-04-15 13:02:03,564 INFO L290 TraceCheckUtils]: 35: Hoare triple {11278#(= 110 main_~j~0)} ~k~0 := ~i~0; {11278#(= 110 main_~j~0)} is VALID [2022-04-15 13:02:03,565 INFO L290 TraceCheckUtils]: 36: Hoare triple {11278#(= 110 main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {11113#false} is VALID [2022-04-15 13:02:03,565 INFO L272 TraceCheckUtils]: 37: Hoare triple {11113#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {11113#false} is VALID [2022-04-15 13:02:03,565 INFO L290 TraceCheckUtils]: 38: Hoare triple {11113#false} ~cond := #in~cond; {11113#false} is VALID [2022-04-15 13:02:03,565 INFO L290 TraceCheckUtils]: 39: Hoare triple {11113#false} assume 0 == ~cond; {11113#false} is VALID [2022-04-15 13:02:03,565 INFO L290 TraceCheckUtils]: 40: Hoare triple {11113#false} assume !false; {11113#false} is VALID [2022-04-15 13:02:03,566 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:02:03,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:02:10,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {11113#false} assume !false; {11113#false} is VALID [2022-04-15 13:02:10,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {11113#false} assume 0 == ~cond; {11113#false} is VALID [2022-04-15 13:02:10,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {11113#false} ~cond := #in~cond; {11113#false} is VALID [2022-04-15 13:02:10,313 INFO L272 TraceCheckUtils]: 37: Hoare triple {11113#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {11113#false} is VALID [2022-04-15 13:02:10,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {11144#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {11113#false} is VALID [2022-04-15 13:02:10,317 INFO L290 TraceCheckUtils]: 35: Hoare triple {11144#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {11144#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:02:10,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {11315#(or (< main_~i~0 main_~n~0) (= (* 2 (div main_~j~0 2)) main_~j~0))} assume !(~i~0 < ~n~0); {11144#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:02:10,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {11319#(or (< (+ main_~i~0 4) main_~n~0) (= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11315#(or (< main_~i~0 main_~n~0) (= (* 2 (div main_~j~0 2)) main_~j~0))} is VALID [2022-04-15 13:02:10,330 INFO L290 TraceCheckUtils]: 32: Hoare triple {11323#(or (< (+ main_~i~0 8) main_~n~0) (= (+ main_~i~0 10) (* 2 (div (+ main_~i~0 10) 2))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11319#(or (< (+ main_~i~0 4) main_~n~0) (= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2)))} is VALID [2022-04-15 13:02:10,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {11327#(or (= (+ main_~i~0 14) (* 2 (div (+ main_~i~0 14) 2))) (< (+ main_~i~0 12) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11323#(or (< (+ main_~i~0 8) main_~n~0) (= (+ main_~i~0 10) (* 2 (div (+ main_~i~0 10) 2))))} is VALID [2022-04-15 13:02:10,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {11331#(or (= (+ main_~i~0 18) (* 2 (div (+ main_~i~0 18) 2))) (< (+ main_~i~0 16) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11327#(or (= (+ main_~i~0 14) (* 2 (div (+ main_~i~0 14) 2))) (< (+ main_~i~0 12) main_~n~0))} is VALID [2022-04-15 13:02:10,342 INFO L290 TraceCheckUtils]: 29: Hoare triple {11335#(or (< (+ main_~i~0 20) main_~n~0) (= (* (div (+ main_~i~0 22) 2) 2) (+ main_~i~0 22)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11331#(or (= (+ main_~i~0 18) (* 2 (div (+ main_~i~0 18) 2))) (< (+ main_~i~0 16) main_~n~0))} is VALID [2022-04-15 13:02:10,345 INFO L290 TraceCheckUtils]: 28: Hoare triple {11339#(or (= (+ main_~i~0 26) (* 2 (div (+ main_~i~0 26) 2))) (< (+ main_~i~0 24) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11335#(or (< (+ main_~i~0 20) main_~n~0) (= (* (div (+ main_~i~0 22) 2) 2) (+ main_~i~0 22)))} is VALID [2022-04-15 13:02:10,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {11343#(or (< (+ main_~i~0 28) main_~n~0) (= (* 2 (div (+ 30 main_~i~0) 2)) (+ 30 main_~i~0)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11339#(or (= (+ main_~i~0 26) (* 2 (div (+ main_~i~0 26) 2))) (< (+ main_~i~0 24) main_~n~0))} is VALID [2022-04-15 13:02:10,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {11347#(or (< (+ 32 main_~i~0) main_~n~0) (= (+ main_~i~0 34) (* (div (+ main_~i~0 34) 2) 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11343#(or (< (+ main_~i~0 28) main_~n~0) (= (* 2 (div (+ 30 main_~i~0) 2)) (+ 30 main_~i~0)))} is VALID [2022-04-15 13:02:10,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {11351#(or (< (+ main_~i~0 36) main_~n~0) (= (* (div (+ main_~i~0 38) 2) 2) (+ main_~i~0 38)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11347#(or (< (+ 32 main_~i~0) main_~n~0) (= (+ main_~i~0 34) (* (div (+ main_~i~0 34) 2) 2)))} is VALID [2022-04-15 13:02:10,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {11355#(or (= (* (div (+ 42 main_~i~0) 2) 2) (+ 42 main_~i~0)) (< (+ 40 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11351#(or (< (+ main_~i~0 36) main_~n~0) (= (* (div (+ main_~i~0 38) 2) 2) (+ main_~i~0 38)))} is VALID [2022-04-15 13:02:10,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {11359#(or (< (+ 44 main_~i~0) main_~n~0) (= (* (div (+ main_~i~0 46) 2) 2) (+ main_~i~0 46)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11355#(or (= (* (div (+ 42 main_~i~0) 2) 2) (+ 42 main_~i~0)) (< (+ 40 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:02:10,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {11363#(or (= (+ main_~i~0 50) (* 2 (div (+ main_~i~0 50) 2))) (< (+ main_~i~0 48) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11359#(or (< (+ 44 main_~i~0) main_~n~0) (= (* (div (+ main_~i~0 46) 2) 2) (+ main_~i~0 46)))} is VALID [2022-04-15 13:02:10,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {11367#(or (= (* 2 (div (+ main_~i~0 54) 2)) (+ main_~i~0 54)) (< (+ main_~i~0 52) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11363#(or (= (+ main_~i~0 50) (* 2 (div (+ main_~i~0 50) 2))) (< (+ main_~i~0 48) main_~n~0))} is VALID [2022-04-15 13:02:10,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {11371#(or (= (+ main_~i~0 58) (* 2 (div (+ main_~i~0 58) 2))) (< (+ 56 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11367#(or (= (* 2 (div (+ main_~i~0 54) 2)) (+ main_~i~0 54)) (< (+ main_~i~0 52) main_~n~0))} is VALID [2022-04-15 13:02:10,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {11375#(or (= (+ main_~i~0 62) (* 2 (div (+ main_~i~0 62) 2))) (< (+ main_~i~0 60) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11371#(or (= (+ main_~i~0 58) (* 2 (div (+ main_~i~0 58) 2))) (< (+ 56 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:02:10,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {11379#(or (< (+ 64 main_~i~0) main_~n~0) (= (+ 66 main_~i~0) (* (div (+ 66 main_~i~0) 2) 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11375#(or (= (+ main_~i~0 62) (* 2 (div (+ main_~i~0 62) 2))) (< (+ main_~i~0 60) main_~n~0))} is VALID [2022-04-15 13:02:10,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {11383#(or (= (+ main_~i~0 70) (* 2 (div (+ main_~i~0 70) 2))) (< (+ 68 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11379#(or (< (+ 64 main_~i~0) main_~n~0) (= (+ 66 main_~i~0) (* (div (+ 66 main_~i~0) 2) 2)))} is VALID [2022-04-15 13:02:10,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {11387#(or (= (+ main_~i~0 74) (* 2 (div (+ main_~i~0 74) 2))) (< (+ 72 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11383#(or (= (+ main_~i~0 70) (* 2 (div (+ main_~i~0 70) 2))) (< (+ 68 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:02:10,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {11391#(or (< (+ 76 main_~i~0) main_~n~0) (= (+ main_~i~0 78) (* 2 (div (+ main_~i~0 78) 2))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11387#(or (= (+ main_~i~0 74) (* 2 (div (+ main_~i~0 74) 2))) (< (+ 72 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:02:10,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {11395#(or (< (+ main_~i~0 80) main_~n~0) (= (* (div (+ main_~i~0 82) 2) 2) (+ main_~i~0 82)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11391#(or (< (+ 76 main_~i~0) main_~n~0) (= (+ main_~i~0 78) (* 2 (div (+ main_~i~0 78) 2))))} is VALID [2022-04-15 13:02:10,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {11399#(or (< (+ 84 main_~i~0) main_~n~0) (= (+ main_~i~0 86) (* (div (+ main_~i~0 86) 2) 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11395#(or (< (+ main_~i~0 80) main_~n~0) (= (* (div (+ main_~i~0 82) 2) 2) (+ main_~i~0 82)))} is VALID [2022-04-15 13:02:10,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {11403#(or (= (* (div (+ main_~i~0 90) 2) 2) (+ main_~i~0 90)) (< (+ 88 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11399#(or (< (+ 84 main_~i~0) main_~n~0) (= (+ main_~i~0 86) (* (div (+ main_~i~0 86) 2) 2)))} is VALID [2022-04-15 13:02:10,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {11407#(or (= (* 2 (div (+ 94 main_~i~0) 2)) (+ 94 main_~i~0)) (< (+ 92 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11403#(or (= (* (div (+ main_~i~0 90) 2) 2) (+ main_~i~0 90)) (< (+ 88 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:02:10,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {11411#(or (< (+ main_~i~0 96) main_~n~0) (= (* (div (+ 98 main_~i~0) 2) 2) (+ 98 main_~i~0)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11407#(or (= (* 2 (div (+ 94 main_~i~0) 2)) (+ 94 main_~i~0)) (< (+ 92 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:02:10,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {11415#(or (= (* 2 (div (+ main_~i~0 102) 2)) (+ main_~i~0 102)) (< (+ main_~i~0 100) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11411#(or (< (+ main_~i~0 96) main_~n~0) (= (* (div (+ 98 main_~i~0) 2) 2) (+ 98 main_~i~0)))} is VALID [2022-04-15 13:02:10,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {11419#(or (= (* 2 (div (+ 106 main_~i~0) 2)) (+ 106 main_~i~0)) (< (+ 104 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11415#(or (= (* 2 (div (+ main_~i~0 102) 2)) (+ main_~i~0 102)) (< (+ main_~i~0 100) main_~n~0))} is VALID [2022-04-15 13:02:10,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {11423#(= (* 2 (div (+ 110 main_~i~0) 2)) (+ 110 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11419#(or (= (* 2 (div (+ 106 main_~i~0) 2)) (+ 106 main_~i~0)) (< (+ 104 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:02:10,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {11112#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {11423#(= (* 2 (div (+ 110 main_~i~0) 2)) (+ 110 main_~i~0))} is VALID [2022-04-15 13:02:10,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {11112#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {11112#true} is VALID [2022-04-15 13:02:10,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {11112#true} call #t~ret5 := main(); {11112#true} is VALID [2022-04-15 13:02:10,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11112#true} {11112#true} #62#return; {11112#true} is VALID [2022-04-15 13:02:10,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {11112#true} assume true; {11112#true} is VALID [2022-04-15 13:02:10,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {11112#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {11112#true} is VALID [2022-04-15 13:02:10,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {11112#true} call ULTIMATE.init(); {11112#true} is VALID [2022-04-15 13:02:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:02:10,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244235033] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:02:10,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:02:10,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 87 [2022-04-15 13:02:10,455 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:02:10,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1508622408] [2022-04-15 13:02:10,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1508622408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:02:10,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:02:10,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 13:02:10,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373222927] [2022-04-15 13:02:10,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:02:10,456 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 41 [2022-04-15 13:02:10,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:02:10,456 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-15 13:02:10,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:10,504 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 13:02:10,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:10,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 13:02:10,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2012, Invalid=5470, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 13:02:10,505 INFO L87 Difference]: Start difference. First operand 42 states and 42 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-15 13:02:20,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:20,705 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 13:02:20,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 13:02:20,705 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 41 [2022-04-15 13:02:20,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:02:20,705 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-15 13:02:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2022-04-15 13:02:20,706 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-15 13:02:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2022-04-15 13:02:20,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 50 transitions. [2022-04-15 13:02:20,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:20,914 INFO L225 Difference]: With dead ends: 50 [2022-04-15 13:02:20,914 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 13:02:20,915 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3026 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=2935, Invalid=10175, Unknown=0, NotChecked=0, Total=13110 [2022-04-15 13:02:20,916 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-15 13:02:20,916 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 155 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-15 13:02:20,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 13:02:20,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-15 13:02:20,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:02:20,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:20,967 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:20,967 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:20,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:20,968 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 13:02:20,968 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 13:02:20,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:20,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:20,969 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 13:02:20,970 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 13:02:20,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:20,970 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 13:02:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 13:02:20,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:20,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:20,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:02:20,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:02:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-15 13:02:20,972 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2022-04-15 13:02:20,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:02:20,972 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-15 13:02:20,972 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-15 13:02:20,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-15 13:02:21,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 13:02:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 13:02:21,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:02:21,203 INFO L499 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:02:21,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 13:02:21,403 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 13:02:21,403 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:02:21,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:02:21,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1122642895, now seen corresponding path program 55 times [2022-04-15 13:02:21,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:21,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1876120383] [2022-04-15 13:02:21,700 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:02:21,700 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:02:21,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1122642895, now seen corresponding path program 56 times [2022-04-15 13:02:21,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:02:21,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502912867] [2022-04-15 13:02:21,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:02:21,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:02:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:22,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:02:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:22,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {11809#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {11775#true} is VALID [2022-04-15 13:02:22,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {11775#true} assume true; {11775#true} is VALID [2022-04-15 13:02:22,278 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11775#true} {11775#true} #62#return; {11775#true} is VALID [2022-04-15 13:02:22,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {11775#true} call ULTIMATE.init(); {11809#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:02:22,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {11809#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {11775#true} is VALID [2022-04-15 13:02:22,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {11775#true} assume true; {11775#true} is VALID [2022-04-15 13:02:22,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11775#true} {11775#true} #62#return; {11775#true} is VALID [2022-04-15 13:02:22,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {11775#true} call #t~ret5 := main(); {11775#true} is VALID [2022-04-15 13:02:22,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {11775#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {11775#true} is VALID [2022-04-15 13:02:22,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {11775#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {11780#(= main_~i~0 0)} is VALID [2022-04-15 13:02:22,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {11780#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11781#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:02:22,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {11781#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11782#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:02:22,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {11782#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11783#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:02:22,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {11783#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11784#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:02:22,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {11784#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11785#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:02:22,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {11785#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11786#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:02:22,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {11786#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11787#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:02:22,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {11787#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11788#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:02:22,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {11788#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11789#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:02:22,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {11789#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11790#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:02:22,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {11790#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11791#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:02:22,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {11791#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11792#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:02:22,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {11792#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11793#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:02:22,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {11793#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11794#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:02:22,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {11794#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11795#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:02:22,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {11795#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11796#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:02:22,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {11796#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11797#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:02:22,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {11797#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11798#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:02:22,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {11798#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11799#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:02:22,389 INFO L290 TraceCheckUtils]: 26: Hoare triple {11799#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11800#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:02:22,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {11800#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11801#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:02:22,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {11801#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11802#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:02:22,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {11802#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11803#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:02:22,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {11803#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11804#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:02:22,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {11804#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11805#(and (<= 100 main_~i~0) (<= main_~i~0 100))} is VALID [2022-04-15 13:02:22,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {11805#(and (<= 100 main_~i~0) (<= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11806#(and (<= main_~i~0 104) (<= 104 main_~i~0))} is VALID [2022-04-15 13:02:22,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {11806#(and (<= main_~i~0 104) (<= 104 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11807#(and (<= 108 main_~i~0) (<= main_~i~0 108))} is VALID [2022-04-15 13:02:22,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {11807#(and (<= 108 main_~i~0) (<= main_~i~0 108))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11808#(and (<= 114 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:02:22,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {11808#(and (<= 114 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(~i~0 < ~n~0); {11808#(and (<= 114 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:02:22,432 INFO L290 TraceCheckUtils]: 36: Hoare triple {11808#(and (<= 114 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} ~k~0 := ~i~0; {11808#(and (<= 114 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:02:22,433 INFO L290 TraceCheckUtils]: 37: Hoare triple {11808#(and (<= 114 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {11776#false} is VALID [2022-04-15 13:02:22,433 INFO L272 TraceCheckUtils]: 38: Hoare triple {11776#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {11776#false} is VALID [2022-04-15 13:02:22,433 INFO L290 TraceCheckUtils]: 39: Hoare triple {11776#false} ~cond := #in~cond; {11776#false} is VALID [2022-04-15 13:02:22,433 INFO L290 TraceCheckUtils]: 40: Hoare triple {11776#false} assume 0 == ~cond; {11776#false} is VALID [2022-04-15 13:02:22,433 INFO L290 TraceCheckUtils]: 41: Hoare triple {11776#false} assume !false; {11776#false} is VALID [2022-04-15 13:02:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:02:22,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:02:22,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502912867] [2022-04-15 13:02:22,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502912867] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:02:22,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655334249] [2022-04-15 13:02:22,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:02:22,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:02:22,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:02:22,435 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:02:22,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 13:02:22,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:02:22,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:02:22,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-15 13:02:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:22,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:02:22,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {11775#true} call ULTIMATE.init(); {11775#true} is VALID [2022-04-15 13:02:22,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {11775#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {11775#true} is VALID [2022-04-15 13:02:22,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {11775#true} assume true; {11775#true} is VALID [2022-04-15 13:02:22,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11775#true} {11775#true} #62#return; {11775#true} is VALID [2022-04-15 13:02:22,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {11775#true} call #t~ret5 := main(); {11775#true} is VALID [2022-04-15 13:02:22,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {11775#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {11775#true} is VALID [2022-04-15 13:02:22,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {11775#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {11780#(= main_~i~0 0)} is VALID [2022-04-15 13:02:22,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {11780#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11781#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:02:22,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {11781#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11782#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:02:22,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {11782#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11783#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:02:22,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {11783#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11784#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:02:22,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {11784#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11785#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:02:22,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {11785#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11786#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:02:22,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {11786#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11787#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:02:22,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {11787#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11788#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:02:22,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {11788#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11789#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:02:22,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {11789#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11790#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:02:22,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {11790#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11791#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:02:22,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {11791#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11792#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:02:22,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {11792#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11793#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:02:22,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {11793#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11794#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:02:22,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {11794#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11795#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:02:22,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {11795#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11796#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:02:22,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {11796#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11797#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:02:22,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {11797#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11798#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:02:22,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {11798#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11799#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:02:22,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {11799#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11800#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:02:22,991 INFO L290 TraceCheckUtils]: 27: Hoare triple {11800#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11801#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:02:22,995 INFO L290 TraceCheckUtils]: 28: Hoare triple {11801#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11802#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:02:22,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {11802#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11803#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:02:23,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {11803#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11804#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:02:23,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {11804#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11805#(and (<= 100 main_~i~0) (<= main_~i~0 100))} is VALID [2022-04-15 13:02:23,007 INFO L290 TraceCheckUtils]: 32: Hoare triple {11805#(and (<= 100 main_~i~0) (<= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11806#(and (<= main_~i~0 104) (<= 104 main_~i~0))} is VALID [2022-04-15 13:02:23,011 INFO L290 TraceCheckUtils]: 33: Hoare triple {11806#(and (<= main_~i~0 104) (<= 104 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11807#(and (<= 108 main_~i~0) (<= main_~i~0 108))} is VALID [2022-04-15 13:02:23,015 INFO L290 TraceCheckUtils]: 34: Hoare triple {11807#(and (<= 108 main_~i~0) (<= main_~i~0 108))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11915#(and (<= 114 main_~j~0) (<= main_~j~0 114))} is VALID [2022-04-15 13:02:23,016 INFO L290 TraceCheckUtils]: 35: Hoare triple {11915#(and (<= 114 main_~j~0) (<= main_~j~0 114))} assume !(~i~0 < ~n~0); {11915#(and (<= 114 main_~j~0) (<= main_~j~0 114))} is VALID [2022-04-15 13:02:23,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {11915#(and (<= 114 main_~j~0) (<= main_~j~0 114))} ~k~0 := ~i~0; {11915#(and (<= 114 main_~j~0) (<= main_~j~0 114))} is VALID [2022-04-15 13:02:23,017 INFO L290 TraceCheckUtils]: 37: Hoare triple {11915#(and (<= 114 main_~j~0) (<= main_~j~0 114))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {11776#false} is VALID [2022-04-15 13:02:23,017 INFO L272 TraceCheckUtils]: 38: Hoare triple {11776#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {11776#false} is VALID [2022-04-15 13:02:23,017 INFO L290 TraceCheckUtils]: 39: Hoare triple {11776#false} ~cond := #in~cond; {11776#false} is VALID [2022-04-15 13:02:23,017 INFO L290 TraceCheckUtils]: 40: Hoare triple {11776#false} assume 0 == ~cond; {11776#false} is VALID [2022-04-15 13:02:23,017 INFO L290 TraceCheckUtils]: 41: Hoare triple {11776#false} assume !false; {11776#false} is VALID [2022-04-15 13:02:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:02:23,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:02:23,241 INFO L290 TraceCheckUtils]: 41: Hoare triple {11776#false} assume !false; {11776#false} is VALID [2022-04-15 13:02:23,241 INFO L290 TraceCheckUtils]: 40: Hoare triple {11776#false} assume 0 == ~cond; {11776#false} is VALID [2022-04-15 13:02:23,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {11776#false} ~cond := #in~cond; {11776#false} is VALID [2022-04-15 13:02:23,241 INFO L272 TraceCheckUtils]: 38: Hoare triple {11776#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {11776#false} is VALID [2022-04-15 13:02:23,242 INFO L290 TraceCheckUtils]: 37: Hoare triple {11949#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {11776#false} is VALID [2022-04-15 13:02:23,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {11949#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {11949#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:02:23,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {11949#(= (mod main_~j~0 2) 0)} assume !(~i~0 < ~n~0); {11949#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:02:23,252 INFO L290 TraceCheckUtils]: 34: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11949#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:02:23,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,275 INFO L290 TraceCheckUtils]: 29: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,284 INFO L290 TraceCheckUtils]: 27: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,289 INFO L290 TraceCheckUtils]: 26: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {11959#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {11775#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {11959#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:23,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {11775#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {11775#true} is VALID [2022-04-15 13:02:23,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {11775#true} call #t~ret5 := main(); {11775#true} is VALID [2022-04-15 13:02:23,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11775#true} {11775#true} #62#return; {11775#true} is VALID [2022-04-15 13:02:23,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {11775#true} assume true; {11775#true} is VALID [2022-04-15 13:02:23,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {11775#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {11775#true} is VALID [2022-04-15 13:02:23,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {11775#true} call ULTIMATE.init(); {11775#true} is VALID [2022-04-15 13:02:23,374 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2022-04-15 13:02:23,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655334249] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:02:23,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:02:23,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 4] total 35 [2022-04-15 13:02:23,375 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:02:23,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1876120383] [2022-04-15 13:02:23,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1876120383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:02:23,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:02:23,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 13:02:23,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083369189] [2022-04-15 13:02:23,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:02:23,376 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 42 [2022-04-15 13:02:23,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:02:23,376 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-15 13:02:23,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:23,463 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 13:02:23,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:23,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 13:02:23,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 13:02:23,464 INFO L87 Difference]: Start difference. First operand 43 states and 43 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-15 13:02:32,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:32,861 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 13:02:32,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 13:02:32,862 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 42 [2022-04-15 13:02:32,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:02:32,862 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-15 13:02:32,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 51 transitions. [2022-04-15 13:02:32,863 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-15 13:02:32,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 51 transitions. [2022-04-15 13:02:32,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 51 transitions. [2022-04-15 13:02:33,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:33,014 INFO L225 Difference]: With dead ends: 51 [2022-04-15 13:02:33,014 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 13:02:33,014 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=243, Invalid=3789, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 13:02:33,015 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:02:33,015 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 161 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-15 13:02:33,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 13:02:33,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-15 13:02:33,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:02:33,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:33,059 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:33,059 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:33,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:33,059 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 13:02:33,059 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 13:02:33,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:33,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:33,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 13:02:33,060 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 13:02:33,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:33,060 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 13:02:33,060 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 13:02:33,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:33,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:33,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:02:33,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:02:33,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:33,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-04-15 13:02:33,062 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2022-04-15 13:02:33,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:02:33,062 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-04-15 13:02:33,062 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-15 13:02:33,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 44 transitions. [2022-04-15 13:02:33,274 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-15 13:02:33,274 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 13:02:33,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 13:02:33,275 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:02:33,275 INFO L499 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:02:33,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 13:02:33,479 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:02:33,479 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:02:33,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:02:33,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1790207230, now seen corresponding path program 57 times [2022-04-15 13:02:33,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:33,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2143807266] [2022-04-15 13:02:33,783 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:02:33,783 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:02:33,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1790207230, now seen corresponding path program 58 times [2022-04-15 13:02:33,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:02:33,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788324157] [2022-04-15 13:02:33,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:02:33,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:02:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:34,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:02:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:34,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {12435#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {12400#true} is VALID [2022-04-15 13:02:34,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {12400#true} assume true; {12400#true} is VALID [2022-04-15 13:02:34,461 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12400#true} {12400#true} #62#return; {12400#true} is VALID [2022-04-15 13:02:34,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {12400#true} call ULTIMATE.init(); {12435#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:02:34,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {12435#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {12400#true} is VALID [2022-04-15 13:02:34,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {12400#true} assume true; {12400#true} is VALID [2022-04-15 13:02:34,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12400#true} {12400#true} #62#return; {12400#true} is VALID [2022-04-15 13:02:34,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {12400#true} call #t~ret5 := main(); {12400#true} is VALID [2022-04-15 13:02:34,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {12400#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {12400#true} is VALID [2022-04-15 13:02:34,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {12400#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {12405#(= main_~i~0 0)} is VALID [2022-04-15 13:02:34,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {12405#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12406#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:02:34,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {12406#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12407#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:02:34,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {12407#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12408#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:02:34,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {12408#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12409#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:02:34,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {12409#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12410#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:02:34,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {12410#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12411#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:02:34,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {12411#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12412#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:02:34,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {12412#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12413#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:02:34,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {12413#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12414#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:02:34,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {12414#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12415#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:02:34,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {12415#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12416#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:02:34,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {12416#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12417#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:02:34,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {12417#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12418#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:02:34,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {12418#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12419#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:02:34,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {12419#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12420#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:02:34,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {12420#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12421#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:02:34,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {12421#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12422#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:02:34,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {12422#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12423#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:02:34,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {12423#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12424#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:02:34,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {12424#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12425#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:02:34,546 INFO L290 TraceCheckUtils]: 27: Hoare triple {12425#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12426#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:02:34,550 INFO L290 TraceCheckUtils]: 28: Hoare triple {12426#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12427#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:02:34,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {12427#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12428#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:02:34,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {12428#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12429#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:02:34,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {12429#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12430#(and (<= 100 main_~i~0) (<= main_~i~0 100))} is VALID [2022-04-15 13:02:34,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {12430#(and (<= 100 main_~i~0) (<= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12431#(and (<= main_~i~0 104) (<= 104 main_~i~0))} is VALID [2022-04-15 13:02:34,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {12431#(and (<= main_~i~0 104) (<= 104 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12432#(and (<= 108 main_~i~0) (<= main_~i~0 108))} is VALID [2022-04-15 13:02:34,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {12432#(and (<= 108 main_~i~0) (<= main_~i~0 108))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12433#(and (<= 112 main_~i~0) (<= main_~i~0 112))} is VALID [2022-04-15 13:02:34,576 INFO L290 TraceCheckUtils]: 35: Hoare triple {12433#(and (<= 112 main_~i~0) (<= main_~i~0 112))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12434#(and (<= 118 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:02:34,576 INFO L290 TraceCheckUtils]: 36: Hoare triple {12434#(and (<= 118 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(~i~0 < ~n~0); {12434#(and (<= 118 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:02:34,576 INFO L290 TraceCheckUtils]: 37: Hoare triple {12434#(and (<= 118 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} ~k~0 := ~i~0; {12434#(and (<= 118 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} is VALID [2022-04-15 13:02:34,578 INFO L290 TraceCheckUtils]: 38: Hoare triple {12434#(and (<= 118 main_~j~0) (<= main_~j~0 (* 2 (div main_~j~0 2))))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {12401#false} is VALID [2022-04-15 13:02:34,578 INFO L272 TraceCheckUtils]: 39: Hoare triple {12401#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {12401#false} is VALID [2022-04-15 13:02:34,578 INFO L290 TraceCheckUtils]: 40: Hoare triple {12401#false} ~cond := #in~cond; {12401#false} is VALID [2022-04-15 13:02:34,578 INFO L290 TraceCheckUtils]: 41: Hoare triple {12401#false} assume 0 == ~cond; {12401#false} is VALID [2022-04-15 13:02:34,578 INFO L290 TraceCheckUtils]: 42: Hoare triple {12401#false} assume !false; {12401#false} is VALID [2022-04-15 13:02:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:02:34,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:02:34,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788324157] [2022-04-15 13:02:34,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788324157] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:02:34,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226858911] [2022-04-15 13:02:34,579 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:02:34,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:02:34,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:02:34,580 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:02:34,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 13:02:34,626 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:02:34,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:02:34,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-15 13:02:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:34,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:02:35,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {12400#true} call ULTIMATE.init(); {12400#true} is VALID [2022-04-15 13:02:35,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {12400#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {12400#true} is VALID [2022-04-15 13:02:35,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {12400#true} assume true; {12400#true} is VALID [2022-04-15 13:02:35,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12400#true} {12400#true} #62#return; {12400#true} is VALID [2022-04-15 13:02:35,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {12400#true} call #t~ret5 := main(); {12400#true} is VALID [2022-04-15 13:02:35,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {12400#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {12400#true} is VALID [2022-04-15 13:02:35,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {12400#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {12405#(= main_~i~0 0)} is VALID [2022-04-15 13:02:35,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {12405#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12406#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:02:35,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {12406#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12407#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:02:35,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {12407#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12408#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:02:35,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {12408#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12409#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:02:35,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {12409#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12410#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:02:35,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {12410#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12411#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:02:35,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {12411#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12412#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:02:35,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {12412#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12413#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:02:35,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {12413#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12414#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:02:35,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {12414#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12415#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:02:35,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {12415#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12416#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:02:35,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {12416#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12417#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:02:35,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {12417#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12418#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:02:35,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {12418#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12419#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:02:35,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {12419#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12420#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:02:35,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {12420#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12421#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:02:35,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {12421#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12422#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:02:35,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {12422#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12423#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:02:35,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {12423#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12424#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:02:35,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {12424#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12425#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:02:35,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {12425#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12426#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:02:35,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {12426#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12427#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:02:35,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {12427#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12428#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:02:35,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {12428#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12429#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:02:35,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {12429#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12430#(and (<= 100 main_~i~0) (<= main_~i~0 100))} is VALID [2022-04-15 13:02:35,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {12430#(and (<= 100 main_~i~0) (<= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12431#(and (<= main_~i~0 104) (<= 104 main_~i~0))} is VALID [2022-04-15 13:02:35,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {12431#(and (<= main_~i~0 104) (<= 104 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12432#(and (<= 108 main_~i~0) (<= main_~i~0 108))} is VALID [2022-04-15 13:02:35,216 INFO L290 TraceCheckUtils]: 34: Hoare triple {12432#(and (<= 108 main_~i~0) (<= main_~i~0 108))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12433#(and (<= 112 main_~i~0) (<= main_~i~0 112))} is VALID [2022-04-15 13:02:35,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {12433#(and (<= 112 main_~i~0) (<= main_~i~0 112))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12544#(and (<= 118 main_~j~0) (<= main_~j~0 118))} is VALID [2022-04-15 13:02:35,223 INFO L290 TraceCheckUtils]: 36: Hoare triple {12544#(and (<= 118 main_~j~0) (<= main_~j~0 118))} assume !(~i~0 < ~n~0); {12544#(and (<= 118 main_~j~0) (<= main_~j~0 118))} is VALID [2022-04-15 13:02:35,223 INFO L290 TraceCheckUtils]: 37: Hoare triple {12544#(and (<= 118 main_~j~0) (<= main_~j~0 118))} ~k~0 := ~i~0; {12544#(and (<= 118 main_~j~0) (<= main_~j~0 118))} is VALID [2022-04-15 13:02:35,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {12544#(and (<= 118 main_~j~0) (<= main_~j~0 118))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {12401#false} is VALID [2022-04-15 13:02:35,225 INFO L272 TraceCheckUtils]: 39: Hoare triple {12401#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {12401#false} is VALID [2022-04-15 13:02:35,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {12401#false} ~cond := #in~cond; {12401#false} is VALID [2022-04-15 13:02:35,225 INFO L290 TraceCheckUtils]: 41: Hoare triple {12401#false} assume 0 == ~cond; {12401#false} is VALID [2022-04-15 13:02:35,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {12401#false} assume !false; {12401#false} is VALID [2022-04-15 13:02:35,225 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:02:35,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:02:35,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {12401#false} assume !false; {12401#false} is VALID [2022-04-15 13:02:35,468 INFO L290 TraceCheckUtils]: 41: Hoare triple {12401#false} assume 0 == ~cond; {12401#false} is VALID [2022-04-15 13:02:35,468 INFO L290 TraceCheckUtils]: 40: Hoare triple {12401#false} ~cond := #in~cond; {12401#false} is VALID [2022-04-15 13:02:35,469 INFO L272 TraceCheckUtils]: 39: Hoare triple {12401#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {12401#false} is VALID [2022-04-15 13:02:35,469 INFO L290 TraceCheckUtils]: 38: Hoare triple {12578#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {12401#false} is VALID [2022-04-15 13:02:35,469 INFO L290 TraceCheckUtils]: 37: Hoare triple {12578#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {12578#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:02:35,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {12578#(= (mod main_~j~0 2) 0)} assume !(~i~0 < ~n~0); {12578#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:02:35,481 INFO L290 TraceCheckUtils]: 35: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12578#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:02:35,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,505 INFO L290 TraceCheckUtils]: 32: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,573 INFO L290 TraceCheckUtils]: 22: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {12588#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {12400#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {12588#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:35,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {12400#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {12400#true} is VALID [2022-04-15 13:02:35,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {12400#true} call #t~ret5 := main(); {12400#true} is VALID [2022-04-15 13:02:35,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12400#true} {12400#true} #62#return; {12400#true} is VALID [2022-04-15 13:02:35,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {12400#true} assume true; {12400#true} is VALID [2022-04-15 13:02:35,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {12400#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {12400#true} is VALID [2022-04-15 13:02:35,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {12400#true} call ULTIMATE.init(); {12400#true} is VALID [2022-04-15 13:02:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2022-04-15 13:02:35,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226858911] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:02:35,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:02:35,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 4] total 36 [2022-04-15 13:02:35,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:02:35,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2143807266] [2022-04-15 13:02:35,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2143807266] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:02:35,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:02:35,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 13:02:35,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89555860] [2022-04-15 13:02:35,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:02:35,703 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 43 [2022-04-15 13:02:35,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:02:35,703 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-15 13:02:35,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:35,779 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 13:02:35,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:35,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 13:02:35,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 13:02:35,780 INFO L87 Difference]: Start difference. First operand 44 states and 44 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-15 13:02:47,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:47,454 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 13:02:47,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 13:02:47,454 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 43 [2022-04-15 13:02:47,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:02:47,454 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-15 13:02:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 52 transitions. [2022-04-15 13:02:47,455 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-15 13:02:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 52 transitions. [2022-04-15 13:02:47,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 52 transitions. [2022-04-15 13:02:47,575 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-15 13:02:47,576 INFO L225 Difference]: With dead ends: 52 [2022-04-15 13:02:47,576 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 13:02:47,577 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=251, Invalid=4039, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 13:02:47,577 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:02:47,577 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 166 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-15 13:02:47,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 13:02:47,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-15 13:02:47,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:02:47,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:47,622 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:47,622 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:47,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:47,623 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 13:02:47,623 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 13:02:47,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:47,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:47,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 13:02:47,623 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 13:02:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:47,624 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 13:02:47,624 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 13:02:47,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:47,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:47,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:02:47,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:02:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:47,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-15 13:02:47,625 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2022-04-15 13:02:47,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:02:47,625 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-15 13:02:47,626 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-15 13:02:47,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-15 13:02:47,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:47,788 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 13:02:47,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 13:02:47,788 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:02:47,788 INFO L499 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:02:47,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 13:02:47,991 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:02:47,991 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:02:47,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:02:47,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1894247889, now seen corresponding path program 59 times [2022-04-15 13:02:47,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:47,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2142509538] [2022-04-15 13:02:48,305 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:02:48,306 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:02:48,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1894247889, now seen corresponding path program 60 times [2022-04-15 13:02:48,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:02:48,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466649131] [2022-04-15 13:02:48,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:02:48,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:02:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:48,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:02:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:48,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {13076#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {13040#true} is VALID [2022-04-15 13:02:48,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {13040#true} assume true; {13040#true} is VALID [2022-04-15 13:02:48,936 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13040#true} {13040#true} #62#return; {13040#true} is VALID [2022-04-15 13:02:48,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {13040#true} call ULTIMATE.init(); {13076#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:02:48,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {13076#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {13040#true} is VALID [2022-04-15 13:02:48,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {13040#true} assume true; {13040#true} is VALID [2022-04-15 13:02:48,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13040#true} {13040#true} #62#return; {13040#true} is VALID [2022-04-15 13:02:48,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {13040#true} call #t~ret5 := main(); {13040#true} is VALID [2022-04-15 13:02:48,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {13040#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {13040#true} is VALID [2022-04-15 13:02:48,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {13040#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {13045#(= main_~i~0 0)} is VALID [2022-04-15 13:02:48,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {13045#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13046#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:02:48,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {13046#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13047#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:02:48,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {13047#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13048#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:02:48,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {13048#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13049#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:02:48,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {13049#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13050#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:02:48,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {13050#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13051#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:02:48,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {13051#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13052#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:02:48,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {13052#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13053#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:02:48,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {13053#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13054#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:02:48,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {13054#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13055#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:02:48,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {13055#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13056#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:02:48,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {13056#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13057#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:02:49,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {13057#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13058#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:02:49,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {13058#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13059#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:02:49,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {13059#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13060#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:02:49,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {13060#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13061#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:02:49,038 INFO L290 TraceCheckUtils]: 23: Hoare triple {13061#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13062#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:02:49,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {13062#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13063#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:02:49,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {13063#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13064#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:02:49,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {13064#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13065#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:02:49,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {13065#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13066#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:02:49,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {13066#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13067#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:02:49,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {13067#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13068#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:02:49,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {13068#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13069#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:02:49,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {13069#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13070#(and (<= 100 main_~i~0) (<= main_~i~0 100))} is VALID [2022-04-15 13:02:49,095 INFO L290 TraceCheckUtils]: 32: Hoare triple {13070#(and (<= 100 main_~i~0) (<= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13071#(and (<= main_~i~0 104) (<= 104 main_~i~0))} is VALID [2022-04-15 13:02:49,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {13071#(and (<= main_~i~0 104) (<= 104 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13072#(and (<= 108 main_~i~0) (<= main_~i~0 108))} is VALID [2022-04-15 13:02:49,108 INFO L290 TraceCheckUtils]: 34: Hoare triple {13072#(and (<= 108 main_~i~0) (<= main_~i~0 108))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13073#(and (<= 112 main_~i~0) (<= main_~i~0 112))} is VALID [2022-04-15 13:02:49,115 INFO L290 TraceCheckUtils]: 35: Hoare triple {13073#(and (<= 112 main_~i~0) (<= main_~i~0 112))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13074#(and (<= main_~i~0 116) (<= 116 main_~i~0))} is VALID [2022-04-15 13:02:49,122 INFO L290 TraceCheckUtils]: 36: Hoare triple {13074#(and (<= main_~i~0 116) (<= 116 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13075#(and (<= main_~j~0 (* 2 (div main_~j~0 2))) (<= 122 main_~j~0))} is VALID [2022-04-15 13:02:49,123 INFO L290 TraceCheckUtils]: 37: Hoare triple {13075#(and (<= main_~j~0 (* 2 (div main_~j~0 2))) (<= 122 main_~j~0))} assume !(~i~0 < ~n~0); {13075#(and (<= main_~j~0 (* 2 (div main_~j~0 2))) (<= 122 main_~j~0))} is VALID [2022-04-15 13:02:49,123 INFO L290 TraceCheckUtils]: 38: Hoare triple {13075#(and (<= main_~j~0 (* 2 (div main_~j~0 2))) (<= 122 main_~j~0))} ~k~0 := ~i~0; {13075#(and (<= main_~j~0 (* 2 (div main_~j~0 2))) (<= 122 main_~j~0))} is VALID [2022-04-15 13:02:49,125 INFO L290 TraceCheckUtils]: 39: Hoare triple {13075#(and (<= main_~j~0 (* 2 (div main_~j~0 2))) (<= 122 main_~j~0))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {13041#false} is VALID [2022-04-15 13:02:49,125 INFO L272 TraceCheckUtils]: 40: Hoare triple {13041#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {13041#false} is VALID [2022-04-15 13:02:49,125 INFO L290 TraceCheckUtils]: 41: Hoare triple {13041#false} ~cond := #in~cond; {13041#false} is VALID [2022-04-15 13:02:49,125 INFO L290 TraceCheckUtils]: 42: Hoare triple {13041#false} assume 0 == ~cond; {13041#false} is VALID [2022-04-15 13:02:49,125 INFO L290 TraceCheckUtils]: 43: Hoare triple {13041#false} assume !false; {13041#false} is VALID [2022-04-15 13:02:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:02:49,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:02:49,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466649131] [2022-04-15 13:02:49,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466649131] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:02:49,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045165694] [2022-04-15 13:02:49,126 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:02:49,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:02:49,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:02:49,127 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:02:49,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-15 13:02:49,182 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-15 13:02:49,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:02:49,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-15 13:02:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:49,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:02:50,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {13040#true} call ULTIMATE.init(); {13040#true} is VALID [2022-04-15 13:02:50,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {13040#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {13040#true} is VALID [2022-04-15 13:02:50,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {13040#true} assume true; {13040#true} is VALID [2022-04-15 13:02:50,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13040#true} {13040#true} #62#return; {13040#true} is VALID [2022-04-15 13:02:50,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {13040#true} call #t~ret5 := main(); {13040#true} is VALID [2022-04-15 13:02:50,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {13040#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {13040#true} is VALID [2022-04-15 13:02:50,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {13040#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {13045#(= main_~i~0 0)} is VALID [2022-04-15 13:02:50,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {13045#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13101#(and (< 0 main_~n~0) (= main_~i~0 4))} is VALID [2022-04-15 13:02:50,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {13101#(and (< 0 main_~n~0) (= main_~i~0 4))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13105#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 4)) 4))} is VALID [2022-04-15 13:02:50,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {13105#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 4)) 4))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13109#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 8)) 4))} is VALID [2022-04-15 13:02:50,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {13109#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 8)) 4))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13113#(and (< 0 main_~n~0) (= main_~i~0 16))} is VALID [2022-04-15 13:02:50,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {13113#(and (< 0 main_~n~0) (= main_~i~0 16))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13117#(and (< 0 main_~n~0) (= main_~i~0 20))} is VALID [2022-04-15 13:02:50,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {13117#(and (< 0 main_~n~0) (= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13121#(and (< 0 main_~n~0) (= main_~i~0 24))} is VALID [2022-04-15 13:02:50,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {13121#(and (< 0 main_~n~0) (= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13125#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 4)) 24))} is VALID [2022-04-15 13:02:50,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {13125#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 4)) 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13129#(and (< 0 main_~n~0) (= 32 main_~i~0))} is VALID [2022-04-15 13:02:50,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {13129#(and (< 0 main_~n~0) (= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13133#(and (< 0 main_~n~0) (= main_~i~0 36))} is VALID [2022-04-15 13:02:50,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {13133#(and (< 0 main_~n~0) (= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13137#(and (< 0 main_~n~0) (= 40 main_~i~0))} is VALID [2022-04-15 13:02:50,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {13137#(and (< 0 main_~n~0) (= 40 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13141#(and (< 0 main_~n~0) (= 44 main_~i~0))} is VALID [2022-04-15 13:02:50,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {13141#(and (< 0 main_~n~0) (= 44 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13145#(and (< 0 main_~n~0) (= 44 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:02:50,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {13145#(and (< 0 main_~n~0) (= 44 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13149#(and (< 0 main_~n~0) (= 44 (+ main_~i~0 (- 8))))} is VALID [2022-04-15 13:02:50,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {13149#(and (< 0 main_~n~0) (= 44 (+ main_~i~0 (- 8))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13153#(and (< 0 main_~n~0) (= 44 (+ main_~i~0 (- 12))))} is VALID [2022-04-15 13:02:50,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {13153#(and (< 0 main_~n~0) (= 44 (+ main_~i~0 (- 12))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13157#(and (< 0 main_~n~0) (= 44 (+ (- 16) main_~i~0)))} is VALID [2022-04-15 13:02:50,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {13157#(and (< 0 main_~n~0) (= 44 (+ (- 16) main_~i~0)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13161#(and (< 0 main_~n~0) (= 64 main_~i~0))} is VALID [2022-04-15 13:02:50,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {13161#(and (< 0 main_~n~0) (= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13165#(and (< 0 main_~n~0) (= 68 main_~i~0))} is VALID [2022-04-15 13:02:50,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {13165#(and (< 0 main_~n~0) (= 68 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13169#(and (< 0 main_~n~0) (= 72 main_~i~0))} is VALID [2022-04-15 13:02:50,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {13169#(and (< 0 main_~n~0) (= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13173#(and (< 0 main_~n~0) (= 76 main_~i~0))} is VALID [2022-04-15 13:02:50,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {13173#(and (< 0 main_~n~0) (= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13177#(and (< 0 main_~n~0) (= main_~i~0 80))} is VALID [2022-04-15 13:02:50,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {13177#(and (< 0 main_~n~0) (= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13181#(and (< 0 main_~n~0) (= 84 main_~i~0))} is VALID [2022-04-15 13:02:50,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {13181#(and (< 0 main_~n~0) (= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13185#(and (< 0 main_~n~0) (= 88 main_~i~0))} is VALID [2022-04-15 13:02:50,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {13185#(and (< 0 main_~n~0) (= 88 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13189#(and (< 0 main_~n~0) (= 92 main_~i~0))} is VALID [2022-04-15 13:02:50,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {13189#(and (< 0 main_~n~0) (= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13193#(and (< 0 main_~n~0) (= main_~i~0 96))} is VALID [2022-04-15 13:02:50,379 INFO L290 TraceCheckUtils]: 31: Hoare triple {13193#(and (< 0 main_~n~0) (= main_~i~0 96))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13197#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 4)) 96))} is VALID [2022-04-15 13:02:50,379 INFO L290 TraceCheckUtils]: 32: Hoare triple {13197#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 4)) 96))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13201#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 8)) 96))} is VALID [2022-04-15 13:02:50,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {13201#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 8)) 96))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13205#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 12)) 96))} is VALID [2022-04-15 13:02:50,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {13205#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 12)) 96))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13209#(and (< 0 main_~n~0) (= 112 main_~i~0))} is VALID [2022-04-15 13:02:50,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {13209#(and (< 0 main_~n~0) (= 112 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13213#(and (< 0 main_~n~0) (= 112 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:02:50,381 INFO L290 TraceCheckUtils]: 36: Hoare triple {13213#(and (< 0 main_~n~0) (= 112 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13217#(and (< 0 main_~n~0) (= main_~j~0 (+ main_~i~0 2)) (= main_~i~0 120))} is VALID [2022-04-15 13:02:50,381 INFO L290 TraceCheckUtils]: 37: Hoare triple {13217#(and (< 0 main_~n~0) (= main_~j~0 (+ main_~i~0 2)) (= main_~i~0 120))} assume !(~i~0 < ~n~0); {13221#(= main_~j~0 122)} is VALID [2022-04-15 13:02:50,381 INFO L290 TraceCheckUtils]: 38: Hoare triple {13221#(= main_~j~0 122)} ~k~0 := ~i~0; {13221#(= main_~j~0 122)} is VALID [2022-04-15 13:02:50,382 INFO L290 TraceCheckUtils]: 39: Hoare triple {13221#(= main_~j~0 122)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {13041#false} is VALID [2022-04-15 13:02:50,382 INFO L272 TraceCheckUtils]: 40: Hoare triple {13041#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {13041#false} is VALID [2022-04-15 13:02:50,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {13041#false} ~cond := #in~cond; {13041#false} is VALID [2022-04-15 13:02:50,382 INFO L290 TraceCheckUtils]: 42: Hoare triple {13041#false} assume 0 == ~cond; {13041#false} is VALID [2022-04-15 13:02:50,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {13041#false} assume !false; {13041#false} is VALID [2022-04-15 13:02:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:02:50,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:02:56,452 INFO L290 TraceCheckUtils]: 43: Hoare triple {13041#false} assume !false; {13041#false} is VALID [2022-04-15 13:02:56,452 INFO L290 TraceCheckUtils]: 42: Hoare triple {13041#false} assume 0 == ~cond; {13041#false} is VALID [2022-04-15 13:02:56,452 INFO L290 TraceCheckUtils]: 41: Hoare triple {13041#false} ~cond := #in~cond; {13041#false} is VALID [2022-04-15 13:02:56,452 INFO L272 TraceCheckUtils]: 40: Hoare triple {13041#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {13041#false} is VALID [2022-04-15 13:02:56,453 INFO L290 TraceCheckUtils]: 39: Hoare triple {13252#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {13041#false} is VALID [2022-04-15 13:02:56,453 INFO L290 TraceCheckUtils]: 38: Hoare triple {13252#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {13252#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:02:56,454 INFO L290 TraceCheckUtils]: 37: Hoare triple {13259#(or (< main_~i~0 main_~n~0) (= (mod main_~j~0 2) 0))} assume !(~i~0 < ~n~0); {13252#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:02:56,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {13263#(or (< (+ main_~i~0 4) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13259#(or (< main_~i~0 main_~n~0) (= (mod main_~j~0 2) 0))} is VALID [2022-04-15 13:02:56,471 INFO L290 TraceCheckUtils]: 35: Hoare triple {13267#(or (< (+ main_~i~0 8) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13263#(or (< (+ main_~i~0 4) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:02:56,477 INFO L290 TraceCheckUtils]: 34: Hoare triple {13271#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 12) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13267#(or (< (+ main_~i~0 8) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:02:56,488 INFO L290 TraceCheckUtils]: 33: Hoare triple {13275#(or (< (+ main_~i~0 16) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13271#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 12) main_~n~0))} is VALID [2022-04-15 13:02:56,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {13279#(or (< (+ main_~i~0 20) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13275#(or (< (+ main_~i~0 16) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:02:56,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {13283#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 24) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13279#(or (< (+ main_~i~0 20) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:02:56,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {13287#(or (< (+ main_~i~0 28) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13283#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 24) main_~n~0))} is VALID [2022-04-15 13:02:56,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {13291#(or (< (+ 32 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13287#(or (< (+ main_~i~0 28) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:02:56,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {13295#(or (< (+ main_~i~0 36) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13291#(or (< (+ 32 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:02:56,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {13299#(or (= 0 (mod main_~i~0 2)) (< (+ 40 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13295#(or (< (+ main_~i~0 36) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:02:56,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {13303#(or (= 0 (mod main_~i~0 2)) (< (+ 44 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13299#(or (= 0 (mod main_~i~0 2)) (< (+ 40 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:02:56,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {13307#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 48) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13303#(or (= 0 (mod main_~i~0 2)) (< (+ 44 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:02:56,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {13311#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 52) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13307#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 48) main_~n~0))} is VALID [2022-04-15 13:02:56,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {13315#(or (= 0 (mod main_~i~0 2)) (< (+ 56 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13311#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 52) main_~n~0))} is VALID [2022-04-15 13:02:56,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {13319#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 60) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13315#(or (= 0 (mod main_~i~0 2)) (< (+ 56 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:02:56,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {13323#(or (= 0 (mod main_~i~0 2)) (< (+ 64 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13319#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 60) main_~n~0))} is VALID [2022-04-15 13:02:56,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {13327#(or (= 0 (mod main_~i~0 2)) (< (+ 68 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13323#(or (= 0 (mod main_~i~0 2)) (< (+ 64 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:02:56,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {13331#(or (= 0 (mod main_~i~0 2)) (< (+ 72 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13327#(or (= 0 (mod main_~i~0 2)) (< (+ 68 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:02:56,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {13335#(or (< (+ 76 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13331#(or (= 0 (mod main_~i~0 2)) (< (+ 72 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:02:56,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {13339#(or (< (+ main_~i~0 80) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13335#(or (< (+ 76 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:02:56,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {13343#(or (= 0 (mod main_~i~0 2)) (< (+ 84 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13339#(or (< (+ main_~i~0 80) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:02:56,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {13347#(or (= 0 (mod main_~i~0 2)) (< (+ 88 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13343#(or (= 0 (mod main_~i~0 2)) (< (+ 84 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:02:56,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {13351#(or (= 0 (mod main_~i~0 2)) (< (+ 92 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13347#(or (= 0 (mod main_~i~0 2)) (< (+ 88 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:02:56,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {13355#(or (< (+ main_~i~0 96) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13351#(or (= 0 (mod main_~i~0 2)) (< (+ 92 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:02:56,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {13359#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 100) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13355#(or (< (+ main_~i~0 96) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:02:56,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {13363#(or (= 0 (mod main_~i~0 2)) (< (+ 104 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13359#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 100) main_~n~0))} is VALID [2022-04-15 13:02:56,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {13367#(or (= 0 (mod main_~i~0 2)) (< (+ 108 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13363#(or (= 0 (mod main_~i~0 2)) (< (+ 104 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:02:56,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {13371#(or (= 0 (mod main_~i~0 2)) (< (+ 112 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13367#(or (= 0 (mod main_~i~0 2)) (< (+ 108 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:02:56,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {13375#(or (< (+ 116 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13371#(or (= 0 (mod main_~i~0 2)) (< (+ 112 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:02:56,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {13379#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13375#(or (< (+ 116 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:02:56,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {13040#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {13379#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:02:56,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {13040#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {13040#true} is VALID [2022-04-15 13:02:56,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {13040#true} call #t~ret5 := main(); {13040#true} is VALID [2022-04-15 13:02:56,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13040#true} {13040#true} #62#return; {13040#true} is VALID [2022-04-15 13:02:56,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {13040#true} assume true; {13040#true} is VALID [2022-04-15 13:02:56,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {13040#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {13040#true} is VALID [2022-04-15 13:02:56,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {13040#true} call ULTIMATE.init(); {13040#true} is VALID [2022-04-15 13:02:56,682 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:02:56,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045165694] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:02:56,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:02:56,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 97 [2022-04-15 13:02:56,683 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:02:56,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2142509538] [2022-04-15 13:02:56,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2142509538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:02:56,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:02:56,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 13:02:56,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514707198] [2022-04-15 13:02:56,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:02:56,684 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 44 [2022-04-15 13:02:56,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:02:56,684 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-15 13:02:56,755 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-15 13:02:56,755 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 13:02:56,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:56,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 13:02:56,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2465, Invalid=6847, Unknown=0, NotChecked=0, Total=9312 [2022-04-15 13:02:56,757 INFO L87 Difference]: Start difference. First operand 45 states and 45 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-15 13:03:15,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:15,007 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-15 13:03:15,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 13:03:15,007 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 44 [2022-04-15 13:03:15,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:03:15,007 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-15 13:03:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 53 transitions. [2022-04-15 13:03:15,008 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-15 13:03:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 53 transitions. [2022-04-15 13:03:15,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 53 transitions. [2022-04-15 13:03:15,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:03:15,212 INFO L225 Difference]: With dead ends: 53 [2022-04-15 13:03:15,212 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 13:03:15,213 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3814 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=3491, Invalid=12765, Unknown=0, NotChecked=0, Total=16256 [2022-04-15 13:03:15,214 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:03:15,214 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 171 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-04-15 13:03:15,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 13:03:15,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-15 13:03:15,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:03:15,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:15,268 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:15,269 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:15,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:15,269 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 13:03:15,269 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 13:03:15,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:03:15,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:03:15,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 13:03:15,270 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 13:03:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:15,270 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 13:03:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 13:03:15,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:03:15,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:03:15,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:03:15,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:03:15,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:15,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-04-15 13:03:15,272 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2022-04-15 13:03:15,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:03:15,272 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-04-15 13:03:15,272 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-15 13:03:15,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 46 transitions. [2022-04-15 13:03:15,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:03:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 13:03:15,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 13:03:15,561 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:03:15,561 INFO L499 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:03:15,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-15 13:03:15,761 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,SelfDestructingSolverStorable31 [2022-04-15 13:03:15,761 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:03:15,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:03:15,761 INFO L85 PathProgramCache]: Analyzing trace with hash 824541022, now seen corresponding path program 61 times [2022-04-15 13:03:15,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:03:15,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [993188857] [2022-04-15 13:03:16,072 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:03:16,072 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:03:16,073 INFO L85 PathProgramCache]: Analyzing trace with hash 824541022, now seen corresponding path program 62 times [2022-04-15 13:03:16,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:03:16,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237495471] [2022-04-15 13:03:16,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:03:16,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:03:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:16,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:03:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:16,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {13792#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {13755#true} is VALID [2022-04-15 13:03:16,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {13755#true} assume true; {13755#true} is VALID [2022-04-15 13:03:16,874 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13755#true} {13755#true} #62#return; {13755#true} is VALID [2022-04-15 13:03:16,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {13755#true} call ULTIMATE.init(); {13792#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:03:16,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {13792#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {13755#true} is VALID [2022-04-15 13:03:16,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {13755#true} assume true; {13755#true} is VALID [2022-04-15 13:03:16,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13755#true} {13755#true} #62#return; {13755#true} is VALID [2022-04-15 13:03:16,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {13755#true} call #t~ret5 := main(); {13755#true} is VALID [2022-04-15 13:03:16,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {13755#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {13755#true} is VALID [2022-04-15 13:03:16,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {13755#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {13760#(= main_~i~0 0)} is VALID [2022-04-15 13:03:16,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {13760#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13761#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:03:16,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {13761#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13762#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:03:16,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {13762#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13763#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:03:16,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {13763#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13764#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:03:16,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {13764#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13765#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:03:16,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {13765#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13766#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:03:16,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {13766#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13767#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:03:16,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {13767#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13768#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:03:16,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {13768#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13769#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:03:16,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {13769#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13770#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:03:16,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {13770#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13771#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:03:16,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {13771#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13772#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:03:16,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {13772#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13773#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:03:16,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {13773#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13774#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:03:16,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {13774#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13775#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:03:17,004 INFO L290 TraceCheckUtils]: 22: Hoare triple {13775#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13776#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:03:17,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {13776#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13777#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:03:17,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {13777#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13778#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:03:17,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {13778#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13779#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:03:17,036 INFO L290 TraceCheckUtils]: 26: Hoare triple {13779#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13780#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:03:17,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {13780#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13781#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:03:17,057 INFO L290 TraceCheckUtils]: 28: Hoare triple {13781#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13782#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:03:17,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {13782#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13783#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:03:17,073 INFO L290 TraceCheckUtils]: 30: Hoare triple {13783#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13784#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:03:17,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {13784#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13785#(and (<= 100 main_~i~0) (<= main_~i~0 100))} is VALID [2022-04-15 13:03:17,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {13785#(and (<= 100 main_~i~0) (<= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13786#(and (<= main_~i~0 104) (<= 104 main_~i~0))} is VALID [2022-04-15 13:03:17,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {13786#(and (<= main_~i~0 104) (<= 104 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13787#(and (<= 108 main_~i~0) (<= main_~i~0 108))} is VALID [2022-04-15 13:03:17,113 INFO L290 TraceCheckUtils]: 34: Hoare triple {13787#(and (<= 108 main_~i~0) (<= main_~i~0 108))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13788#(and (<= 112 main_~i~0) (<= main_~i~0 112))} is VALID [2022-04-15 13:03:17,125 INFO L290 TraceCheckUtils]: 35: Hoare triple {13788#(and (<= 112 main_~i~0) (<= main_~i~0 112))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13789#(and (<= main_~i~0 116) (<= 116 main_~i~0))} is VALID [2022-04-15 13:03:17,135 INFO L290 TraceCheckUtils]: 36: Hoare triple {13789#(and (<= main_~i~0 116) (<= 116 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13790#(and (<= main_~i~0 120) (<= 120 main_~i~0))} is VALID [2022-04-15 13:03:17,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {13790#(and (<= main_~i~0 120) (<= 120 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13791#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:03:17,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {13791#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {13791#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:03:17,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {13791#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {13791#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:03:17,150 INFO L290 TraceCheckUtils]: 40: Hoare triple {13791#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {13756#false} is VALID [2022-04-15 13:03:17,150 INFO L272 TraceCheckUtils]: 41: Hoare triple {13756#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {13756#false} is VALID [2022-04-15 13:03:17,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {13756#false} ~cond := #in~cond; {13756#false} is VALID [2022-04-15 13:03:17,150 INFO L290 TraceCheckUtils]: 43: Hoare triple {13756#false} assume 0 == ~cond; {13756#false} is VALID [2022-04-15 13:03:17,150 INFO L290 TraceCheckUtils]: 44: Hoare triple {13756#false} assume !false; {13756#false} is VALID [2022-04-15 13:03:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:03:17,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:03:17,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237495471] [2022-04-15 13:03:17,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237495471] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:03:17,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650190060] [2022-04-15 13:03:17,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:03:17,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:03:17,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:03:17,152 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:03:17,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 13:03:17,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:03:17,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:03:17,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-15 13:03:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:17,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:03:17,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {13755#true} call ULTIMATE.init(); {13755#true} is VALID [2022-04-15 13:03:17,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {13755#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {13755#true} is VALID [2022-04-15 13:03:17,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {13755#true} assume true; {13755#true} is VALID [2022-04-15 13:03:17,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13755#true} {13755#true} #62#return; {13755#true} is VALID [2022-04-15 13:03:17,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {13755#true} call #t~ret5 := main(); {13755#true} is VALID [2022-04-15 13:03:17,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {13755#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {13755#true} is VALID [2022-04-15 13:03:17,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {13755#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {13760#(= main_~i~0 0)} is VALID [2022-04-15 13:03:17,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {13760#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13761#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:03:17,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {13761#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13762#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:03:17,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {13762#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13763#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:03:17,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {13763#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13764#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:03:17,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {13764#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13765#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:03:17,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {13765#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13766#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:03:17,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {13766#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13767#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:03:17,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {13767#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13768#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:03:17,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {13768#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13769#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:03:17,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {13769#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13770#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:03:17,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {13770#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13771#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:03:17,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {13771#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13772#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:03:17,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {13772#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13773#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:03:17,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {13773#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13774#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:03:17,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {13774#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13775#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:03:17,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {13775#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13776#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:03:17,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {13776#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13777#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:03:17,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {13777#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13778#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:03:17,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {13778#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13779#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:03:17,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {13779#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13780#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:03:17,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {13780#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13781#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:03:17,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {13781#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13782#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:03:17,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {13782#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13783#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:03:17,905 INFO L290 TraceCheckUtils]: 30: Hoare triple {13783#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13784#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:03:17,911 INFO L290 TraceCheckUtils]: 31: Hoare triple {13784#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13785#(and (<= 100 main_~i~0) (<= main_~i~0 100))} is VALID [2022-04-15 13:03:17,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {13785#(and (<= 100 main_~i~0) (<= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13786#(and (<= main_~i~0 104) (<= 104 main_~i~0))} is VALID [2022-04-15 13:03:17,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {13786#(and (<= main_~i~0 104) (<= 104 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13787#(and (<= 108 main_~i~0) (<= main_~i~0 108))} is VALID [2022-04-15 13:03:17,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {13787#(and (<= 108 main_~i~0) (<= main_~i~0 108))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13788#(and (<= 112 main_~i~0) (<= main_~i~0 112))} is VALID [2022-04-15 13:03:17,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {13788#(and (<= 112 main_~i~0) (<= main_~i~0 112))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13789#(and (<= main_~i~0 116) (<= 116 main_~i~0))} is VALID [2022-04-15 13:03:17,942 INFO L290 TraceCheckUtils]: 36: Hoare triple {13789#(and (<= main_~i~0 116) (<= 116 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13790#(and (<= main_~i~0 120) (<= 120 main_~i~0))} is VALID [2022-04-15 13:03:17,952 INFO L290 TraceCheckUtils]: 37: Hoare triple {13790#(and (<= main_~i~0 120) (<= 120 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13907#(and (<= main_~j~0 126) (<= 126 main_~j~0))} is VALID [2022-04-15 13:03:17,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {13907#(and (<= main_~j~0 126) (<= 126 main_~j~0))} assume !(~i~0 < ~n~0); {13907#(and (<= main_~j~0 126) (<= 126 main_~j~0))} is VALID [2022-04-15 13:03:17,953 INFO L290 TraceCheckUtils]: 39: Hoare triple {13907#(and (<= main_~j~0 126) (<= 126 main_~j~0))} ~k~0 := ~i~0; {13907#(and (<= main_~j~0 126) (<= 126 main_~j~0))} is VALID [2022-04-15 13:03:17,954 INFO L290 TraceCheckUtils]: 40: Hoare triple {13907#(and (<= main_~j~0 126) (<= 126 main_~j~0))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {13756#false} is VALID [2022-04-15 13:03:17,954 INFO L272 TraceCheckUtils]: 41: Hoare triple {13756#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {13756#false} is VALID [2022-04-15 13:03:17,954 INFO L290 TraceCheckUtils]: 42: Hoare triple {13756#false} ~cond := #in~cond; {13756#false} is VALID [2022-04-15 13:03:17,954 INFO L290 TraceCheckUtils]: 43: Hoare triple {13756#false} assume 0 == ~cond; {13756#false} is VALID [2022-04-15 13:03:17,954 INFO L290 TraceCheckUtils]: 44: Hoare triple {13756#false} assume !false; {13756#false} is VALID [2022-04-15 13:03:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:03:17,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:03:20,797 INFO L290 TraceCheckUtils]: 44: Hoare triple {13756#false} assume !false; {13756#false} is VALID [2022-04-15 13:03:20,797 INFO L290 TraceCheckUtils]: 43: Hoare triple {13756#false} assume 0 == ~cond; {13756#false} is VALID [2022-04-15 13:03:20,797 INFO L290 TraceCheckUtils]: 42: Hoare triple {13756#false} ~cond := #in~cond; {13756#false} is VALID [2022-04-15 13:03:20,797 INFO L272 TraceCheckUtils]: 41: Hoare triple {13756#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {13756#false} is VALID [2022-04-15 13:03:20,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {13791#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {13756#false} is VALID [2022-04-15 13:03:20,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {13791#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {13791#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:03:20,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {13791#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {13791#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:03:20,814 INFO L290 TraceCheckUtils]: 37: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13791#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:03:20,823 INFO L290 TraceCheckUtils]: 36: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:20,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:20,839 INFO L290 TraceCheckUtils]: 34: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:20,848 INFO L290 TraceCheckUtils]: 33: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:20,856 INFO L290 TraceCheckUtils]: 32: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:20,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:20,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:20,882 INFO L290 TraceCheckUtils]: 29: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:20,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:20,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:20,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:20,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:20,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:20,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:20,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:20,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:20,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:20,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:20,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:20,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:20,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:21,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:21,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:21,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:21,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:21,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:21,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:21,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:21,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:21,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:21,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {13755#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {13950#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:21,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {13755#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {13755#true} is VALID [2022-04-15 13:03:21,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {13755#true} call #t~ret5 := main(); {13755#true} is VALID [2022-04-15 13:03:21,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13755#true} {13755#true} #62#return; {13755#true} is VALID [2022-04-15 13:03:21,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {13755#true} assume true; {13755#true} is VALID [2022-04-15 13:03:21,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {13755#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {13755#true} is VALID [2022-04-15 13:03:21,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {13755#true} call ULTIMATE.init(); {13755#true} is VALID [2022-04-15 13:03:21,091 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-04-15 13:03:21,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650190060] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:03:21,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:03:21,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 4] total 37 [2022-04-15 13:03:21,092 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:03:21,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [993188857] [2022-04-15 13:03:21,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [993188857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:03:21,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:03:21,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 13:03:21,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233068781] [2022-04-15 13:03:21,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:03:21,092 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 45 [2022-04-15 13:03:21,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:03:21,092 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-15 13:03:21,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:03:21,175 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 13:03:21,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:03:21,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 13:03:21,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1229, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 13:03:21,176 INFO L87 Difference]: Start difference. First operand 46 states and 46 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-15 13:03:43,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:43,720 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 13:03:43,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 13:03:43,721 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 45 [2022-04-15 13:03:43,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:03:43,721 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-15 13:03:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 54 transitions. [2022-04-15 13:03:43,722 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-15 13:03:43,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 54 transitions. [2022-04-15 13:03:43,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 54 transitions. [2022-04-15 13:03:43,958 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-15 13:03:43,959 INFO L225 Difference]: With dead ends: 54 [2022-04-15 13:03:43,959 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 13:03:43,960 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 58 SyntacticMatches, 32 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=324, Invalid=4368, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 13:03:43,960 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:03:43,960 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 175 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2022-04-15 13:03:43,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 13:03:44,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 13:03:44,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:03:44,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:44,015 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:44,015 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:44,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:44,016 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 13:03:44,016 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 13:03:44,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:03:44,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:03:44,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 13:03:44,017 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 13:03:44,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:44,017 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 13:03:44,017 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 13:03:44,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:03:44,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:03:44,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:03:44,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:03:44,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-15 13:03:44,019 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2022-04-15 13:03:44,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:03:44,019 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-15 13:03:44,019 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-15 13:03:44,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-15 13:03:44,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:03:44,309 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 13:03:44,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 13:03:44,310 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:03:44,310 INFO L499 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:03:44,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-04-15 13:03:44,510 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:03:44,510 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:03:44,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:03:44,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2023366513, now seen corresponding path program 63 times [2022-04-15 13:03:44,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:03:44,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1604736085] [2022-04-15 13:03:44,854 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:03:44,854 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:03:44,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2023366513, now seen corresponding path program 64 times [2022-04-15 13:03:44,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:03:44,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4907134] [2022-04-15 13:03:44,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:03:44,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:03:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:45,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:03:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:45,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {14462#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {14424#true} is VALID [2022-04-15 13:03:45,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {14424#true} assume true; {14424#true} is VALID [2022-04-15 13:03:45,687 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14424#true} {14424#true} #62#return; {14424#true} is VALID [2022-04-15 13:03:45,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {14424#true} call ULTIMATE.init(); {14462#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:03:45,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {14462#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {14424#true} is VALID [2022-04-15 13:03:45,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {14424#true} assume true; {14424#true} is VALID [2022-04-15 13:03:45,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14424#true} {14424#true} #62#return; {14424#true} is VALID [2022-04-15 13:03:45,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {14424#true} call #t~ret5 := main(); {14424#true} is VALID [2022-04-15 13:03:45,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {14424#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {14424#true} is VALID [2022-04-15 13:03:45,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {14424#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {14429#(= main_~i~0 0)} is VALID [2022-04-15 13:03:45,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {14429#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14430#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:03:45,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {14430#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14431#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:03:45,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {14431#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14432#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:03:45,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {14432#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14433#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:03:45,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {14433#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14434#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:03:45,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {14434#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14435#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:03:45,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {14435#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14436#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:03:45,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {14436#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14437#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:03:45,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {14437#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14438#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:03:45,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {14438#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14439#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:03:45,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {14439#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14440#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:03:45,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {14440#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14441#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:03:45,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {14441#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14442#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:03:45,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {14442#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14443#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:03:45,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {14443#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14444#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:03:45,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {14444#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14445#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:03:45,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {14445#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14446#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:03:45,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {14446#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14447#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:03:45,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {14447#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14448#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:03:45,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {14448#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14449#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:03:45,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {14449#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14450#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:03:45,868 INFO L290 TraceCheckUtils]: 28: Hoare triple {14450#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14451#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:03:45,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {14451#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14452#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:03:45,882 INFO L290 TraceCheckUtils]: 30: Hoare triple {14452#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14453#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:03:45,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {14453#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14454#(and (<= 100 main_~i~0) (<= main_~i~0 100))} is VALID [2022-04-15 13:03:45,893 INFO L290 TraceCheckUtils]: 32: Hoare triple {14454#(and (<= 100 main_~i~0) (<= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14455#(and (<= main_~i~0 104) (<= 104 main_~i~0))} is VALID [2022-04-15 13:03:45,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {14455#(and (<= main_~i~0 104) (<= 104 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14456#(and (<= 108 main_~i~0) (<= main_~i~0 108))} is VALID [2022-04-15 13:03:45,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {14456#(and (<= 108 main_~i~0) (<= main_~i~0 108))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14457#(and (<= 112 main_~i~0) (<= main_~i~0 112))} is VALID [2022-04-15 13:03:45,922 INFO L290 TraceCheckUtils]: 35: Hoare triple {14457#(and (<= 112 main_~i~0) (<= main_~i~0 112))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14458#(and (<= main_~i~0 116) (<= 116 main_~i~0))} is VALID [2022-04-15 13:03:45,934 INFO L290 TraceCheckUtils]: 36: Hoare triple {14458#(and (<= main_~i~0 116) (<= 116 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14459#(and (<= main_~i~0 120) (<= 120 main_~i~0))} is VALID [2022-04-15 13:03:45,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {14459#(and (<= main_~i~0 120) (<= 120 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14460#(and (<= main_~i~0 124) (<= 124 main_~i~0))} is VALID [2022-04-15 13:03:45,955 INFO L290 TraceCheckUtils]: 38: Hoare triple {14460#(and (<= main_~i~0 124) (<= 124 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14461#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:03:45,955 INFO L290 TraceCheckUtils]: 39: Hoare triple {14461#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {14461#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:03:45,956 INFO L290 TraceCheckUtils]: 40: Hoare triple {14461#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {14461#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:03:45,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {14461#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {14425#false} is VALID [2022-04-15 13:03:45,960 INFO L272 TraceCheckUtils]: 42: Hoare triple {14425#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {14425#false} is VALID [2022-04-15 13:03:45,960 INFO L290 TraceCheckUtils]: 43: Hoare triple {14425#false} ~cond := #in~cond; {14425#false} is VALID [2022-04-15 13:03:45,960 INFO L290 TraceCheckUtils]: 44: Hoare triple {14425#false} assume 0 == ~cond; {14425#false} is VALID [2022-04-15 13:03:45,960 INFO L290 TraceCheckUtils]: 45: Hoare triple {14425#false} assume !false; {14425#false} is VALID [2022-04-15 13:03:45,961 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:03:45,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:03:45,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4907134] [2022-04-15 13:03:45,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4907134] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:03:45,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320238360] [2022-04-15 13:03:45,961 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:03:45,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:03:45,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:03:45,963 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:03:45,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-15 13:03:46,018 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:03:46,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:03:46,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-15 13:03:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:46,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:03:46,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {14424#true} call ULTIMATE.init(); {14424#true} is VALID [2022-04-15 13:03:46,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {14424#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {14424#true} is VALID [2022-04-15 13:03:46,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {14424#true} assume true; {14424#true} is VALID [2022-04-15 13:03:46,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14424#true} {14424#true} #62#return; {14424#true} is VALID [2022-04-15 13:03:46,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {14424#true} call #t~ret5 := main(); {14424#true} is VALID [2022-04-15 13:03:46,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {14424#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {14424#true} is VALID [2022-04-15 13:03:46,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {14424#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {14429#(= main_~i~0 0)} is VALID [2022-04-15 13:03:46,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {14429#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14430#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:03:46,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {14430#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14431#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:03:46,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {14431#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14432#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:03:46,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {14432#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14433#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:03:46,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {14433#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14434#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:03:46,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {14434#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14435#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:03:46,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {14435#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14436#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:03:46,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {14436#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14437#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:03:46,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {14437#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14438#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:03:46,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {14438#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14439#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:03:46,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {14439#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14440#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:03:46,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {14440#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14441#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:03:46,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {14441#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14442#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:03:46,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {14442#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14443#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:03:46,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {14443#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14444#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:03:46,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {14444#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14445#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:03:46,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {14445#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14446#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:03:46,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {14446#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14447#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:03:46,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {14447#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14448#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:03:46,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {14448#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14449#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:03:46,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {14449#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14450#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:03:46,690 INFO L290 TraceCheckUtils]: 28: Hoare triple {14450#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14451#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:03:46,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {14451#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14452#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:03:46,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {14452#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14453#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:03:46,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {14453#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14454#(and (<= 100 main_~i~0) (<= main_~i~0 100))} is VALID [2022-04-15 13:03:46,715 INFO L290 TraceCheckUtils]: 32: Hoare triple {14454#(and (<= 100 main_~i~0) (<= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14455#(and (<= main_~i~0 104) (<= 104 main_~i~0))} is VALID [2022-04-15 13:03:46,724 INFO L290 TraceCheckUtils]: 33: Hoare triple {14455#(and (<= main_~i~0 104) (<= 104 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14456#(and (<= 108 main_~i~0) (<= main_~i~0 108))} is VALID [2022-04-15 13:03:46,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {14456#(and (<= 108 main_~i~0) (<= main_~i~0 108))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14457#(and (<= 112 main_~i~0) (<= main_~i~0 112))} is VALID [2022-04-15 13:03:46,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {14457#(and (<= 112 main_~i~0) (<= main_~i~0 112))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14458#(and (<= main_~i~0 116) (<= 116 main_~i~0))} is VALID [2022-04-15 13:03:46,754 INFO L290 TraceCheckUtils]: 36: Hoare triple {14458#(and (<= main_~i~0 116) (<= 116 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14459#(and (<= main_~i~0 120) (<= 120 main_~i~0))} is VALID [2022-04-15 13:03:46,760 INFO L290 TraceCheckUtils]: 37: Hoare triple {14459#(and (<= main_~i~0 120) (<= 120 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14460#(and (<= main_~i~0 124) (<= 124 main_~i~0))} is VALID [2022-04-15 13:03:46,768 INFO L290 TraceCheckUtils]: 38: Hoare triple {14460#(and (<= main_~i~0 124) (<= 124 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14580#(and (<= main_~j~0 130) (<= 130 main_~j~0))} is VALID [2022-04-15 13:03:46,769 INFO L290 TraceCheckUtils]: 39: Hoare triple {14580#(and (<= main_~j~0 130) (<= 130 main_~j~0))} assume !(~i~0 < ~n~0); {14580#(and (<= main_~j~0 130) (<= 130 main_~j~0))} is VALID [2022-04-15 13:03:46,769 INFO L290 TraceCheckUtils]: 40: Hoare triple {14580#(and (<= main_~j~0 130) (<= 130 main_~j~0))} ~k~0 := ~i~0; {14580#(and (<= main_~j~0 130) (<= 130 main_~j~0))} is VALID [2022-04-15 13:03:46,770 INFO L290 TraceCheckUtils]: 41: Hoare triple {14580#(and (<= main_~j~0 130) (<= 130 main_~j~0))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {14425#false} is VALID [2022-04-15 13:03:46,770 INFO L272 TraceCheckUtils]: 42: Hoare triple {14425#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {14425#false} is VALID [2022-04-15 13:03:46,771 INFO L290 TraceCheckUtils]: 43: Hoare triple {14425#false} ~cond := #in~cond; {14425#false} is VALID [2022-04-15 13:03:46,771 INFO L290 TraceCheckUtils]: 44: Hoare triple {14425#false} assume 0 == ~cond; {14425#false} is VALID [2022-04-15 13:03:46,771 INFO L290 TraceCheckUtils]: 45: Hoare triple {14425#false} assume !false; {14425#false} is VALID [2022-04-15 13:03:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:03:46,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:03:50,490 INFO L290 TraceCheckUtils]: 45: Hoare triple {14425#false} assume !false; {14425#false} is VALID [2022-04-15 13:03:50,490 INFO L290 TraceCheckUtils]: 44: Hoare triple {14425#false} assume 0 == ~cond; {14425#false} is VALID [2022-04-15 13:03:50,490 INFO L290 TraceCheckUtils]: 43: Hoare triple {14425#false} ~cond := #in~cond; {14425#false} is VALID [2022-04-15 13:03:50,490 INFO L272 TraceCheckUtils]: 42: Hoare triple {14425#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {14425#false} is VALID [2022-04-15 13:03:50,495 INFO L290 TraceCheckUtils]: 41: Hoare triple {14461#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {14425#false} is VALID [2022-04-15 13:03:50,495 INFO L290 TraceCheckUtils]: 40: Hoare triple {14461#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {14461#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:03:50,496 INFO L290 TraceCheckUtils]: 39: Hoare triple {14461#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {14461#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:03:50,511 INFO L290 TraceCheckUtils]: 38: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14461#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:03:50,523 INFO L290 TraceCheckUtils]: 37: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,537 INFO L290 TraceCheckUtils]: 36: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,562 INFO L290 TraceCheckUtils]: 34: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,574 INFO L290 TraceCheckUtils]: 33: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,587 INFO L290 TraceCheckUtils]: 32: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {14424#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {14623#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:03:50,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {14424#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {14424#true} is VALID [2022-04-15 13:03:50,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {14424#true} call #t~ret5 := main(); {14424#true} is VALID [2022-04-15 13:03:50,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14424#true} {14424#true} #62#return; {14424#true} is VALID [2022-04-15 13:03:50,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {14424#true} assume true; {14424#true} is VALID [2022-04-15 13:03:50,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {14424#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {14424#true} is VALID [2022-04-15 13:03:50,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {14424#true} call ULTIMATE.init(); {14424#true} is VALID [2022-04-15 13:03:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-15 13:03:50,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320238360] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:03:50,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:03:50,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 4] total 38 [2022-04-15 13:03:50,909 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:03:50,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1604736085] [2022-04-15 13:03:50,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1604736085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:03:50,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:03:50,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 13:03:50,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595844265] [2022-04-15 13:03:50,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:03:50,909 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 46 [2022-04-15 13:03:50,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:03:50,910 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-15 13:03:51,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:03:51,021 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 13:03:51,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:03:51,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 13:03:51,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 13:03:51,021 INFO L87 Difference]: Start difference. First operand 47 states and 47 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-15 13:04:19,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:19,867 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-15 13:04:19,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 13:04:19,867 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 46 [2022-04-15 13:04:19,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:19,868 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-15 13:04:19,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 55 transitions. [2022-04-15 13:04:19,868 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-15 13:04:19,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 55 transitions. [2022-04-15 13:04:19,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 55 transitions. [2022-04-15 13:04:20,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:20,091 INFO L225 Difference]: With dead ends: 55 [2022-04-15 13:04:20,091 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 13:04:20,091 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 59 SyntacticMatches, 33 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=334, Invalid=4636, Unknown=0, NotChecked=0, Total=4970 [2022-04-15 13:04:20,091 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:20,092 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 180 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2022-04-15 13:04:20,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 13:04:20,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-15 13:04:20,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:20,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 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-15 13:04:20,145 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 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-15 13:04:20,145 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 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-15 13:04:20,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:20,146 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 13:04:20,146 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 13:04:20,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:20,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:20,146 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 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 48 states. [2022-04-15 13:04:20,146 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 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 48 states. [2022-04-15 13:04:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:20,147 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 13:04:20,147 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 13:04:20,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:20,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:20,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:20,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:20,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 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-15 13:04:20,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-04-15 13:04:20,148 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2022-04-15 13:04:20,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:20,148 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-04-15 13:04:20,148 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-15 13:04:20,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2022-04-15 13:04:20,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 13:04:20,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 13:04:20,535 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:20,535 INFO L499 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:20,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-15 13:04:20,735 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:20,735 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:20,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:20,736 INFO L85 PathProgramCache]: Analyzing trace with hash 532251070, now seen corresponding path program 65 times [2022-04-15 13:04:20,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:20,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2127157396] [2022-04-15 13:04:21,162 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:04:21,163 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:04:21,163 INFO L85 PathProgramCache]: Analyzing trace with hash 532251070, now seen corresponding path program 66 times [2022-04-15 13:04:21,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:21,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241317773] [2022-04-15 13:04:21,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:21,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:22,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:22,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {15147#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {15108#true} is VALID [2022-04-15 13:04:22,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {15108#true} assume true; {15108#true} is VALID [2022-04-15 13:04:22,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15108#true} {15108#true} #62#return; {15108#true} is VALID [2022-04-15 13:04:22,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {15108#true} call ULTIMATE.init(); {15147#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:22,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {15147#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {15108#true} is VALID [2022-04-15 13:04:22,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {15108#true} assume true; {15108#true} is VALID [2022-04-15 13:04:22,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15108#true} {15108#true} #62#return; {15108#true} is VALID [2022-04-15 13:04:22,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {15108#true} call #t~ret5 := main(); {15108#true} is VALID [2022-04-15 13:04:22,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {15108#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {15108#true} is VALID [2022-04-15 13:04:22,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {15108#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {15113#(= main_~i~0 0)} is VALID [2022-04-15 13:04:22,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {15113#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15114#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:04:22,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {15114#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15115#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:04:22,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {15115#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15116#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:04:22,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {15116#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15117#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:04:22,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {15117#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15118#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:04:22,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {15118#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15119#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:04:22,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {15119#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15120#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:04:22,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {15120#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15121#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:04:22,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {15121#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15122#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:04:22,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {15122#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15123#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:04:22,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {15123#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15124#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:04:22,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {15124#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15125#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:04:22,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {15125#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15126#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:04:22,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {15126#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15127#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:04:22,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {15127#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15128#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:04:22,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {15128#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15129#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:04:22,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {15129#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15130#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:04:22,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {15130#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15131#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:04:22,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {15131#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15132#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:04:22,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {15132#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15133#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:04:22,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {15133#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15134#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:04:22,334 INFO L290 TraceCheckUtils]: 28: Hoare triple {15134#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15135#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:04:22,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {15135#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15136#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:04:22,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {15136#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15137#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:04:22,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {15137#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15138#(and (<= 100 main_~i~0) (<= main_~i~0 100))} is VALID [2022-04-15 13:04:22,361 INFO L290 TraceCheckUtils]: 32: Hoare triple {15138#(and (<= 100 main_~i~0) (<= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15139#(and (<= main_~i~0 104) (<= 104 main_~i~0))} is VALID [2022-04-15 13:04:22,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {15139#(and (<= main_~i~0 104) (<= 104 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15140#(and (<= 108 main_~i~0) (<= main_~i~0 108))} is VALID [2022-04-15 13:04:22,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {15140#(and (<= 108 main_~i~0) (<= main_~i~0 108))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15141#(and (<= 112 main_~i~0) (<= main_~i~0 112))} is VALID [2022-04-15 13:04:22,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {15141#(and (<= 112 main_~i~0) (<= main_~i~0 112))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15142#(and (<= main_~i~0 116) (<= 116 main_~i~0))} is VALID [2022-04-15 13:04:22,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {15142#(and (<= main_~i~0 116) (<= 116 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15143#(and (<= main_~i~0 120) (<= 120 main_~i~0))} is VALID [2022-04-15 13:04:22,426 INFO L290 TraceCheckUtils]: 37: Hoare triple {15143#(and (<= main_~i~0 120) (<= 120 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15144#(and (<= main_~i~0 124) (<= 124 main_~i~0))} is VALID [2022-04-15 13:04:22,438 INFO L290 TraceCheckUtils]: 38: Hoare triple {15144#(and (<= main_~i~0 124) (<= 124 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15145#(and (<= 128 main_~i~0) (<= main_~i~0 128))} is VALID [2022-04-15 13:04:22,447 INFO L290 TraceCheckUtils]: 39: Hoare triple {15145#(and (<= 128 main_~i~0) (<= main_~i~0 128))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15146#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (not (<= (div main_~j~0 2) 66)))} is VALID [2022-04-15 13:04:22,447 INFO L290 TraceCheckUtils]: 40: Hoare triple {15146#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (not (<= (div main_~j~0 2) 66)))} assume !(~i~0 < ~n~0); {15146#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (not (<= (div main_~j~0 2) 66)))} is VALID [2022-04-15 13:04:22,448 INFO L290 TraceCheckUtils]: 41: Hoare triple {15146#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (not (<= (div main_~j~0 2) 66)))} ~k~0 := ~i~0; {15146#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (not (<= (div main_~j~0 2) 66)))} is VALID [2022-04-15 13:04:22,453 INFO L290 TraceCheckUtils]: 42: Hoare triple {15146#(and (= (* 2 (div main_~j~0 2)) main_~j~0) (not (<= (div main_~j~0 2) 66)))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {15109#false} is VALID [2022-04-15 13:04:22,453 INFO L272 TraceCheckUtils]: 43: Hoare triple {15109#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {15109#false} is VALID [2022-04-15 13:04:22,453 INFO L290 TraceCheckUtils]: 44: Hoare triple {15109#false} ~cond := #in~cond; {15109#false} is VALID [2022-04-15 13:04:22,453 INFO L290 TraceCheckUtils]: 45: Hoare triple {15109#false} assume 0 == ~cond; {15109#false} is VALID [2022-04-15 13:04:22,453 INFO L290 TraceCheckUtils]: 46: Hoare triple {15109#false} assume !false; {15109#false} is VALID [2022-04-15 13:04:22,454 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:22,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:22,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241317773] [2022-04-15 13:04:22,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241317773] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:22,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813648641] [2022-04-15 13:04:22,454 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:04:22,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:22,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:22,460 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:04:22,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-15 13:04:22,527 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-04-15 13:04:22,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:22,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-15 13:04:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:22,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:24,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {15108#true} call ULTIMATE.init(); {15108#true} is VALID [2022-04-15 13:04:24,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {15108#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {15108#true} is VALID [2022-04-15 13:04:24,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {15108#true} assume true; {15108#true} is VALID [2022-04-15 13:04:24,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15108#true} {15108#true} #62#return; {15108#true} is VALID [2022-04-15 13:04:24,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {15108#true} call #t~ret5 := main(); {15108#true} is VALID [2022-04-15 13:04:24,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {15108#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {15108#true} is VALID [2022-04-15 13:04:24,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {15108#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {15113#(= main_~i~0 0)} is VALID [2022-04-15 13:04:24,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {15113#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15172#(and (< 0 main_~n~0) (= main_~i~0 4))} is VALID [2022-04-15 13:04:24,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {15172#(and (< 0 main_~n~0) (= main_~i~0 4))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15176#(and (< 0 main_~n~0) (= main_~i~0 8))} is VALID [2022-04-15 13:04:24,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {15176#(and (< 0 main_~n~0) (= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15180#(and (< 0 main_~n~0) (= 8 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:04:24,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {15180#(and (< 0 main_~n~0) (= 8 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15184#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 8)) 8))} is VALID [2022-04-15 13:04:24,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {15184#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 8)) 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15188#(and (< 0 main_~n~0) (= main_~i~0 20))} is VALID [2022-04-15 13:04:24,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {15188#(and (< 0 main_~n~0) (= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15192#(and (< 0 main_~n~0) (= 20 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:04:24,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {15192#(and (< 0 main_~n~0) (= 20 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15196#(and (< 0 main_~n~0) (= main_~i~0 28))} is VALID [2022-04-15 13:04:24,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {15196#(and (< 0 main_~n~0) (= main_~i~0 28))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15200#(and (< 0 main_~n~0) (= 32 main_~i~0))} is VALID [2022-04-15 13:04:24,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {15200#(and (< 0 main_~n~0) (= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15204#(and (< 0 main_~n~0) (= 32 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:04:24,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {15204#(and (< 0 main_~n~0) (= 32 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15208#(and (< 0 main_~n~0) (= 40 main_~i~0))} is VALID [2022-04-15 13:04:24,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {15208#(and (< 0 main_~n~0) (= 40 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15212#(and (< 0 main_~n~0) (= 44 main_~i~0))} is VALID [2022-04-15 13:04:24,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {15212#(and (< 0 main_~n~0) (= 44 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15216#(and (< 0 main_~n~0) (= main_~i~0 48))} is VALID [2022-04-15 13:04:24,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {15216#(and (< 0 main_~n~0) (= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15220#(and (< 0 main_~n~0) (= main_~i~0 52))} is VALID [2022-04-15 13:04:24,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {15220#(and (< 0 main_~n~0) (= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15224#(and (< 0 main_~n~0) (= 52 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:04:24,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {15224#(and (< 0 main_~n~0) (= 52 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15228#(and (< 0 main_~n~0) (= 52 (+ main_~i~0 (- 8))))} is VALID [2022-04-15 13:04:24,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {15228#(and (< 0 main_~n~0) (= 52 (+ main_~i~0 (- 8))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15232#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 12)) 52))} is VALID [2022-04-15 13:04:24,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {15232#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 12)) 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15236#(and (< 0 main_~n~0) (= 68 main_~i~0))} is VALID [2022-04-15 13:04:24,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {15236#(and (< 0 main_~n~0) (= 68 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15240#(and (< 0 main_~n~0) (= 68 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:04:24,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {15240#(and (< 0 main_~n~0) (= 68 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15244#(and (< 0 main_~n~0) (= 68 (+ main_~i~0 (- 8))))} is VALID [2022-04-15 13:04:24,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {15244#(and (< 0 main_~n~0) (= 68 (+ main_~i~0 (- 8))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15248#(and (< 0 main_~n~0) (= main_~i~0 80))} is VALID [2022-04-15 13:04:24,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {15248#(and (< 0 main_~n~0) (= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15252#(and (< 0 main_~n~0) (= 84 main_~i~0))} is VALID [2022-04-15 13:04:24,102 INFO L290 TraceCheckUtils]: 28: Hoare triple {15252#(and (< 0 main_~n~0) (= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15256#(and (< 0 main_~n~0) (= 84 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:04:24,102 INFO L290 TraceCheckUtils]: 29: Hoare triple {15256#(and (< 0 main_~n~0) (= 84 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15260#(and (< 0 main_~n~0) (= 92 main_~i~0))} is VALID [2022-04-15 13:04:24,103 INFO L290 TraceCheckUtils]: 30: Hoare triple {15260#(and (< 0 main_~n~0) (= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15264#(and (< 0 main_~n~0) (= 92 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:04:24,103 INFO L290 TraceCheckUtils]: 31: Hoare triple {15264#(and (< 0 main_~n~0) (= 92 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15268#(and (< 0 main_~n~0) (= main_~i~0 100))} is VALID [2022-04-15 13:04:24,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {15268#(and (< 0 main_~n~0) (= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15272#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 4)) 100))} is VALID [2022-04-15 13:04:24,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {15272#(and (< 0 main_~n~0) (= (+ main_~i~0 (- 4)) 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15276#(and (< 0 main_~n~0) (= 108 main_~i~0))} is VALID [2022-04-15 13:04:24,104 INFO L290 TraceCheckUtils]: 34: Hoare triple {15276#(and (< 0 main_~n~0) (= 108 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15280#(and (< 0 main_~n~0) (= 112 main_~i~0))} is VALID [2022-04-15 13:04:24,105 INFO L290 TraceCheckUtils]: 35: Hoare triple {15280#(and (< 0 main_~n~0) (= 112 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15284#(and (< 0 main_~n~0) (= 112 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:04:24,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {15284#(and (< 0 main_~n~0) (= 112 (+ main_~i~0 (- 4))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15288#(and (< 0 main_~n~0) (= main_~i~0 120))} is VALID [2022-04-15 13:04:24,105 INFO L290 TraceCheckUtils]: 37: Hoare triple {15288#(and (< 0 main_~n~0) (= main_~i~0 120))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15292#(and (< 0 main_~n~0) (= main_~i~0 124))} is VALID [2022-04-15 13:04:24,106 INFO L290 TraceCheckUtils]: 38: Hoare triple {15292#(and (< 0 main_~n~0) (= main_~i~0 124))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15296#(and (< 0 main_~n~0) (= main_~i~0 128))} is VALID [2022-04-15 13:04:24,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {15296#(and (< 0 main_~n~0) (= main_~i~0 128))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15300#(and (< 0 main_~n~0) (= main_~j~0 (+ main_~i~0 2)) (= 128 (+ main_~i~0 (- 4))))} is VALID [2022-04-15 13:04:24,106 INFO L290 TraceCheckUtils]: 40: Hoare triple {15300#(and (< 0 main_~n~0) (= main_~j~0 (+ main_~i~0 2)) (= 128 (+ main_~i~0 (- 4))))} assume !(~i~0 < ~n~0); {15304#(= main_~j~0 134)} is VALID [2022-04-15 13:04:24,107 INFO L290 TraceCheckUtils]: 41: Hoare triple {15304#(= main_~j~0 134)} ~k~0 := ~i~0; {15304#(= main_~j~0 134)} is VALID [2022-04-15 13:04:24,107 INFO L290 TraceCheckUtils]: 42: Hoare triple {15304#(= main_~j~0 134)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {15109#false} is VALID [2022-04-15 13:04:24,107 INFO L272 TraceCheckUtils]: 43: Hoare triple {15109#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {15109#false} is VALID [2022-04-15 13:04:24,107 INFO L290 TraceCheckUtils]: 44: Hoare triple {15109#false} ~cond := #in~cond; {15109#false} is VALID [2022-04-15 13:04:24,107 INFO L290 TraceCheckUtils]: 45: Hoare triple {15109#false} assume 0 == ~cond; {15109#false} is VALID [2022-04-15 13:04:24,107 INFO L290 TraceCheckUtils]: 46: Hoare triple {15109#false} assume !false; {15109#false} is VALID [2022-04-15 13:04:24,108 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:24,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:48,448 INFO L290 TraceCheckUtils]: 46: Hoare triple {15109#false} assume !false; {15109#false} is VALID [2022-04-15 13:04:48,448 INFO L290 TraceCheckUtils]: 45: Hoare triple {15109#false} assume 0 == ~cond; {15109#false} is VALID [2022-04-15 13:04:48,448 INFO L290 TraceCheckUtils]: 44: Hoare triple {15109#false} ~cond := #in~cond; {15109#false} is VALID [2022-04-15 13:04:48,448 INFO L272 TraceCheckUtils]: 43: Hoare triple {15109#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {15109#false} is VALID [2022-04-15 13:04:48,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {15335#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {15109#false} is VALID [2022-04-15 13:04:48,449 INFO L290 TraceCheckUtils]: 41: Hoare triple {15335#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {15335#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:04:48,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {15342#(or (< main_~i~0 main_~n~0) (= (mod main_~j~0 2) 0))} assume !(~i~0 < ~n~0); {15335#(= (mod main_~j~0 2) 0)} is VALID [2022-04-15 13:04:48,475 INFO L290 TraceCheckUtils]: 39: Hoare triple {15346#(or (< (+ main_~i~0 4) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15342#(or (< main_~i~0 main_~n~0) (= (mod main_~j~0 2) 0))} is VALID [2022-04-15 13:04:48,476 INFO L290 TraceCheckUtils]: 38: Hoare triple {15350#(or (< (+ main_~i~0 8) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15346#(or (< (+ main_~i~0 4) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:04:48,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {15354#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 12) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15350#(or (< (+ main_~i~0 8) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:04:48,519 INFO L290 TraceCheckUtils]: 36: Hoare triple {15358#(or (< (+ main_~i~0 16) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15354#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 12) main_~n~0))} is VALID [2022-04-15 13:04:48,544 INFO L290 TraceCheckUtils]: 35: Hoare triple {15362#(or (< (+ main_~i~0 20) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15358#(or (< (+ main_~i~0 16) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:04:48,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {15366#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 24) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15362#(or (< (+ main_~i~0 20) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:04:48,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {15370#(or (< (+ main_~i~0 28) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15366#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 24) main_~n~0))} is VALID [2022-04-15 13:04:48,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {15374#(or (< (+ 32 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15370#(or (< (+ main_~i~0 28) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:04:48,632 INFO L290 TraceCheckUtils]: 31: Hoare triple {15378#(or (< (+ main_~i~0 36) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15374#(or (< (+ 32 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:04:48,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {15382#(or (= 0 (mod main_~i~0 2)) (< (+ 40 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15378#(or (< (+ main_~i~0 36) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:04:48,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {15386#(or (= 0 (mod main_~i~0 2)) (< (+ 44 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15382#(or (= 0 (mod main_~i~0 2)) (< (+ 40 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:04:48,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {15390#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 48) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15386#(or (= 0 (mod main_~i~0 2)) (< (+ 44 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:04:48,721 INFO L290 TraceCheckUtils]: 27: Hoare triple {15394#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 52) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15390#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 48) main_~n~0))} is VALID [2022-04-15 13:04:48,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {15398#(or (= 0 (mod main_~i~0 2)) (< (+ 56 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15394#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 52) main_~n~0))} is VALID [2022-04-15 13:04:48,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {15402#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 60) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15398#(or (= 0 (mod main_~i~0 2)) (< (+ 56 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:04:48,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {15406#(or (= 0 (mod main_~i~0 2)) (< (+ 64 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15402#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 60) main_~n~0))} is VALID [2022-04-15 13:04:48,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {15410#(or (= 0 (mod main_~i~0 2)) (< (+ 68 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15406#(or (= 0 (mod main_~i~0 2)) (< (+ 64 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:04:48,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {15414#(or (= 0 (mod main_~i~0 2)) (< (+ 72 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15410#(or (= 0 (mod main_~i~0 2)) (< (+ 68 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:04:48,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {15418#(or (< (+ 76 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15414#(or (= 0 (mod main_~i~0 2)) (< (+ 72 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:04:48,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {15422#(or (< (+ main_~i~0 80) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15418#(or (< (+ 76 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:04:48,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {15426#(or (= 0 (mod main_~i~0 2)) (< (+ 84 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15422#(or (< (+ main_~i~0 80) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:04:48,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {15430#(or (= 0 (mod main_~i~0 2)) (< (+ 88 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15426#(or (= 0 (mod main_~i~0 2)) (< (+ 84 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:04:48,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {15434#(or (= 0 (mod main_~i~0 2)) (< (+ 92 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15430#(or (= 0 (mod main_~i~0 2)) (< (+ 88 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:04:48,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {15438#(or (< (+ main_~i~0 96) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15434#(or (= 0 (mod main_~i~0 2)) (< (+ 92 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:04:48,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {15442#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 100) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15438#(or (< (+ main_~i~0 96) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:04:49,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {15446#(or (= 0 (mod main_~i~0 2)) (< (+ 104 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15442#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 100) main_~n~0))} is VALID [2022-04-15 13:04:49,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {15450#(or (= 0 (mod main_~i~0 2)) (< (+ 108 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15446#(or (= 0 (mod main_~i~0 2)) (< (+ 104 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:04:49,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {15454#(or (= 0 (mod main_~i~0 2)) (< (+ 112 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15450#(or (= 0 (mod main_~i~0 2)) (< (+ 108 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:04:49,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {15458#(or (< (+ 116 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15454#(or (= 0 (mod main_~i~0 2)) (< (+ 112 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:04:49,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {15462#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 120) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15458#(or (< (+ 116 main_~i~0) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:04:49,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {15466#(or (< (+ main_~i~0 124) main_~n~0) (= 0 (mod main_~i~0 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15462#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 120) main_~n~0))} is VALID [2022-04-15 13:04:49,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {15470#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 128) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15466#(or (< (+ main_~i~0 124) main_~n~0) (= 0 (mod main_~i~0 2)))} is VALID [2022-04-15 13:04:49,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {15474#(= 0 (mod main_~i~0 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15470#(or (= 0 (mod main_~i~0 2)) (< (+ main_~i~0 128) main_~n~0))} is VALID [2022-04-15 13:04:49,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {15108#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {15474#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 13:04:49,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {15108#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {15108#true} is VALID [2022-04-15 13:04:49,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {15108#true} call #t~ret5 := main(); {15108#true} is VALID [2022-04-15 13:04:49,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15108#true} {15108#true} #62#return; {15108#true} is VALID [2022-04-15 13:04:49,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {15108#true} assume true; {15108#true} is VALID [2022-04-15 13:04:49,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {15108#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {15108#true} is VALID [2022-04-15 13:04:49,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {15108#true} call ULTIMATE.init(); {15108#true} is VALID [2022-04-15 13:04:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:49,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813648641] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:49,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:49,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 106 [2022-04-15 13:04:49,126 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:49,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2127157396] [2022-04-15 13:04:49,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2127157396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:49,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:49,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 13:04:49,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447760121] [2022-04-15 13:04:49,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:49,127 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 47 [2022-04-15 13:04:49,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:49,127 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-15 13:04:49,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:49,288 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 13:04:49,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:49,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 13:04:49,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2957, Invalid=8173, Unknown=0, NotChecked=0, Total=11130 [2022-04-15 13:04:49,289 INFO L87 Difference]: Start difference. First operand 48 states and 48 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-15 13:05:40,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:40,040 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-15 13:05:40,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 13:05:40,040 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 47 [2022-04-15 13:05:40,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:40,040 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-15 13:05:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 56 transitions. [2022-04-15 13:05:40,041 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-15 13:05:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 56 transitions. [2022-04-15 13:05:40,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 56 transitions. [2022-04-15 13:05:40,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:40,300 INFO L225 Difference]: With dead ends: 56 [2022-04-15 13:05:40,300 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 13:05:40,302 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4591 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=4184, Invalid=15276, Unknown=0, NotChecked=0, Total=19460 [2022-04-15 13:05:40,302 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:40,302 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 186 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 17.5s Time] [2022-04-15 13:05:40,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 13:05:40,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-15 13:05:40,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:40,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:40,349 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:40,349 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:40,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:40,350 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 13:05:40,350 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 13:05:40,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:40,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:40,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 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-15 13:05:40,351 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 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-15 13:05:40,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:40,352 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 13:05:40,352 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 13:05:40,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:40,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:40,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:40,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:40,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-15 13:05:40,353 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2022-04-15 13:05:40,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:40,353 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-15 13:05:40,353 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-15 13:05:40,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-15 13:05:40,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:40,831 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 13:05:40,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 13:05:40,832 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:40,832 INFO L499 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:40,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-15 13:05:41,035 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,SelfDestructingSolverStorable34 [2022-04-15 13:05:41,035 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:41,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:41,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1552312593, now seen corresponding path program 67 times [2022-04-15 13:05:41,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:41,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [400012726] [2022-04-15 13:05:41,710 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:05:41,710 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:05:41,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1552312593, now seen corresponding path program 68 times [2022-04-15 13:05:41,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:41,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252517861] [2022-04-15 13:05:41,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:41,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:42,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:42,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {15914#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {15874#true} is VALID [2022-04-15 13:05:42,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {15874#true} assume true; {15874#true} is VALID [2022-04-15 13:05:42,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15874#true} {15874#true} #62#return; {15874#true} is VALID [2022-04-15 13:05:42,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {15874#true} call ULTIMATE.init(); {15914#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:42,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {15914#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {15874#true} is VALID [2022-04-15 13:05:42,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {15874#true} assume true; {15874#true} is VALID [2022-04-15 13:05:42,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15874#true} {15874#true} #62#return; {15874#true} is VALID [2022-04-15 13:05:42,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {15874#true} call #t~ret5 := main(); {15874#true} is VALID [2022-04-15 13:05:42,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {15874#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {15874#true} is VALID [2022-04-15 13:05:42,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {15874#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {15879#(= main_~i~0 0)} is VALID [2022-04-15 13:05:42,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {15879#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15880#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:05:42,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {15880#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15881#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:05:42,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {15881#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15882#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:05:42,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {15882#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15883#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:05:42,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {15883#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15884#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:05:42,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {15884#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15885#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:05:42,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {15885#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15886#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:05:42,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {15886#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15887#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:05:42,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {15887#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15888#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:05:42,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {15888#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15889#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:05:42,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {15889#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15890#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:05:42,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {15890#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15891#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:05:42,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {15891#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15892#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:05:42,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {15892#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15893#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:05:42,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {15893#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15894#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:05:42,828 INFO L290 TraceCheckUtils]: 22: Hoare triple {15894#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15895#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:05:42,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {15895#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15896#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:05:42,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {15896#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15897#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:05:42,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {15897#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15898#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:05:42,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {15898#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15899#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:05:42,913 INFO L290 TraceCheckUtils]: 27: Hoare triple {15899#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15900#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:05:42,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {15900#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15901#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:05:42,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {15901#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15902#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:05:42,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {15902#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15903#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:05:42,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {15903#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15904#(and (<= 100 main_~i~0) (<= main_~i~0 100))} is VALID [2022-04-15 13:05:42,979 INFO L290 TraceCheckUtils]: 32: Hoare triple {15904#(and (<= 100 main_~i~0) (<= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15905#(and (<= main_~i~0 104) (<= 104 main_~i~0))} is VALID [2022-04-15 13:05:42,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {15905#(and (<= main_~i~0 104) (<= 104 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15906#(and (<= 108 main_~i~0) (<= main_~i~0 108))} is VALID [2022-04-15 13:05:43,016 INFO L290 TraceCheckUtils]: 34: Hoare triple {15906#(and (<= 108 main_~i~0) (<= main_~i~0 108))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15907#(and (<= 112 main_~i~0) (<= main_~i~0 112))} is VALID [2022-04-15 13:05:43,037 INFO L290 TraceCheckUtils]: 35: Hoare triple {15907#(and (<= 112 main_~i~0) (<= main_~i~0 112))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15908#(and (<= main_~i~0 116) (<= 116 main_~i~0))} is VALID [2022-04-15 13:05:43,061 INFO L290 TraceCheckUtils]: 36: Hoare triple {15908#(and (<= main_~i~0 116) (<= 116 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15909#(and (<= main_~i~0 120) (<= 120 main_~i~0))} is VALID [2022-04-15 13:05:43,082 INFO L290 TraceCheckUtils]: 37: Hoare triple {15909#(and (<= main_~i~0 120) (<= 120 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15910#(and (<= main_~i~0 124) (<= 124 main_~i~0))} is VALID [2022-04-15 13:05:43,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {15910#(and (<= main_~i~0 124) (<= 124 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15911#(and (<= 128 main_~i~0) (<= main_~i~0 128))} is VALID [2022-04-15 13:05:43,123 INFO L290 TraceCheckUtils]: 39: Hoare triple {15911#(and (<= 128 main_~i~0) (<= main_~i~0 128))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15912#(and (<= main_~i~0 132) (<= 132 main_~i~0))} is VALID [2022-04-15 13:05:43,137 INFO L290 TraceCheckUtils]: 40: Hoare triple {15912#(and (<= main_~i~0 132) (<= 132 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15913#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:05:43,138 INFO L290 TraceCheckUtils]: 41: Hoare triple {15913#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {15913#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:05:43,138 INFO L290 TraceCheckUtils]: 42: Hoare triple {15913#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {15913#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:05:43,144 INFO L290 TraceCheckUtils]: 43: Hoare triple {15913#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {15875#false} is VALID [2022-04-15 13:05:43,144 INFO L272 TraceCheckUtils]: 44: Hoare triple {15875#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {15875#false} is VALID [2022-04-15 13:05:43,144 INFO L290 TraceCheckUtils]: 45: Hoare triple {15875#false} ~cond := #in~cond; {15875#false} is VALID [2022-04-15 13:05:43,144 INFO L290 TraceCheckUtils]: 46: Hoare triple {15875#false} assume 0 == ~cond; {15875#false} is VALID [2022-04-15 13:05:43,144 INFO L290 TraceCheckUtils]: 47: Hoare triple {15875#false} assume !false; {15875#false} is VALID [2022-04-15 13:05:43,145 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:43,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:43,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252517861] [2022-04-15 13:05:43,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252517861] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:05:43,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197130925] [2022-04-15 13:05:43,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:05:43,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:05:43,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:05:43,146 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:05:43,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-15 13:05:43,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:05:43,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:05:43,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-15 13:05:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:43,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:05:43,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {15874#true} call ULTIMATE.init(); {15874#true} is VALID [2022-04-15 13:05:43,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {15874#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {15874#true} is VALID [2022-04-15 13:05:43,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {15874#true} assume true; {15874#true} is VALID [2022-04-15 13:05:43,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15874#true} {15874#true} #62#return; {15874#true} is VALID [2022-04-15 13:05:43,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {15874#true} call #t~ret5 := main(); {15874#true} is VALID [2022-04-15 13:05:43,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {15874#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {15874#true} is VALID [2022-04-15 13:05:43,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {15874#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {15879#(= main_~i~0 0)} is VALID [2022-04-15 13:05:43,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {15879#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15880#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:05:43,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {15880#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15881#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:05:43,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {15881#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15882#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:05:43,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {15882#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15883#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:05:43,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {15883#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15884#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:05:43,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {15884#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15885#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:05:43,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {15885#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15886#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:05:43,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {15886#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15887#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:05:43,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {15887#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15888#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:05:43,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {15888#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15889#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:05:43,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {15889#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15890#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:05:43,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {15890#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15891#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:05:43,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {15891#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15892#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:05:43,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {15892#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15893#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:05:43,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {15893#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15894#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:05:43,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {15894#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15895#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:05:44,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {15895#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15896#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:05:44,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {15896#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15897#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:05:44,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {15897#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15898#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:05:44,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {15898#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15899#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:05:44,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {15899#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15900#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:05:44,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {15900#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15901#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:05:44,130 INFO L290 TraceCheckUtils]: 29: Hoare triple {15901#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15902#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:05:44,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {15902#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15903#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:05:44,167 INFO L290 TraceCheckUtils]: 31: Hoare triple {15903#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15904#(and (<= 100 main_~i~0) (<= main_~i~0 100))} is VALID [2022-04-15 13:05:44,183 INFO L290 TraceCheckUtils]: 32: Hoare triple {15904#(and (<= 100 main_~i~0) (<= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15905#(and (<= main_~i~0 104) (<= 104 main_~i~0))} is VALID [2022-04-15 13:05:44,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {15905#(and (<= main_~i~0 104) (<= 104 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15906#(and (<= 108 main_~i~0) (<= main_~i~0 108))} is VALID [2022-04-15 13:05:44,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {15906#(and (<= 108 main_~i~0) (<= main_~i~0 108))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15907#(and (<= 112 main_~i~0) (<= main_~i~0 112))} is VALID [2022-04-15 13:05:44,250 INFO L290 TraceCheckUtils]: 35: Hoare triple {15907#(and (<= 112 main_~i~0) (<= main_~i~0 112))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15908#(and (<= main_~i~0 116) (<= 116 main_~i~0))} is VALID [2022-04-15 13:05:44,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {15908#(and (<= main_~i~0 116) (<= 116 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15909#(and (<= main_~i~0 120) (<= 120 main_~i~0))} is VALID [2022-04-15 13:05:44,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {15909#(and (<= main_~i~0 120) (<= 120 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15910#(and (<= main_~i~0 124) (<= 124 main_~i~0))} is VALID [2022-04-15 13:05:44,298 INFO L290 TraceCheckUtils]: 38: Hoare triple {15910#(and (<= main_~i~0 124) (<= 124 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15911#(and (<= 128 main_~i~0) (<= main_~i~0 128))} is VALID [2022-04-15 13:05:44,317 INFO L290 TraceCheckUtils]: 39: Hoare triple {15911#(and (<= 128 main_~i~0) (<= main_~i~0 128))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15912#(and (<= main_~i~0 132) (<= 132 main_~i~0))} is VALID [2022-04-15 13:05:44,336 INFO L290 TraceCheckUtils]: 40: Hoare triple {15912#(and (<= main_~i~0 132) (<= 132 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16038#(and (<= 138 main_~j~0) (<= main_~j~0 138))} is VALID [2022-04-15 13:05:44,336 INFO L290 TraceCheckUtils]: 41: Hoare triple {16038#(and (<= 138 main_~j~0) (<= main_~j~0 138))} assume !(~i~0 < ~n~0); {16038#(and (<= 138 main_~j~0) (<= main_~j~0 138))} is VALID [2022-04-15 13:05:44,337 INFO L290 TraceCheckUtils]: 42: Hoare triple {16038#(and (<= 138 main_~j~0) (<= main_~j~0 138))} ~k~0 := ~i~0; {16038#(and (<= 138 main_~j~0) (<= main_~j~0 138))} is VALID [2022-04-15 13:05:44,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {16038#(and (<= 138 main_~j~0) (<= main_~j~0 138))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {15875#false} is VALID [2022-04-15 13:05:44,339 INFO L272 TraceCheckUtils]: 44: Hoare triple {15875#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {15875#false} is VALID [2022-04-15 13:05:44,339 INFO L290 TraceCheckUtils]: 45: Hoare triple {15875#false} ~cond := #in~cond; {15875#false} is VALID [2022-04-15 13:05:44,339 INFO L290 TraceCheckUtils]: 46: Hoare triple {15875#false} assume 0 == ~cond; {15875#false} is VALID [2022-04-15 13:05:44,339 INFO L290 TraceCheckUtils]: 47: Hoare triple {15875#false} assume !false; {15875#false} is VALID [2022-04-15 13:05:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:44,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:05:51,790 INFO L290 TraceCheckUtils]: 47: Hoare triple {15875#false} assume !false; {15875#false} is VALID [2022-04-15 13:05:51,790 INFO L290 TraceCheckUtils]: 46: Hoare triple {15875#false} assume 0 == ~cond; {15875#false} is VALID [2022-04-15 13:05:51,790 INFO L290 TraceCheckUtils]: 45: Hoare triple {15875#false} ~cond := #in~cond; {15875#false} is VALID [2022-04-15 13:05:51,790 INFO L272 TraceCheckUtils]: 44: Hoare triple {15875#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {15875#false} is VALID [2022-04-15 13:05:51,798 INFO L290 TraceCheckUtils]: 43: Hoare triple {15913#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {15875#false} is VALID [2022-04-15 13:05:51,798 INFO L290 TraceCheckUtils]: 42: Hoare triple {15913#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {15913#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:05:51,799 INFO L290 TraceCheckUtils]: 41: Hoare triple {15913#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {15913#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:05:51,826 INFO L290 TraceCheckUtils]: 40: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {15913#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:05:51,849 INFO L290 TraceCheckUtils]: 39: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:51,864 INFO L290 TraceCheckUtils]: 38: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:51,877 INFO L290 TraceCheckUtils]: 37: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:51,892 INFO L290 TraceCheckUtils]: 36: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:51,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:51,922 INFO L290 TraceCheckUtils]: 34: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:51,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:51,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:51,966 INFO L290 TraceCheckUtils]: 31: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:51,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:51,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {15874#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {16081#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:05:52,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {15874#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {15874#true} is VALID [2022-04-15 13:05:52,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {15874#true} call #t~ret5 := main(); {15874#true} is VALID [2022-04-15 13:05:52,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15874#true} {15874#true} #62#return; {15874#true} is VALID [2022-04-15 13:05:52,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {15874#true} assume true; {15874#true} is VALID [2022-04-15 13:05:52,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {15874#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {15874#true} is VALID [2022-04-15 13:05:52,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {15874#true} call ULTIMATE.init(); {15874#true} is VALID [2022-04-15 13:05:52,457 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2022-04-15 13:05:52,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197130925] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:05:52,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:05:52,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 4] total 40 [2022-04-15 13:05:52,457 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:52,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [400012726] [2022-04-15 13:05:52,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [400012726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:52,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:52,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 13:05:52,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690882080] [2022-04-15 13:05:52,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:52,458 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 48 [2022-04-15 13:05:52,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:52,458 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-15 13:05:52,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:52,606 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 13:05:52,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:52,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 13:05:52,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1448, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 13:05:52,606 INFO L87 Difference]: Start difference. First operand 49 states and 49 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-15 13:06:53,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:53,208 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-15 13:06:53,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 13:06:53,208 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 48 [2022-04-15 13:06:53,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:53,209 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-15 13:06:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 57 transitions. [2022-04-15 13:06:53,210 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-15 13:06:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 57 transitions. [2022-04-15 13:06:53,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 57 transitions. [2022-04-15 13:06:53,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:53,555 INFO L225 Difference]: With dead ends: 57 [2022-04-15 13:06:53,555 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 13:06:53,556 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 61 SyntacticMatches, 35 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=354, Invalid=5196, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 13:06:53,556 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:53,556 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 190 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 23.5s Time] [2022-04-15 13:06:53,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 13:06:53,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-15 13:06:53,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:53,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 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-15 13:06:53,609 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 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-15 13:06:53,609 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 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-15 13:06:53,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:53,610 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 13:06:53,610 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 13:06:53,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:53,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:53,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 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 50 states. [2022-04-15 13:06:53,611 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 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 50 states. [2022-04-15 13:06:53,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:53,611 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 13:06:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 13:06:53,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:53,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:53,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:53,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:53,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 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-15 13:06:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-04-15 13:06:53,613 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2022-04-15 13:06:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:53,613 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-04-15 13:06:53,613 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-15 13:06:53,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 50 transitions. [2022-04-15 13:06:54,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:54,194 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 13:06:54,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 13:06:54,194 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:54,194 INFO L499 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:06:54,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-15 13:06:54,395 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,SelfDestructingSolverStorable35 [2022-04-15 13:06:54,395 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:54,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:54,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1185518562, now seen corresponding path program 69 times [2022-04-15 13:06:54,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:54,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [378989014] [2022-04-15 13:06:56,035 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:06:56,035 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:06:56,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1185518562, now seen corresponding path program 70 times [2022-04-15 13:06:56,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:56,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185255690] [2022-04-15 13:06:56,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:56,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:57,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:06:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:57,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {16629#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {16588#true} is VALID [2022-04-15 13:06:57,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {16588#true} assume true; {16588#true} is VALID [2022-04-15 13:06:57,295 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16588#true} {16588#true} #62#return; {16588#true} is VALID [2022-04-15 13:06:57,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {16588#true} call ULTIMATE.init(); {16629#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:06:57,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {16629#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {16588#true} is VALID [2022-04-15 13:06:57,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {16588#true} assume true; {16588#true} is VALID [2022-04-15 13:06:57,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16588#true} {16588#true} #62#return; {16588#true} is VALID [2022-04-15 13:06:57,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {16588#true} call #t~ret5 := main(); {16588#true} is VALID [2022-04-15 13:06:57,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {16588#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {16588#true} is VALID [2022-04-15 13:06:57,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {16588#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {16593#(= main_~i~0 0)} is VALID [2022-04-15 13:06:57,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {16593#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16594#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:06:57,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {16594#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16595#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:06:57,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {16595#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16596#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:06:57,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {16596#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16597#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:06:57,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {16597#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16598#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:06:57,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {16598#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16599#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:06:57,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {16599#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16600#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:06:57,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {16600#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16601#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:06:57,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {16601#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16602#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:06:57,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {16602#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16603#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:06:57,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {16603#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16604#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:06:57,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {16604#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16605#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:06:57,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {16605#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16606#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:06:57,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {16606#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16607#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:06:57,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {16607#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16608#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:06:57,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {16608#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16609#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:06:57,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {16609#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16610#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:06:57,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {16610#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16611#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:06:57,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {16611#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16612#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:06:57,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {16612#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16613#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:06:57,829 INFO L290 TraceCheckUtils]: 27: Hoare triple {16613#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16614#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:06:57,861 INFO L290 TraceCheckUtils]: 28: Hoare triple {16614#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16615#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:06:57,863 INFO L290 TraceCheckUtils]: 29: Hoare triple {16615#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16616#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:06:57,892 INFO L290 TraceCheckUtils]: 30: Hoare triple {16616#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16617#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:06:57,917 INFO L290 TraceCheckUtils]: 31: Hoare triple {16617#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16618#(and (<= 100 main_~i~0) (<= main_~i~0 100))} is VALID [2022-04-15 13:06:57,942 INFO L290 TraceCheckUtils]: 32: Hoare triple {16618#(and (<= 100 main_~i~0) (<= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16619#(and (<= main_~i~0 104) (<= 104 main_~i~0))} is VALID [2022-04-15 13:06:57,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {16619#(and (<= main_~i~0 104) (<= 104 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16620#(and (<= 108 main_~i~0) (<= main_~i~0 108))} is VALID [2022-04-15 13:06:57,998 INFO L290 TraceCheckUtils]: 34: Hoare triple {16620#(and (<= 108 main_~i~0) (<= main_~i~0 108))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16621#(and (<= 112 main_~i~0) (<= main_~i~0 112))} is VALID [2022-04-15 13:06:58,031 INFO L290 TraceCheckUtils]: 35: Hoare triple {16621#(and (<= 112 main_~i~0) (<= main_~i~0 112))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16622#(and (<= main_~i~0 116) (<= 116 main_~i~0))} is VALID [2022-04-15 13:06:58,064 INFO L290 TraceCheckUtils]: 36: Hoare triple {16622#(and (<= main_~i~0 116) (<= 116 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16623#(and (<= main_~i~0 120) (<= 120 main_~i~0))} is VALID [2022-04-15 13:06:58,092 INFO L290 TraceCheckUtils]: 37: Hoare triple {16623#(and (<= main_~i~0 120) (<= 120 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16624#(and (<= main_~i~0 124) (<= 124 main_~i~0))} is VALID [2022-04-15 13:06:58,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {16624#(and (<= main_~i~0 124) (<= 124 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16625#(and (<= 128 main_~i~0) (<= main_~i~0 128))} is VALID [2022-04-15 13:06:58,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {16625#(and (<= 128 main_~i~0) (<= main_~i~0 128))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16626#(and (<= main_~i~0 132) (<= 132 main_~i~0))} is VALID [2022-04-15 13:06:58,172 INFO L290 TraceCheckUtils]: 40: Hoare triple {16626#(and (<= main_~i~0 132) (<= 132 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16627#(and (<= 136 main_~i~0) (<= main_~i~0 136))} is VALID [2022-04-15 13:06:58,202 INFO L290 TraceCheckUtils]: 41: Hoare triple {16627#(and (<= 136 main_~i~0) (<= main_~i~0 136))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16628#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:06:58,203 INFO L290 TraceCheckUtils]: 42: Hoare triple {16628#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {16628#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:06:58,203 INFO L290 TraceCheckUtils]: 43: Hoare triple {16628#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {16628#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:06:58,213 INFO L290 TraceCheckUtils]: 44: Hoare triple {16628#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {16589#false} is VALID [2022-04-15 13:06:58,213 INFO L272 TraceCheckUtils]: 45: Hoare triple {16589#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {16589#false} is VALID [2022-04-15 13:06:58,213 INFO L290 TraceCheckUtils]: 46: Hoare triple {16589#false} ~cond := #in~cond; {16589#false} is VALID [2022-04-15 13:06:58,213 INFO L290 TraceCheckUtils]: 47: Hoare triple {16589#false} assume 0 == ~cond; {16589#false} is VALID [2022-04-15 13:06:58,213 INFO L290 TraceCheckUtils]: 48: Hoare triple {16589#false} assume !false; {16589#false} is VALID [2022-04-15 13:06:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:58,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:58,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185255690] [2022-04-15 13:06:58,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185255690] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:06:58,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367322479] [2022-04-15 13:06:58,214 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:06:58,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:06:58,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:06:58,215 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:06:58,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-15 13:06:58,266 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:06:58,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:06:58,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 75 conjunts are in the unsatisfiable core [2022-04-15 13:06:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:58,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:06:58,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {16588#true} call ULTIMATE.init(); {16588#true} is VALID [2022-04-15 13:06:58,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {16588#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {16588#true} is VALID [2022-04-15 13:06:58,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {16588#true} assume true; {16588#true} is VALID [2022-04-15 13:06:58,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16588#true} {16588#true} #62#return; {16588#true} is VALID [2022-04-15 13:06:58,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {16588#true} call #t~ret5 := main(); {16588#true} is VALID [2022-04-15 13:06:58,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {16588#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {16588#true} is VALID [2022-04-15 13:06:58,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {16588#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {16593#(= main_~i~0 0)} is VALID [2022-04-15 13:06:58,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {16593#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16594#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:06:58,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {16594#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16595#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:06:58,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {16595#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16596#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:06:58,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {16596#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16597#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:06:58,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {16597#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16598#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:06:58,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {16598#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16599#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:06:58,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {16599#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16600#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:06:58,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {16600#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16601#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:06:59,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {16601#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16602#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:06:59,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {16602#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16603#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:06:59,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {16603#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16604#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:06:59,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {16604#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16605#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:06:59,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {16605#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16606#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:06:59,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {16606#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16607#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:06:59,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {16607#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16608#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:06:59,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {16608#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16609#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:06:59,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {16609#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16610#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:06:59,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {16610#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16611#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:06:59,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {16611#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16612#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:06:59,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {16612#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16613#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:06:59,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {16613#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16614#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:06:59,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {16614#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16615#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:06:59,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {16615#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16616#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:06:59,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {16616#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16617#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:06:59,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {16617#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16618#(and (<= 100 main_~i~0) (<= main_~i~0 100))} is VALID [2022-04-15 13:06:59,356 INFO L290 TraceCheckUtils]: 32: Hoare triple {16618#(and (<= 100 main_~i~0) (<= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16619#(and (<= main_~i~0 104) (<= 104 main_~i~0))} is VALID [2022-04-15 13:06:59,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {16619#(and (<= main_~i~0 104) (<= 104 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16620#(and (<= 108 main_~i~0) (<= main_~i~0 108))} is VALID [2022-04-15 13:06:59,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {16620#(and (<= 108 main_~i~0) (<= main_~i~0 108))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16621#(and (<= 112 main_~i~0) (<= main_~i~0 112))} is VALID [2022-04-15 13:06:59,451 INFO L290 TraceCheckUtils]: 35: Hoare triple {16621#(and (<= 112 main_~i~0) (<= main_~i~0 112))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16622#(and (<= main_~i~0 116) (<= 116 main_~i~0))} is VALID [2022-04-15 13:06:59,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {16622#(and (<= main_~i~0 116) (<= 116 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16623#(and (<= main_~i~0 120) (<= 120 main_~i~0))} is VALID [2022-04-15 13:06:59,510 INFO L290 TraceCheckUtils]: 37: Hoare triple {16623#(and (<= main_~i~0 120) (<= 120 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16624#(and (<= main_~i~0 124) (<= 124 main_~i~0))} is VALID [2022-04-15 13:06:59,543 INFO L290 TraceCheckUtils]: 38: Hoare triple {16624#(and (<= main_~i~0 124) (<= 124 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16625#(and (<= 128 main_~i~0) (<= main_~i~0 128))} is VALID [2022-04-15 13:06:59,569 INFO L290 TraceCheckUtils]: 39: Hoare triple {16625#(and (<= 128 main_~i~0) (<= main_~i~0 128))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16626#(and (<= main_~i~0 132) (<= 132 main_~i~0))} is VALID [2022-04-15 13:06:59,596 INFO L290 TraceCheckUtils]: 40: Hoare triple {16626#(and (<= main_~i~0 132) (<= 132 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16627#(and (<= 136 main_~i~0) (<= main_~i~0 136))} is VALID [2022-04-15 13:06:59,628 INFO L290 TraceCheckUtils]: 41: Hoare triple {16627#(and (<= 136 main_~i~0) (<= main_~i~0 136))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16756#(and (<= main_~j~0 142) (<= 142 main_~j~0))} is VALID [2022-04-15 13:06:59,629 INFO L290 TraceCheckUtils]: 42: Hoare triple {16756#(and (<= main_~j~0 142) (<= 142 main_~j~0))} assume !(~i~0 < ~n~0); {16756#(and (<= main_~j~0 142) (<= 142 main_~j~0))} is VALID [2022-04-15 13:06:59,629 INFO L290 TraceCheckUtils]: 43: Hoare triple {16756#(and (<= main_~j~0 142) (<= 142 main_~j~0))} ~k~0 := ~i~0; {16756#(and (<= main_~j~0 142) (<= 142 main_~j~0))} is VALID [2022-04-15 13:06:59,631 INFO L290 TraceCheckUtils]: 44: Hoare triple {16756#(and (<= main_~j~0 142) (<= 142 main_~j~0))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {16589#false} is VALID [2022-04-15 13:06:59,631 INFO L272 TraceCheckUtils]: 45: Hoare triple {16589#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {16589#false} is VALID [2022-04-15 13:06:59,631 INFO L290 TraceCheckUtils]: 46: Hoare triple {16589#false} ~cond := #in~cond; {16589#false} is VALID [2022-04-15 13:06:59,632 INFO L290 TraceCheckUtils]: 47: Hoare triple {16589#false} assume 0 == ~cond; {16589#false} is VALID [2022-04-15 13:06:59,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {16589#false} assume !false; {16589#false} is VALID [2022-04-15 13:06:59,632 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:59,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:07:14,969 INFO L290 TraceCheckUtils]: 48: Hoare triple {16589#false} assume !false; {16589#false} is VALID [2022-04-15 13:07:14,969 INFO L290 TraceCheckUtils]: 47: Hoare triple {16589#false} assume 0 == ~cond; {16589#false} is VALID [2022-04-15 13:07:14,969 INFO L290 TraceCheckUtils]: 46: Hoare triple {16589#false} ~cond := #in~cond; {16589#false} is VALID [2022-04-15 13:07:14,969 INFO L272 TraceCheckUtils]: 45: Hoare triple {16589#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {16589#false} is VALID [2022-04-15 13:07:14,980 INFO L290 TraceCheckUtils]: 44: Hoare triple {16628#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {16589#false} is VALID [2022-04-15 13:07:14,981 INFO L290 TraceCheckUtils]: 43: Hoare triple {16628#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {16628#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:07:14,981 INFO L290 TraceCheckUtils]: 42: Hoare triple {16628#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {16628#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:07:15,014 INFO L290 TraceCheckUtils]: 41: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16628#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:07:15,044 INFO L290 TraceCheckUtils]: 40: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,073 INFO L290 TraceCheckUtils]: 39: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,123 INFO L290 TraceCheckUtils]: 37: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,147 INFO L290 TraceCheckUtils]: 36: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,171 INFO L290 TraceCheckUtils]: 35: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,195 INFO L290 TraceCheckUtils]: 34: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,221 INFO L290 TraceCheckUtils]: 33: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,245 INFO L290 TraceCheckUtils]: 32: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,276 INFO L290 TraceCheckUtils]: 31: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,309 INFO L290 TraceCheckUtils]: 30: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,333 INFO L290 TraceCheckUtils]: 29: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {16588#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {16799#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:07:15,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {16588#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {16588#true} is VALID [2022-04-15 13:07:15,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {16588#true} call #t~ret5 := main(); {16588#true} is VALID [2022-04-15 13:07:15,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16588#true} {16588#true} #62#return; {16588#true} is VALID [2022-04-15 13:07:15,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {16588#true} assume true; {16588#true} is VALID [2022-04-15 13:07:15,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {16588#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {16588#true} is VALID [2022-04-15 13:07:15,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {16588#true} call ULTIMATE.init(); {16588#true} is VALID [2022-04-15 13:07:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2022-04-15 13:07:15,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367322479] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:07:15,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:07:15,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 4] total 41 [2022-04-15 13:07:15,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:07:15,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [378989014] [2022-04-15 13:07:15,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [378989014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:15,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:15,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 13:07:15,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604185161] [2022-04-15 13:07:15,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:07:15,863 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 49 [2022-04-15 13:07:15,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:07:15,863 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-15 13:07:16,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:16,043 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 13:07:16,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:16,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 13:07:16,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 13:07:16,044 INFO L87 Difference]: Start difference. First operand 50 states and 50 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-15 13:08:41,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:41,267 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-15 13:08:41,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 13:08:41,268 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 49 [2022-04-15 13:08:41,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:08:41,268 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-15 13:08:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2022-04-15 13:08:41,269 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-15 13:08:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2022-04-15 13:08:41,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 58 transitions. [2022-04-15 13:08:41,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:08:41,771 INFO L225 Difference]: With dead ends: 58 [2022-04-15 13:08:41,771 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 13:08:41,772 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 62 SyntacticMatches, 36 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=364, Invalid=5488, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 13:08:41,772 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:08:41,772 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 195 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 32.2s Time] [2022-04-15 13:08:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 13:08:41,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-15 13:08:41,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:08:41,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:41,820 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:41,820 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:41,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:41,821 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 13:08:41,821 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 13:08:41,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:08:41,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:08:41,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 13:08:41,822 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 13:08:41,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:41,822 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 13:08:41,823 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 13:08:41,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:08:41,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:08:41,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:08:41,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:08:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-15 13:08:41,824 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2022-04-15 13:08:41,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:08:41,824 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-15 13:08:41,824 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-15 13:08:41,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-15 13:08:42,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:08:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 13:08:42,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 13:08:42,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:08:42,590 INFO L499 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:08:42,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-04-15 13:08:42,790 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,SelfDestructingSolverStorable36 [2022-04-15 13:08:42,791 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:08:42,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:08:42,791 INFO L85 PathProgramCache]: Analyzing trace with hash -158938447, now seen corresponding path program 71 times [2022-04-15 13:08:42,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:08:42,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2006471877] [2022-04-15 13:08:44,182 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:08:44,182 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:08:44,182 INFO L85 PathProgramCache]: Analyzing trace with hash -158938447, now seen corresponding path program 72 times [2022-04-15 13:08:44,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:08:44,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370692074] [2022-04-15 13:08:44,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:08:44,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:08:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:08:45,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:08:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:08:45,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {17359#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {17317#true} is VALID [2022-04-15 13:08:45,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {17317#true} assume true; {17317#true} is VALID [2022-04-15 13:08:45,661 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17317#true} {17317#true} #62#return; {17317#true} is VALID [2022-04-15 13:08:45,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {17317#true} call ULTIMATE.init(); {17359#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:08:45,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {17359#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {17317#true} is VALID [2022-04-15 13:08:45,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {17317#true} assume true; {17317#true} is VALID [2022-04-15 13:08:45,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17317#true} {17317#true} #62#return; {17317#true} is VALID [2022-04-15 13:08:45,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {17317#true} call #t~ret5 := main(); {17317#true} is VALID [2022-04-15 13:08:45,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {17317#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {17317#true} is VALID [2022-04-15 13:08:45,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {17317#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {17322#(= main_~i~0 0)} is VALID [2022-04-15 13:08:45,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {17322#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17323#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:08:45,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {17323#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17324#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:08:45,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {17324#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17325#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:08:45,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {17325#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17326#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:08:45,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {17326#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17327#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:08:45,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {17327#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17328#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:08:45,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {17328#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17329#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:08:45,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {17329#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17330#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:08:45,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {17330#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17331#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:08:45,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {17331#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17332#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:08:45,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {17332#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17333#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:08:45,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {17333#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17334#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:08:46,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {17334#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17335#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:08:46,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {17335#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17336#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:08:46,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {17336#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17337#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:08:46,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {17337#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17338#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:08:46,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {17338#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17339#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:08:46,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {17339#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17340#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:08:46,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {17340#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17341#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:08:46,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {17341#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17342#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:08:46,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {17342#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17343#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:08:46,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {17343#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17344#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:08:46,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {17344#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17345#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:08:46,335 INFO L290 TraceCheckUtils]: 30: Hoare triple {17345#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17346#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:08:46,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {17346#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17347#(and (<= 100 main_~i~0) (<= main_~i~0 100))} is VALID [2022-04-15 13:08:46,392 INFO L290 TraceCheckUtils]: 32: Hoare triple {17347#(and (<= 100 main_~i~0) (<= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17348#(and (<= main_~i~0 104) (<= 104 main_~i~0))} is VALID [2022-04-15 13:08:46,427 INFO L290 TraceCheckUtils]: 33: Hoare triple {17348#(and (<= main_~i~0 104) (<= 104 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17349#(and (<= 108 main_~i~0) (<= main_~i~0 108))} is VALID [2022-04-15 13:08:46,463 INFO L290 TraceCheckUtils]: 34: Hoare triple {17349#(and (<= 108 main_~i~0) (<= main_~i~0 108))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17350#(and (<= 112 main_~i~0) (<= main_~i~0 112))} is VALID [2022-04-15 13:08:46,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {17350#(and (<= 112 main_~i~0) (<= main_~i~0 112))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17351#(and (<= main_~i~0 116) (<= 116 main_~i~0))} is VALID [2022-04-15 13:08:46,532 INFO L290 TraceCheckUtils]: 36: Hoare triple {17351#(and (<= main_~i~0 116) (<= 116 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17352#(and (<= main_~i~0 120) (<= 120 main_~i~0))} is VALID [2022-04-15 13:08:46,562 INFO L290 TraceCheckUtils]: 37: Hoare triple {17352#(and (<= main_~i~0 120) (<= 120 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17353#(and (<= main_~i~0 124) (<= 124 main_~i~0))} is VALID [2022-04-15 13:08:46,596 INFO L290 TraceCheckUtils]: 38: Hoare triple {17353#(and (<= main_~i~0 124) (<= 124 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17354#(and (<= 128 main_~i~0) (<= main_~i~0 128))} is VALID [2022-04-15 13:08:46,625 INFO L290 TraceCheckUtils]: 39: Hoare triple {17354#(and (<= 128 main_~i~0) (<= main_~i~0 128))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17355#(and (<= main_~i~0 132) (<= 132 main_~i~0))} is VALID [2022-04-15 13:08:46,653 INFO L290 TraceCheckUtils]: 40: Hoare triple {17355#(and (<= main_~i~0 132) (<= 132 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17356#(and (<= 136 main_~i~0) (<= main_~i~0 136))} is VALID [2022-04-15 13:08:46,687 INFO L290 TraceCheckUtils]: 41: Hoare triple {17356#(and (<= 136 main_~i~0) (<= main_~i~0 136))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17357#(and (<= 140 main_~i~0) (<= main_~i~0 140))} is VALID [2022-04-15 13:08:46,723 INFO L290 TraceCheckUtils]: 42: Hoare triple {17357#(and (<= 140 main_~i~0) (<= main_~i~0 140))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17358#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:08:46,724 INFO L290 TraceCheckUtils]: 43: Hoare triple {17358#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {17358#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:08:46,724 INFO L290 TraceCheckUtils]: 44: Hoare triple {17358#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {17358#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:08:46,737 INFO L290 TraceCheckUtils]: 45: Hoare triple {17358#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {17318#false} is VALID [2022-04-15 13:08:46,738 INFO L272 TraceCheckUtils]: 46: Hoare triple {17318#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {17318#false} is VALID [2022-04-15 13:08:46,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {17318#false} ~cond := #in~cond; {17318#false} is VALID [2022-04-15 13:08:46,738 INFO L290 TraceCheckUtils]: 48: Hoare triple {17318#false} assume 0 == ~cond; {17318#false} is VALID [2022-04-15 13:08:46,738 INFO L290 TraceCheckUtils]: 49: Hoare triple {17318#false} assume !false; {17318#false} is VALID [2022-04-15 13:08:46,738 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:08:46,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:08:46,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370692074] [2022-04-15 13:08:46,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370692074] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:08:46,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237918019] [2022-04-15 13:08:46,739 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:08:46,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:08:46,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:08:46,740 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:08:46,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-15 13:08:46,803 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-15 13:08:46,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:08:46,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 79 conjunts are in the unsatisfiable core [2022-04-15 13:08:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:08:46,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:09:45,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {17317#true} call ULTIMATE.init(); {17317#true} is VALID [2022-04-15 13:09:45,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {17317#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {17317#true} is VALID [2022-04-15 13:09:45,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {17317#true} assume true; {17317#true} is VALID [2022-04-15 13:09:45,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17317#true} {17317#true} #62#return; {17317#true} is VALID [2022-04-15 13:09:45,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {17317#true} call #t~ret5 := main(); {17317#true} is VALID [2022-04-15 13:09:45,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {17317#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {17317#true} is VALID [2022-04-15 13:09:45,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {17317#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {17322#(= main_~i~0 0)} is VALID [2022-04-15 13:09:45,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {17322#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17323#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:09:45,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {17323#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17387#(and (< main_~i~0 (+ main_~n~0 4)) (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:09:45,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {17387#(and (< main_~i~0 (+ main_~n~0 4)) (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17391#(and (<= 12 main_~i~0) (<= main_~i~0 12) (< main_~i~0 (+ main_~n~0 8)))} is VALID [2022-04-15 13:09:45,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {17391#(and (<= 12 main_~i~0) (<= main_~i~0 12) (< main_~i~0 (+ main_~n~0 8)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17395#(and (<= main_~i~0 16) (<= 16 main_~i~0) (< main_~i~0 (+ main_~n~0 12)))} is VALID [2022-04-15 13:09:45,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {17395#(and (<= main_~i~0 16) (<= 16 main_~i~0) (< main_~i~0 (+ main_~n~0 12)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17399#(and (< main_~i~0 (+ main_~n~0 16)) (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:09:45,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {17399#(and (< main_~i~0 (+ main_~n~0 16)) (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17403#(and (<= 24 main_~i~0) (<= main_~i~0 24) (< main_~i~0 (+ main_~n~0 20)))} is VALID [2022-04-15 13:09:45,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {17403#(and (<= 24 main_~i~0) (<= main_~i~0 24) (< main_~i~0 (+ main_~n~0 20)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17407#(and (<= main_~i~0 28) (<= 28 main_~i~0) (< main_~i~0 (+ main_~n~0 24)))} is VALID [2022-04-15 13:09:45,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {17407#(and (<= main_~i~0 28) (<= 28 main_~i~0) (< main_~i~0 (+ main_~n~0 24)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17411#(and (< main_~i~0 (+ main_~n~0 28)) (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:09:45,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {17411#(and (< main_~i~0 (+ main_~n~0 28)) (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17415#(and (<= 36 main_~i~0) (< main_~i~0 (+ 32 main_~n~0)) (<= main_~i~0 36))} is VALID [2022-04-15 13:09:45,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {17415#(and (<= 36 main_~i~0) (< main_~i~0 (+ 32 main_~n~0)) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17419#(and (< main_~i~0 (+ main_~n~0 36)) (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:09:45,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {17419#(and (< main_~i~0 (+ main_~n~0 36)) (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17423#(and (<= 44 main_~i~0) (< main_~i~0 (+ 40 main_~n~0)) (<= main_~i~0 44))} is VALID [2022-04-15 13:09:45,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {17423#(and (<= 44 main_~i~0) (< main_~i~0 (+ 40 main_~n~0)) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17427#(and (<= 48 main_~i~0) (< main_~i~0 (+ 44 main_~n~0)) (<= main_~i~0 48))} is VALID [2022-04-15 13:09:45,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {17427#(and (<= 48 main_~i~0) (< main_~i~0 (+ 44 main_~n~0)) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17431#(and (<= 52 main_~i~0) (<= main_~i~0 52) (< main_~i~0 (+ main_~n~0 48)))} is VALID [2022-04-15 13:09:45,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {17431#(and (<= 52 main_~i~0) (<= main_~i~0 52) (< main_~i~0 (+ main_~n~0 48)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17435#(and (<= main_~i~0 56) (<= 56 main_~i~0) (< main_~i~0 (+ main_~n~0 52)))} is VALID [2022-04-15 13:09:45,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {17435#(and (<= main_~i~0 56) (<= 56 main_~i~0) (< main_~i~0 (+ main_~n~0 52)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17439#(and (<= main_~i~0 60) (< main_~i~0 (+ 56 main_~n~0)) (<= 60 main_~i~0))} is VALID [2022-04-15 13:09:45,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {17439#(and (<= main_~i~0 60) (< main_~i~0 (+ 56 main_~n~0)) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17443#(and (< main_~i~0 (+ main_~n~0 60)) (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:09:45,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {17443#(and (< main_~i~0 (+ main_~n~0 60)) (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17447#(and (<= 68 main_~i~0) (<= main_~i~0 68) (< main_~i~0 (+ 64 main_~n~0)))} is VALID [2022-04-15 13:09:45,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {17447#(and (<= 68 main_~i~0) (<= main_~i~0 68) (< main_~i~0 (+ 64 main_~n~0)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17451#(and (<= main_~i~0 72) (<= 72 main_~i~0) (< main_~i~0 (+ 68 main_~n~0)))} is VALID [2022-04-15 13:09:45,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {17451#(and (<= main_~i~0 72) (<= 72 main_~i~0) (< main_~i~0 (+ 68 main_~n~0)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17455#(and (<= main_~i~0 76) (< main_~i~0 (+ 72 main_~n~0)) (<= 76 main_~i~0))} is VALID [2022-04-15 13:09:45,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {17455#(and (<= main_~i~0 76) (< main_~i~0 (+ 72 main_~n~0)) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17459#(and (<= 80 main_~i~0) (<= main_~i~0 80) (< main_~i~0 (+ 76 main_~n~0)))} is VALID [2022-04-15 13:09:45,546 INFO L290 TraceCheckUtils]: 27: Hoare triple {17459#(and (<= 80 main_~i~0) (<= main_~i~0 80) (< main_~i~0 (+ 76 main_~n~0)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17463#(and (< main_~i~0 (+ main_~n~0 80)) (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:09:45,582 INFO L290 TraceCheckUtils]: 28: Hoare triple {17463#(and (< main_~i~0 (+ main_~n~0 80)) (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17467#(and (<= 88 main_~i~0) (< main_~i~0 (+ 84 main_~n~0)) (<= main_~i~0 88))} is VALID [2022-04-15 13:09:45,604 INFO L290 TraceCheckUtils]: 29: Hoare triple {17467#(and (<= 88 main_~i~0) (< main_~i~0 (+ 84 main_~n~0)) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17471#(and (<= main_~i~0 92) (< main_~i~0 (+ 88 main_~n~0)) (<= 92 main_~i~0))} is VALID [2022-04-15 13:09:45,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {17471#(and (<= main_~i~0 92) (< main_~i~0 (+ 88 main_~n~0)) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17475#(and (< main_~i~0 (+ 92 main_~n~0)) (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:09:45,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {17475#(and (< main_~i~0 (+ 92 main_~n~0)) (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17479#(and (<= 100 main_~i~0) (<= main_~i~0 100) (< main_~i~0 (+ main_~n~0 96)))} is VALID [2022-04-15 13:09:45,716 INFO L290 TraceCheckUtils]: 32: Hoare triple {17479#(and (<= 100 main_~i~0) (<= main_~i~0 100) (< main_~i~0 (+ main_~n~0 96)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17483#(and (<= main_~i~0 104) (<= 104 main_~i~0) (< main_~i~0 (+ main_~n~0 100)))} is VALID [2022-04-15 13:09:45,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {17483#(and (<= main_~i~0 104) (<= 104 main_~i~0) (< main_~i~0 (+ main_~n~0 100)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17487#(and (<= 108 main_~i~0) (< main_~i~0 (+ 104 main_~n~0)) (<= main_~i~0 108))} is VALID [2022-04-15 13:09:45,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {17487#(and (<= 108 main_~i~0) (< main_~i~0 (+ 104 main_~n~0)) (<= main_~i~0 108))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17491#(and (<= 112 main_~i~0) (< main_~i~0 (+ 108 main_~n~0)) (<= main_~i~0 112))} is VALID [2022-04-15 13:09:45,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {17491#(and (<= 112 main_~i~0) (< main_~i~0 (+ 108 main_~n~0)) (<= main_~i~0 112))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17495#(and (<= main_~i~0 116) (<= 116 main_~i~0) (< main_~i~0 (+ 112 main_~n~0)))} is VALID [2022-04-15 13:09:45,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {17495#(and (<= main_~i~0 116) (<= 116 main_~i~0) (< main_~i~0 (+ 112 main_~n~0)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17499#(and (< main_~i~0 (+ 116 main_~n~0)) (<= main_~i~0 120) (<= 120 main_~i~0))} is VALID [2022-04-15 13:09:45,884 INFO L290 TraceCheckUtils]: 37: Hoare triple {17499#(and (< main_~i~0 (+ 116 main_~n~0)) (<= main_~i~0 120) (<= 120 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17503#(and (<= main_~i~0 124) (<= 124 main_~i~0) (< main_~i~0 (+ main_~n~0 120)))} is VALID [2022-04-15 13:09:45,905 INFO L290 TraceCheckUtils]: 38: Hoare triple {17503#(and (<= main_~i~0 124) (<= 124 main_~i~0) (< main_~i~0 (+ main_~n~0 120)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17507#(and (< main_~i~0 (+ main_~n~0 124)) (<= 128 main_~i~0) (<= main_~i~0 128))} is VALID [2022-04-15 13:09:45,944 INFO L290 TraceCheckUtils]: 39: Hoare triple {17507#(and (< main_~i~0 (+ main_~n~0 124)) (<= 128 main_~i~0) (<= main_~i~0 128))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17511#(and (< main_~i~0 (+ main_~n~0 128)) (<= main_~i~0 132) (<= 132 main_~i~0))} is VALID [2022-04-15 13:09:45,980 INFO L290 TraceCheckUtils]: 40: Hoare triple {17511#(and (< main_~i~0 (+ main_~n~0 128)) (<= main_~i~0 132) (<= 132 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17515#(and (<= 136 main_~i~0) (< main_~i~0 (+ main_~n~0 132)) (<= main_~i~0 136))} is VALID [2022-04-15 13:09:46,015 INFO L290 TraceCheckUtils]: 41: Hoare triple {17515#(and (<= 136 main_~i~0) (< main_~i~0 (+ main_~n~0 132)) (<= main_~i~0 136))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17519#(and (<= 140 main_~i~0) (<= main_~i~0 140) (< main_~i~0 (+ main_~n~0 136)))} is VALID [2022-04-15 13:09:46,051 INFO L290 TraceCheckUtils]: 42: Hoare triple {17519#(and (<= 140 main_~i~0) (<= main_~i~0 140) (< main_~i~0 (+ main_~n~0 136)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17523#(and (= main_~j~0 (+ main_~i~0 2)) (<= main_~i~0 144) (<= 144 main_~i~0) (< main_~i~0 (+ 140 main_~n~0)))} is VALID [2022-04-15 13:09:46,072 INFO L290 TraceCheckUtils]: 43: Hoare triple {17523#(and (= main_~j~0 (+ main_~i~0 2)) (<= main_~i~0 144) (<= 144 main_~i~0) (< main_~i~0 (+ 140 main_~n~0)))} assume !(~i~0 < ~n~0); {17527#(and (<= main_~j~0 146) (<= 146 main_~j~0))} is VALID [2022-04-15 13:09:46,073 INFO L290 TraceCheckUtils]: 44: Hoare triple {17527#(and (<= main_~j~0 146) (<= 146 main_~j~0))} ~k~0 := ~i~0; {17527#(and (<= main_~j~0 146) (<= 146 main_~j~0))} is VALID [2022-04-15 13:09:46,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {17527#(and (<= main_~j~0 146) (<= 146 main_~j~0))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {17318#false} is VALID [2022-04-15 13:09:46,075 INFO L272 TraceCheckUtils]: 46: Hoare triple {17318#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {17318#false} is VALID [2022-04-15 13:09:46,075 INFO L290 TraceCheckUtils]: 47: Hoare triple {17318#false} ~cond := #in~cond; {17318#false} is VALID [2022-04-15 13:09:46,075 INFO L290 TraceCheckUtils]: 48: Hoare triple {17318#false} assume 0 == ~cond; {17318#false} is VALID [2022-04-15 13:09:46,075 INFO L290 TraceCheckUtils]: 49: Hoare triple {17318#false} assume !false; {17318#false} is VALID [2022-04-15 13:09:46,076 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:09:46,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:11:17,627 INFO L290 TraceCheckUtils]: 49: Hoare triple {17318#false} assume !false; {17318#false} is VALID [2022-04-15 13:11:17,628 INFO L290 TraceCheckUtils]: 48: Hoare triple {17318#false} assume 0 == ~cond; {17318#false} is VALID [2022-04-15 13:11:17,628 INFO L290 TraceCheckUtils]: 47: Hoare triple {17318#false} ~cond := #in~cond; {17318#false} is VALID [2022-04-15 13:11:17,628 INFO L272 TraceCheckUtils]: 46: Hoare triple {17318#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {17318#false} is VALID [2022-04-15 13:11:17,641 INFO L290 TraceCheckUtils]: 45: Hoare triple {17358#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {17318#false} is VALID [2022-04-15 13:11:17,642 INFO L290 TraceCheckUtils]: 44: Hoare triple {17358#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {17358#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:11:17,642 INFO L290 TraceCheckUtils]: 43: Hoare triple {17564#(or (< main_~i~0 main_~n~0) (= (* 2 (div main_~j~0 2)) main_~j~0))} assume !(~i~0 < ~n~0); {17358#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:11:17,677 INFO L290 TraceCheckUtils]: 42: Hoare triple {17568#(or (< (+ main_~i~0 4) main_~n~0) (= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17564#(or (< main_~i~0 main_~n~0) (= (* 2 (div main_~j~0 2)) main_~j~0))} is VALID [2022-04-15 13:11:17,714 INFO L290 TraceCheckUtils]: 41: Hoare triple {17572#(or (< (+ main_~i~0 8) main_~n~0) (= (+ main_~i~0 10) (* 2 (div (+ main_~i~0 10) 2))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17568#(or (< (+ main_~i~0 4) main_~n~0) (= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2)))} is VALID [2022-04-15 13:11:17,749 INFO L290 TraceCheckUtils]: 40: Hoare triple {17576#(or (= (+ main_~i~0 14) (* 2 (div (+ main_~i~0 14) 2))) (< (+ main_~i~0 12) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17572#(or (< (+ main_~i~0 8) main_~n~0) (= (+ main_~i~0 10) (* 2 (div (+ main_~i~0 10) 2))))} is VALID [2022-04-15 13:11:17,787 INFO L290 TraceCheckUtils]: 39: Hoare triple {17580#(or (= (+ main_~i~0 18) (* 2 (div (+ main_~i~0 18) 2))) (< (+ main_~i~0 16) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17576#(or (= (+ main_~i~0 14) (* 2 (div (+ main_~i~0 14) 2))) (< (+ main_~i~0 12) main_~n~0))} is VALID [2022-04-15 13:11:17,823 INFO L290 TraceCheckUtils]: 38: Hoare triple {17584#(or (< (+ main_~i~0 20) main_~n~0) (= (* (div (+ main_~i~0 22) 2) 2) (+ main_~i~0 22)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17580#(or (= (+ main_~i~0 18) (* 2 (div (+ main_~i~0 18) 2))) (< (+ main_~i~0 16) main_~n~0))} is VALID [2022-04-15 13:11:17,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {17588#(or (= (+ main_~i~0 26) (* 2 (div (+ main_~i~0 26) 2))) (< (+ main_~i~0 24) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17584#(or (< (+ main_~i~0 20) main_~n~0) (= (* (div (+ main_~i~0 22) 2) 2) (+ main_~i~0 22)))} is VALID [2022-04-15 13:11:17,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {17592#(or (< (+ main_~i~0 28) main_~n~0) (= (* 2 (div (+ 30 main_~i~0) 2)) (+ 30 main_~i~0)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17588#(or (= (+ main_~i~0 26) (* 2 (div (+ main_~i~0 26) 2))) (< (+ main_~i~0 24) main_~n~0))} is VALID [2022-04-15 13:11:17,922 INFO L290 TraceCheckUtils]: 35: Hoare triple {17596#(or (< (+ 32 main_~i~0) main_~n~0) (= (+ main_~i~0 34) (* (div (+ main_~i~0 34) 2) 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17592#(or (< (+ main_~i~0 28) main_~n~0) (= (* 2 (div (+ 30 main_~i~0) 2)) (+ 30 main_~i~0)))} is VALID [2022-04-15 13:11:17,959 INFO L290 TraceCheckUtils]: 34: Hoare triple {17600#(or (< (+ main_~i~0 36) main_~n~0) (= (* (div (+ main_~i~0 38) 2) 2) (+ main_~i~0 38)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17596#(or (< (+ 32 main_~i~0) main_~n~0) (= (+ main_~i~0 34) (* (div (+ main_~i~0 34) 2) 2)))} is VALID [2022-04-15 13:11:17,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {17604#(or (= (* (div (+ 42 main_~i~0) 2) 2) (+ 42 main_~i~0)) (< (+ 40 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17600#(or (< (+ main_~i~0 36) main_~n~0) (= (* (div (+ main_~i~0 38) 2) 2) (+ main_~i~0 38)))} is VALID [2022-04-15 13:11:18,032 INFO L290 TraceCheckUtils]: 32: Hoare triple {17608#(or (< (+ 44 main_~i~0) main_~n~0) (= (* (div (+ main_~i~0 46) 2) 2) (+ main_~i~0 46)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17604#(or (= (* (div (+ 42 main_~i~0) 2) 2) (+ 42 main_~i~0)) (< (+ 40 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:11:18,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {17612#(or (= (+ main_~i~0 50) (* 2 (div (+ main_~i~0 50) 2))) (< (+ main_~i~0 48) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17608#(or (< (+ 44 main_~i~0) main_~n~0) (= (* (div (+ main_~i~0 46) 2) 2) (+ main_~i~0 46)))} is VALID [2022-04-15 13:11:18,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {17616#(or (= (* 2 (div (+ main_~i~0 54) 2)) (+ main_~i~0 54)) (< (+ main_~i~0 52) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17612#(or (= (+ main_~i~0 50) (* 2 (div (+ main_~i~0 50) 2))) (< (+ main_~i~0 48) main_~n~0))} is VALID [2022-04-15 13:11:18,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {17620#(or (= (+ main_~i~0 58) (* 2 (div (+ main_~i~0 58) 2))) (< (+ 56 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17616#(or (= (* 2 (div (+ main_~i~0 54) 2)) (+ main_~i~0 54)) (< (+ main_~i~0 52) main_~n~0))} is VALID [2022-04-15 13:11:18,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {17624#(or (= (+ main_~i~0 62) (* 2 (div (+ main_~i~0 62) 2))) (< (+ main_~i~0 60) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17620#(or (= (+ main_~i~0 58) (* 2 (div (+ main_~i~0 58) 2))) (< (+ 56 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:11:18,175 INFO L290 TraceCheckUtils]: 27: Hoare triple {17628#(or (< (+ 64 main_~i~0) main_~n~0) (= (+ 66 main_~i~0) (* (div (+ 66 main_~i~0) 2) 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17624#(or (= (+ main_~i~0 62) (* 2 (div (+ main_~i~0 62) 2))) (< (+ main_~i~0 60) main_~n~0))} is VALID [2022-04-15 13:11:18,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {17632#(or (= (+ main_~i~0 70) (* 2 (div (+ main_~i~0 70) 2))) (< (+ 68 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17628#(or (< (+ 64 main_~i~0) main_~n~0) (= (+ 66 main_~i~0) (* (div (+ 66 main_~i~0) 2) 2)))} is VALID [2022-04-15 13:11:18,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {17636#(or (= (+ main_~i~0 74) (* 2 (div (+ main_~i~0 74) 2))) (< (+ 72 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17632#(or (= (+ main_~i~0 70) (* 2 (div (+ main_~i~0 70) 2))) (< (+ 68 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:11:18,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {17640#(or (< (+ 76 main_~i~0) main_~n~0) (= (+ main_~i~0 78) (* 2 (div (+ main_~i~0 78) 2))))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17636#(or (= (+ main_~i~0 74) (* 2 (div (+ main_~i~0 74) 2))) (< (+ 72 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:11:18,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {17644#(or (< (+ main_~i~0 80) main_~n~0) (= (* (div (+ main_~i~0 82) 2) 2) (+ main_~i~0 82)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17640#(or (< (+ 76 main_~i~0) main_~n~0) (= (+ main_~i~0 78) (* 2 (div (+ main_~i~0 78) 2))))} is VALID [2022-04-15 13:11:18,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {17648#(or (< (+ 84 main_~i~0) main_~n~0) (= (+ main_~i~0 86) (* (div (+ main_~i~0 86) 2) 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17644#(or (< (+ main_~i~0 80) main_~n~0) (= (* (div (+ main_~i~0 82) 2) 2) (+ main_~i~0 82)))} is VALID [2022-04-15 13:11:18,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {17652#(or (= (* (div (+ main_~i~0 90) 2) 2) (+ main_~i~0 90)) (< (+ 88 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17648#(or (< (+ 84 main_~i~0) main_~n~0) (= (+ main_~i~0 86) (* (div (+ main_~i~0 86) 2) 2)))} is VALID [2022-04-15 13:11:18,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {17656#(or (= (* 2 (div (+ 94 main_~i~0) 2)) (+ 94 main_~i~0)) (< (+ 92 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17652#(or (= (* (div (+ main_~i~0 90) 2) 2) (+ main_~i~0 90)) (< (+ 88 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:11:18,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {17660#(or (< (+ main_~i~0 96) main_~n~0) (= (* (div (+ 98 main_~i~0) 2) 2) (+ 98 main_~i~0)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17656#(or (= (* 2 (div (+ 94 main_~i~0) 2)) (+ 94 main_~i~0)) (< (+ 92 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:11:18,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {17664#(or (= (* 2 (div (+ main_~i~0 102) 2)) (+ main_~i~0 102)) (< (+ main_~i~0 100) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17660#(or (< (+ main_~i~0 96) main_~n~0) (= (* (div (+ 98 main_~i~0) 2) 2) (+ 98 main_~i~0)))} is VALID [2022-04-15 13:11:18,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {17668#(or (= (* 2 (div (+ 106 main_~i~0) 2)) (+ 106 main_~i~0)) (< (+ 104 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17664#(or (= (* 2 (div (+ main_~i~0 102) 2)) (+ main_~i~0 102)) (< (+ main_~i~0 100) main_~n~0))} is VALID [2022-04-15 13:11:18,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {17672#(or (= (* 2 (div (+ 110 main_~i~0) 2)) (+ 110 main_~i~0)) (< (+ 108 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17668#(or (= (* 2 (div (+ 106 main_~i~0) 2)) (+ 106 main_~i~0)) (< (+ 104 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:11:18,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {17676#(or (= (* 2 (div (+ main_~i~0 114) 2)) (+ main_~i~0 114)) (< (+ 112 main_~i~0) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17672#(or (= (* 2 (div (+ 110 main_~i~0) 2)) (+ 110 main_~i~0)) (< (+ 108 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:11:18,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {17680#(or (< (+ 116 main_~i~0) main_~n~0) (= (+ main_~i~0 118) (* (div (+ main_~i~0 118) 2) 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17676#(or (= (* 2 (div (+ main_~i~0 114) 2)) (+ main_~i~0 114)) (< (+ 112 main_~i~0) main_~n~0))} is VALID [2022-04-15 13:11:18,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {17684#(or (= (* (div (+ main_~i~0 122) 2) 2) (+ main_~i~0 122)) (< (+ main_~i~0 120) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17680#(or (< (+ 116 main_~i~0) main_~n~0) (= (+ main_~i~0 118) (* (div (+ main_~i~0 118) 2) 2)))} is VALID [2022-04-15 13:11:18,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {17688#(or (< (+ main_~i~0 124) main_~n~0) (= (* 2 (div (+ main_~i~0 126) 2)) (+ main_~i~0 126)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17684#(or (= (* (div (+ main_~i~0 122) 2) 2) (+ main_~i~0 122)) (< (+ main_~i~0 120) main_~n~0))} is VALID [2022-04-15 13:11:18,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {17692#(or (= (* (div (+ main_~i~0 130) 2) 2) (+ main_~i~0 130)) (< (+ main_~i~0 128) main_~n~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17688#(or (< (+ main_~i~0 124) main_~n~0) (= (* 2 (div (+ main_~i~0 126) 2)) (+ main_~i~0 126)))} is VALID [2022-04-15 13:11:18,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {17696#(or (< (+ main_~i~0 132) main_~n~0) (= (+ main_~i~0 134) (* (div (+ main_~i~0 134) 2) 2)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17692#(or (= (* (div (+ main_~i~0 130) 2) 2) (+ main_~i~0 130)) (< (+ main_~i~0 128) main_~n~0))} is VALID [2022-04-15 13:11:18,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {17700#(or (< (+ main_~i~0 136) main_~n~0) (= (* 2 (div (+ 138 main_~i~0) 2)) (+ 138 main_~i~0)))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17696#(or (< (+ main_~i~0 132) main_~n~0) (= (+ main_~i~0 134) (* (div (+ main_~i~0 134) 2) 2)))} is VALID [2022-04-15 13:11:18,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {17704#(= (+ 142 main_~i~0) (* (div (+ 142 main_~i~0) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17700#(or (< (+ main_~i~0 136) main_~n~0) (= (* 2 (div (+ 138 main_~i~0) 2)) (+ 138 main_~i~0)))} is VALID [2022-04-15 13:11:18,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {17704#(= (+ 142 main_~i~0) (* (div (+ 142 main_~i~0) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {17704#(= (+ 142 main_~i~0) (* (div (+ 142 main_~i~0) 2) 2))} is VALID [2022-04-15 13:11:18,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {17317#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {17704#(= (+ 142 main_~i~0) (* (div (+ 142 main_~i~0) 2) 2))} is VALID [2022-04-15 13:11:18,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {17317#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {17317#true} is VALID [2022-04-15 13:11:18,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {17317#true} call #t~ret5 := main(); {17317#true} is VALID [2022-04-15 13:11:18,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17317#true} {17317#true} #62#return; {17317#true} is VALID [2022-04-15 13:11:18,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {17317#true} assume true; {17317#true} is VALID [2022-04-15 13:11:18,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {17317#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {17317#true} is VALID [2022-04-15 13:11:18,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {17317#true} call ULTIMATE.init(); {17317#true} is VALID [2022-04-15 13:11:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 13:11:18,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237918019] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:11:18,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:11:18,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 39] total 112 [2022-04-15 13:11:18,810 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:11:18,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2006471877] [2022-04-15 13:11:18,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2006471877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:18,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:18,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 13:11:18,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182173758] [2022-04-15 13:11:18,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:11:18,811 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.15) internal successors, (46), 39 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have 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-15 13:11:18,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:11:18,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.15) internal successors, (46), 39 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:19,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:11:19,040 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 13:11:19,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:11:19,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 13:11:19,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3341, Invalid=9091, Unknown=0, NotChecked=0, Total=12432 [2022-04-15 13:11:19,041 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 40 states, 40 states have (on average 1.15) internal successors, (46), 39 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:08,597 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-15 13:13:08,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 13:13:08,597 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.15) internal successors, (46), 39 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have 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-15 13:13:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:13:08,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.15) internal successors, (46), 39 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:08,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2022-04-15 13:13:08,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.15) internal successors, (46), 39 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2022-04-15 13:13:08,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 59 transitions. [2022-04-15 13:13:09,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:09,186 INFO L225 Difference]: With dead ends: 59 [2022-04-15 13:13:09,186 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 13:13:09,187 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5183 ImplicationChecksByTransitivity, 162.0s TimeCoverageRelationStatistics Valid=4858, Invalid=17194, Unknown=0, NotChecked=0, Total=22052 [2022-04-15 13:13:09,187 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:13:09,187 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 200 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 40.1s Time] [2022-04-15 13:13:09,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 13:13:09,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-15 13:13:09,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:13:09,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:09,237 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:09,237 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:09,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:09,238 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 13:13:09,238 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-15 13:13:09,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:09,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:09,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-15 13:13:09,238 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-15 13:13:09,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:09,239 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 13:13:09,239 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-15 13:13:09,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:09,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:09,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:13:09,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:13:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-04-15 13:13:09,240 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2022-04-15 13:13:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:13:09,240 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-04-15 13:13:09,240 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.15) internal successors, (46), 39 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:09,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 52 transitions. [2022-04-15 13:13:09,942 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-15 13:13:09,942 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-15 13:13:09,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 13:13:09,943 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:13:09,943 INFO L499 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:13:09,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-15 13:13:10,143 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:13:10,144 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:13:10,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:13:10,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1600274046, now seen corresponding path program 73 times [2022-04-15 13:13:10,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:10,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1452391259] [2022-04-15 13:13:11,455 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:13:11,456 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:13:11,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1600274046, now seen corresponding path program 74 times [2022-04-15 13:13:11,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:13:11,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898034876] [2022-04-15 13:13:11,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:13:11,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:13:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:12,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:13:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:12,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {18174#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {18131#true} is VALID [2022-04-15 13:13:12,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {18131#true} assume true; {18131#true} is VALID [2022-04-15 13:13:12,776 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18131#true} {18131#true} #62#return; {18131#true} is VALID [2022-04-15 13:13:12,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {18131#true} call ULTIMATE.init(); {18174#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:13:12,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {18174#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {18131#true} is VALID [2022-04-15 13:13:12,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {18131#true} assume true; {18131#true} is VALID [2022-04-15 13:13:12,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18131#true} {18131#true} #62#return; {18131#true} is VALID [2022-04-15 13:13:12,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {18131#true} call #t~ret5 := main(); {18131#true} is VALID [2022-04-15 13:13:12,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {18131#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {18131#true} is VALID [2022-04-15 13:13:12,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {18131#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {18136#(= main_~i~0 0)} is VALID [2022-04-15 13:13:12,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {18136#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18137#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:13:12,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {18137#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18138#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:13:12,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {18138#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18139#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:13:12,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {18139#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18140#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:13:12,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {18140#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18141#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:13:12,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {18141#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18142#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:13:12,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {18142#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18143#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:13:12,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {18143#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18144#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:13:13,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {18144#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18145#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:13:13,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {18145#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18146#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:13:13,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {18146#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18147#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:13:13,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {18147#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18148#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:13:13,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {18148#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18149#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:13:13,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {18149#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18150#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:13:13,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {18150#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18151#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:13:13,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {18151#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18152#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:13:13,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {18152#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18153#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:13:13,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {18153#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18154#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:13:13,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {18154#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18155#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:13:13,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {18155#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18156#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:13:13,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {18156#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18157#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:13:13,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {18157#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18158#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:13:13,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {18158#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18159#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:13:13,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {18159#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18160#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:13:13,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {18160#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18161#(and (<= 100 main_~i~0) (<= main_~i~0 100))} is VALID [2022-04-15 13:13:13,414 INFO L290 TraceCheckUtils]: 32: Hoare triple {18161#(and (<= 100 main_~i~0) (<= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18162#(and (<= main_~i~0 104) (<= 104 main_~i~0))} is VALID [2022-04-15 13:13:13,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {18162#(and (<= main_~i~0 104) (<= 104 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18163#(and (<= 108 main_~i~0) (<= main_~i~0 108))} is VALID [2022-04-15 13:13:13,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {18163#(and (<= 108 main_~i~0) (<= main_~i~0 108))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18164#(and (<= 112 main_~i~0) (<= main_~i~0 112))} is VALID [2022-04-15 13:13:13,508 INFO L290 TraceCheckUtils]: 35: Hoare triple {18164#(and (<= 112 main_~i~0) (<= main_~i~0 112))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18165#(and (<= main_~i~0 116) (<= 116 main_~i~0))} is VALID [2022-04-15 13:13:13,541 INFO L290 TraceCheckUtils]: 36: Hoare triple {18165#(and (<= main_~i~0 116) (<= 116 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18166#(and (<= main_~i~0 120) (<= 120 main_~i~0))} is VALID [2022-04-15 13:13:13,566 INFO L290 TraceCheckUtils]: 37: Hoare triple {18166#(and (<= main_~i~0 120) (<= 120 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18167#(and (<= main_~i~0 124) (<= 124 main_~i~0))} is VALID [2022-04-15 13:13:13,596 INFO L290 TraceCheckUtils]: 38: Hoare triple {18167#(and (<= main_~i~0 124) (<= 124 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18168#(and (<= 128 main_~i~0) (<= main_~i~0 128))} is VALID [2022-04-15 13:13:13,621 INFO L290 TraceCheckUtils]: 39: Hoare triple {18168#(and (<= 128 main_~i~0) (<= main_~i~0 128))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18169#(and (<= main_~i~0 132) (<= 132 main_~i~0))} is VALID [2022-04-15 13:13:13,647 INFO L290 TraceCheckUtils]: 40: Hoare triple {18169#(and (<= main_~i~0 132) (<= 132 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18170#(and (<= 136 main_~i~0) (<= main_~i~0 136))} is VALID [2022-04-15 13:13:13,678 INFO L290 TraceCheckUtils]: 41: Hoare triple {18170#(and (<= 136 main_~i~0) (<= main_~i~0 136))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18171#(and (<= 140 main_~i~0) (<= main_~i~0 140))} is VALID [2022-04-15 13:13:13,710 INFO L290 TraceCheckUtils]: 42: Hoare triple {18171#(and (<= 140 main_~i~0) (<= main_~i~0 140))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18172#(and (<= main_~i~0 144) (<= 144 main_~i~0))} is VALID [2022-04-15 13:13:13,735 INFO L290 TraceCheckUtils]: 43: Hoare triple {18172#(and (<= main_~i~0 144) (<= 144 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18173#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:13:13,736 INFO L290 TraceCheckUtils]: 44: Hoare triple {18173#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {18173#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:13:13,736 INFO L290 TraceCheckUtils]: 45: Hoare triple {18173#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {18173#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:13:13,745 INFO L290 TraceCheckUtils]: 46: Hoare triple {18173#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {18132#false} is VALID [2022-04-15 13:13:13,746 INFO L272 TraceCheckUtils]: 47: Hoare triple {18132#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {18132#false} is VALID [2022-04-15 13:13:13,746 INFO L290 TraceCheckUtils]: 48: Hoare triple {18132#false} ~cond := #in~cond; {18132#false} is VALID [2022-04-15 13:13:13,746 INFO L290 TraceCheckUtils]: 49: Hoare triple {18132#false} assume 0 == ~cond; {18132#false} is VALID [2022-04-15 13:13:13,746 INFO L290 TraceCheckUtils]: 50: Hoare triple {18132#false} assume !false; {18132#false} is VALID [2022-04-15 13:13:13,746 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:13:13,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:13:13,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898034876] [2022-04-15 13:13:13,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898034876] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:13:13,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155096001] [2022-04-15 13:13:13,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:13:13,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:13:13,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:13:13,748 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:13:13,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-15 13:13:13,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:13:13,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:13:13,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 79 conjunts are in the unsatisfiable core [2022-04-15 13:13:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:13,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:13:14,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {18131#true} call ULTIMATE.init(); {18131#true} is VALID [2022-04-15 13:13:14,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {18131#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {18131#true} is VALID [2022-04-15 13:13:14,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {18131#true} assume true; {18131#true} is VALID [2022-04-15 13:13:14,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18131#true} {18131#true} #62#return; {18131#true} is VALID [2022-04-15 13:13:14,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {18131#true} call #t~ret5 := main(); {18131#true} is VALID [2022-04-15 13:13:14,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {18131#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {18131#true} is VALID [2022-04-15 13:13:14,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {18131#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {18136#(= main_~i~0 0)} is VALID [2022-04-15 13:13:14,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {18136#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18137#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 13:13:14,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {18137#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18138#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 13:13:14,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {18138#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18139#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 13:13:14,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {18139#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18140#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 13:13:14,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {18140#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18141#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 13:13:14,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {18141#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18142#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-15 13:13:14,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {18142#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18143#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-15 13:13:14,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {18143#(and (<= main_~i~0 28) (<= 28 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18144#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-15 13:13:14,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {18144#(and (<= main_~i~0 32) (<= 32 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18145#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-15 13:13:14,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {18145#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18146#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-15 13:13:14,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {18146#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18147#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-15 13:13:14,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {18147#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18148#(and (<= 48 main_~i~0) (<= main_~i~0 48))} is VALID [2022-04-15 13:13:14,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {18148#(and (<= 48 main_~i~0) (<= main_~i~0 48))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18149#(and (<= 52 main_~i~0) (<= main_~i~0 52))} is VALID [2022-04-15 13:13:14,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {18149#(and (<= 52 main_~i~0) (<= main_~i~0 52))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18150#(and (<= main_~i~0 56) (<= 56 main_~i~0))} is VALID [2022-04-15 13:13:14,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {18150#(and (<= main_~i~0 56) (<= 56 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18151#(and (<= main_~i~0 60) (<= 60 main_~i~0))} is VALID [2022-04-15 13:13:14,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {18151#(and (<= main_~i~0 60) (<= 60 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18152#(and (<= main_~i~0 64) (<= 64 main_~i~0))} is VALID [2022-04-15 13:13:14,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {18152#(and (<= main_~i~0 64) (<= 64 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18153#(and (<= 68 main_~i~0) (<= main_~i~0 68))} is VALID [2022-04-15 13:13:14,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {18153#(and (<= 68 main_~i~0) (<= main_~i~0 68))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18154#(and (<= main_~i~0 72) (<= 72 main_~i~0))} is VALID [2022-04-15 13:13:14,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {18154#(and (<= main_~i~0 72) (<= 72 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18155#(and (<= main_~i~0 76) (<= 76 main_~i~0))} is VALID [2022-04-15 13:13:14,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {18155#(and (<= main_~i~0 76) (<= 76 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18156#(and (<= 80 main_~i~0) (<= main_~i~0 80))} is VALID [2022-04-15 13:13:14,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {18156#(and (<= 80 main_~i~0) (<= main_~i~0 80))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18157#(and (<= main_~i~0 84) (<= 84 main_~i~0))} is VALID [2022-04-15 13:13:14,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {18157#(and (<= main_~i~0 84) (<= 84 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18158#(and (<= 88 main_~i~0) (<= main_~i~0 88))} is VALID [2022-04-15 13:13:14,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {18158#(and (<= 88 main_~i~0) (<= main_~i~0 88))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18159#(and (<= main_~i~0 92) (<= 92 main_~i~0))} is VALID [2022-04-15 13:13:14,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {18159#(and (<= main_~i~0 92) (<= 92 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18160#(and (<= main_~i~0 96) (<= 96 main_~i~0))} is VALID [2022-04-15 13:13:14,966 INFO L290 TraceCheckUtils]: 31: Hoare triple {18160#(and (<= main_~i~0 96) (<= 96 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18161#(and (<= 100 main_~i~0) (<= main_~i~0 100))} is VALID [2022-04-15 13:13:14,992 INFO L290 TraceCheckUtils]: 32: Hoare triple {18161#(and (<= 100 main_~i~0) (<= main_~i~0 100))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18162#(and (<= main_~i~0 104) (<= 104 main_~i~0))} is VALID [2022-04-15 13:13:15,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {18162#(and (<= main_~i~0 104) (<= 104 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18163#(and (<= 108 main_~i~0) (<= main_~i~0 108))} is VALID [2022-04-15 13:13:15,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {18163#(and (<= 108 main_~i~0) (<= main_~i~0 108))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18164#(and (<= 112 main_~i~0) (<= main_~i~0 112))} is VALID [2022-04-15 13:13:15,090 INFO L290 TraceCheckUtils]: 35: Hoare triple {18164#(and (<= 112 main_~i~0) (<= main_~i~0 112))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18165#(and (<= main_~i~0 116) (<= 116 main_~i~0))} is VALID [2022-04-15 13:13:15,122 INFO L290 TraceCheckUtils]: 36: Hoare triple {18165#(and (<= main_~i~0 116) (<= 116 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18166#(and (<= main_~i~0 120) (<= 120 main_~i~0))} is VALID [2022-04-15 13:13:15,150 INFO L290 TraceCheckUtils]: 37: Hoare triple {18166#(and (<= main_~i~0 120) (<= 120 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18167#(and (<= main_~i~0 124) (<= 124 main_~i~0))} is VALID [2022-04-15 13:13:15,182 INFO L290 TraceCheckUtils]: 38: Hoare triple {18167#(and (<= main_~i~0 124) (<= 124 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18168#(and (<= 128 main_~i~0) (<= main_~i~0 128))} is VALID [2022-04-15 13:13:15,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {18168#(and (<= 128 main_~i~0) (<= main_~i~0 128))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18169#(and (<= main_~i~0 132) (<= 132 main_~i~0))} is VALID [2022-04-15 13:13:15,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {18169#(and (<= main_~i~0 132) (<= 132 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18170#(and (<= 136 main_~i~0) (<= main_~i~0 136))} is VALID [2022-04-15 13:13:15,269 INFO L290 TraceCheckUtils]: 41: Hoare triple {18170#(and (<= 136 main_~i~0) (<= main_~i~0 136))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18171#(and (<= 140 main_~i~0) (<= main_~i~0 140))} is VALID [2022-04-15 13:13:15,301 INFO L290 TraceCheckUtils]: 42: Hoare triple {18171#(and (<= 140 main_~i~0) (<= main_~i~0 140))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18172#(and (<= main_~i~0 144) (<= 144 main_~i~0))} is VALID [2022-04-15 13:13:15,328 INFO L290 TraceCheckUtils]: 43: Hoare triple {18172#(and (<= main_~i~0 144) (<= 144 main_~i~0))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18307#(and (<= 150 main_~j~0) (<= main_~j~0 150))} is VALID [2022-04-15 13:13:15,328 INFO L290 TraceCheckUtils]: 44: Hoare triple {18307#(and (<= 150 main_~j~0) (<= main_~j~0 150))} assume !(~i~0 < ~n~0); {18307#(and (<= 150 main_~j~0) (<= main_~j~0 150))} is VALID [2022-04-15 13:13:15,329 INFO L290 TraceCheckUtils]: 45: Hoare triple {18307#(and (<= 150 main_~j~0) (<= main_~j~0 150))} ~k~0 := ~i~0; {18307#(and (<= 150 main_~j~0) (<= main_~j~0 150))} is VALID [2022-04-15 13:13:15,331 INFO L290 TraceCheckUtils]: 46: Hoare triple {18307#(and (<= 150 main_~j~0) (<= main_~j~0 150))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {18132#false} is VALID [2022-04-15 13:13:15,331 INFO L272 TraceCheckUtils]: 47: Hoare triple {18132#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {18132#false} is VALID [2022-04-15 13:13:15,331 INFO L290 TraceCheckUtils]: 48: Hoare triple {18132#false} ~cond := #in~cond; {18132#false} is VALID [2022-04-15 13:13:15,331 INFO L290 TraceCheckUtils]: 49: Hoare triple {18132#false} assume 0 == ~cond; {18132#false} is VALID [2022-04-15 13:13:15,331 INFO L290 TraceCheckUtils]: 50: Hoare triple {18132#false} assume !false; {18132#false} is VALID [2022-04-15 13:13:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:13:15,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:13:47,381 INFO L290 TraceCheckUtils]: 50: Hoare triple {18132#false} assume !false; {18132#false} is VALID [2022-04-15 13:13:47,381 INFO L290 TraceCheckUtils]: 49: Hoare triple {18132#false} assume 0 == ~cond; {18132#false} is VALID [2022-04-15 13:13:47,381 INFO L290 TraceCheckUtils]: 48: Hoare triple {18132#false} ~cond := #in~cond; {18132#false} is VALID [2022-04-15 13:13:47,381 INFO L272 TraceCheckUtils]: 47: Hoare triple {18132#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {18132#false} is VALID [2022-04-15 13:13:47,402 INFO L290 TraceCheckUtils]: 46: Hoare triple {18173#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {18132#false} is VALID [2022-04-15 13:13:47,403 INFO L290 TraceCheckUtils]: 45: Hoare triple {18173#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {18173#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:13:47,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {18173#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {18173#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:13:47,438 INFO L290 TraceCheckUtils]: 43: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18173#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-15 13:13:47,478 INFO L290 TraceCheckUtils]: 42: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:47,518 INFO L290 TraceCheckUtils]: 41: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:47,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:47,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:47,636 INFO L290 TraceCheckUtils]: 38: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:47,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:47,716 INFO L290 TraceCheckUtils]: 36: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:47,757 INFO L290 TraceCheckUtils]: 35: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:47,796 INFO L290 TraceCheckUtils]: 34: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:47,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:47,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:47,914 INFO L290 TraceCheckUtils]: 31: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:47,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:47,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {18131#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {18350#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-15 13:13:48,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {18131#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {18131#true} is VALID [2022-04-15 13:13:48,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {18131#true} call #t~ret5 := main(); {18131#true} is VALID [2022-04-15 13:13:48,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18131#true} {18131#true} #62#return; {18131#true} is VALID [2022-04-15 13:13:48,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {18131#true} assume true; {18131#true} is VALID [2022-04-15 13:13:48,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {18131#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {18131#true} is VALID [2022-04-15 13:13:48,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {18131#true} call ULTIMATE.init(); {18131#true} is VALID [2022-04-15 13:13:48,891 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2022-04-15 13:13:48,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155096001] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:13:48,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:13:48,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 4] total 43 [2022-04-15 13:13:48,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:13:48,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1452391259] [2022-04-15 13:13:48,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1452391259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:48,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:48,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 13:13:48,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925663771] [2022-04-15 13:13:48,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:13:48,892 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.146341463414634) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-15 13:13:48,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:13:48,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.146341463414634) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:49,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:49,145 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 13:13:49,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:49,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 13:13:49,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1685, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 13:13:49,145 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 41 states, 41 states have (on average 1.146341463414634) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)