/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/loop-crafted/simple_array_index_value_3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:27:00,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:27:00,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:27:00,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:27:00,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:27:00,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:27:00,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:27:00,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:27:00,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:27:00,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:27:00,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:27:00,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:27:00,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:27:00,193 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:27:00,194 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:27:00,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:27:00,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:27:00,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:27:00,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:27:00,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:27:00,207 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:27:00,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:27:00,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:27:00,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:27:00,211 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:27:00,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:27:00,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:27:00,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:27:00,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:27:00,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:27:00,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:27:00,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:27:00,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:27:00,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:27:00,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:27:00,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:27:00,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:27:00,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:27:00,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:27:00,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:27:00,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:27:00,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:27:00,223 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:27:00,231 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:27:00,232 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:27:00,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:27:00,233 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:27:00,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:27:00,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:27:00,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:27:00,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:27:00,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:27:00,234 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:27:00,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:27:00,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:27:00,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:27:00,235 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:27:00,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:27:00,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:27:00,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:27:00,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:27:00,235 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:27:00,235 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:27:00,235 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:27:00,236 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:27:00,236 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:27:00,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:27:00,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:27:00,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:27:00,499 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:27:00,499 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:27:00,500 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_3.i [2022-04-15 12:27:00,560 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d65a2390/b46977b1d7c14ee782d859a406407a50/FLAGf29442918 [2022-04-15 12:27:00,948 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:27:00,948 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_3.i [2022-04-15 12:27:00,953 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d65a2390/b46977b1d7c14ee782d859a406407a50/FLAGf29442918 [2022-04-15 12:27:01,358 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d65a2390/b46977b1d7c14ee782d859a406407a50 [2022-04-15 12:27:01,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:27:01,361 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:27:01,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:27:01,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:27:01,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:27:01,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:27:01" (1/1) ... [2022-04-15 12:27:01,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef20969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:27:01, skipping insertion in model container [2022-04-15 12:27:01,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:27:01" (1/1) ... [2022-04-15 12:27:01,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:27:01,392 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:27:01,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_3.i[920,933] [2022-04-15 12:27:01,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:27:01,554 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:27:01,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_3.i[920,933] [2022-04-15 12:27:01,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:27:01,581 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:27:01,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:27:01 WrapperNode [2022-04-15 12:27:01,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:27:01,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:27:01,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:27:01,583 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:27:01,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:27:01" (1/1) ... [2022-04-15 12:27:01,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:27:01" (1/1) ... [2022-04-15 12:27:01,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:27:01" (1/1) ... [2022-04-15 12:27:01,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:27:01" (1/1) ... [2022-04-15 12:27:01,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:27:01" (1/1) ... [2022-04-15 12:27:01,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:27:01" (1/1) ... [2022-04-15 12:27:01,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:27:01" (1/1) ... [2022-04-15 12:27:01,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:27:01,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:27:01,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:27:01,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:27:01,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:27:01" (1/1) ... [2022-04-15 12:27:01,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:27:01,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:27:01,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:27:01,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:27:01,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:27:01,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:27:01,725 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:27:01,725 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:27:01,726 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:27:01,726 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:27:01,726 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:27:01,726 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:27:01,726 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:27:01,726 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:27:01,726 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:27:01,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:27:01,727 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:27:01,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:27:01,728 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:27:01,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 12:27:01,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:27:01,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:27:01,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:27:01,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:27:01,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:27:01,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:27:01,801 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:27:01,802 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:27:01,937 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:27:01,943 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:27:01,944 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 12:27:01,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:27:01 BoogieIcfgContainer [2022-04-15 12:27:01,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:27:01,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:27:01,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:27:01,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:27:01,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:27:01" (1/3) ... [2022-04-15 12:27:01,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c16956e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:27:01, skipping insertion in model container [2022-04-15 12:27:01,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:27:01" (2/3) ... [2022-04-15 12:27:01,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c16956e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:27:01, skipping insertion in model container [2022-04-15 12:27:01,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:27:01" (3/3) ... [2022-04-15 12:27:01,952 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_3.i [2022-04-15 12:27:01,957 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:27:01,957 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:27:02,018 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:27:02,024 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:27:02,024 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:27:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:27:02,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:27:02,062 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:27:02,062 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:27:02,063 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:27:02,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:27:02,072 INFO L85 PathProgramCache]: Analyzing trace with hash -851892248, now seen corresponding path program 1 times [2022-04-15 12:27:02,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:02,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [923777428] [2022-04-15 12:27:02,092 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:27:02,092 INFO L85 PathProgramCache]: Analyzing trace with hash -851892248, now seen corresponding path program 2 times [2022-04-15 12:27:02,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:27:02,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076101801] [2022-04-15 12:27:02,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:27:02,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:27:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:02,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:27:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:02,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(29, 2); {27#true} is VALID [2022-04-15 12:27:02,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 12:27:02,355 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #71#return; {27#true} is VALID [2022-04-15 12:27:02,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:27:02,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(29, 2); {27#true} is VALID [2022-04-15 12:27:02,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 12:27:02,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #71#return; {27#true} is VALID [2022-04-15 12:27:02,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2022-04-15 12:27:02,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {27#true} is VALID [2022-04-15 12:27:02,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !(~index~0 % 4294967296 < 10000); {27#true} is VALID [2022-04-15 12:27:02,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} ~index~0 := 0; {27#true} is VALID [2022-04-15 12:27:02,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {27#true} is VALID [2022-04-15 12:27:02,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume #t~short4; {32#|main_#t~short4|} is VALID [2022-04-15 12:27:02,361 INFO L272 TraceCheckUtils]: 10: Hoare triple {32#|main_#t~short4|} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {33#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:27:02,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {34#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:27:02,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28#false} is VALID [2022-04-15 12:27:02,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-15 12:27:02,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:27:02,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:27:02,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076101801] [2022-04-15 12:27:02,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076101801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:27:02,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:27:02,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:27:02,367 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:27:02,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [923777428] [2022-04-15 12:27:02,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [923777428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:27:02,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:27:02,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:27:02,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338957327] [2022-04-15 12:27:02,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:27:02,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:27:02,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:27:02,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:02,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:02,400 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:27:02,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:02,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:27:02,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:27:02,429 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:02,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:02,739 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-15 12:27:02,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:27:02,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:27:02,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:27:02,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:02,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-15 12:27:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-15 12:27:02,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-04-15 12:27:02,811 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 12:27:02,820 INFO L225 Difference]: With dead ends: 47 [2022-04-15 12:27:02,820 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 12:27:02,823 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:27:02,827 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 27 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:27:02,829 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 44 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:27:02,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 12:27:02,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-15 12:27:02,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:27:02,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:27:02,870 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:27:02,871 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:27:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:02,876 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 12:27:02,876 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 12:27:02,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:02,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:02,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 12:27:02,878 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 12:27:02,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:02,881 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 12:27:02,882 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 12:27:02,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:02,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:02,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:27:02,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:27:02,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:27:02,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-15 12:27:02,893 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2022-04-15 12:27:02,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:27:02,895 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-15 12:27:02,898 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:02,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-15 12:27:02,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:02,929 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 12:27:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:27:02,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:27:02,930 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:27:02,930 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:27:02,930 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:27:02,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:27:02,933 INFO L85 PathProgramCache]: Analyzing trace with hash -850045206, now seen corresponding path program 1 times [2022-04-15 12:27:02,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:02,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1773414531] [2022-04-15 12:27:02,936 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:27:02,936 INFO L85 PathProgramCache]: Analyzing trace with hash -850045206, now seen corresponding path program 2 times [2022-04-15 12:27:02,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:27:02,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87286096] [2022-04-15 12:27:02,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:27:02,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:27:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:03,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:27:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:03,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(29, 2); {238#true} is VALID [2022-04-15 12:27:03,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {238#true} assume true; {238#true} is VALID [2022-04-15 12:27:03,070 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {238#true} {238#true} #71#return; {238#true} is VALID [2022-04-15 12:27:03,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {238#true} call ULTIMATE.init(); {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:27:03,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(29, 2); {238#true} is VALID [2022-04-15 12:27:03,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {238#true} assume true; {238#true} is VALID [2022-04-15 12:27:03,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {238#true} {238#true} #71#return; {238#true} is VALID [2022-04-15 12:27:03,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {238#true} call #t~ret5 := main(); {238#true} is VALID [2022-04-15 12:27:03,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {238#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {243#(= main_~index~0 0)} is VALID [2022-04-15 12:27:03,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {243#(= main_~index~0 0)} assume !(~index~0 % 4294967296 < 10000); {239#false} is VALID [2022-04-15 12:27:03,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#false} ~index~0 := 0; {239#false} is VALID [2022-04-15 12:27:03,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {239#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {239#false} is VALID [2022-04-15 12:27:03,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {239#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {239#false} is VALID [2022-04-15 12:27:03,073 INFO L272 TraceCheckUtils]: 10: Hoare triple {239#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {239#false} is VALID [2022-04-15 12:27:03,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {239#false} ~cond := #in~cond; {239#false} is VALID [2022-04-15 12:27:03,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {239#false} assume 0 == ~cond; {239#false} is VALID [2022-04-15 12:27:03,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {239#false} assume !false; {239#false} is VALID [2022-04-15 12:27:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:27:03,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:27:03,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87286096] [2022-04-15 12:27:03,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87286096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:27:03,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:27:03,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:27:03,075 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:27:03,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1773414531] [2022-04-15 12:27:03,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1773414531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:27:03,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:27:03,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:27:03,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660035013] [2022-04-15 12:27:03,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:27:03,077 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 12:27:03,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:27:03,077 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 12:27:03,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:03,090 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:27:03,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:03,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:27:03,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:27:03,094 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. 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 12:27:03,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:03,190 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-15 12:27:03,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:27:03,190 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 12:27:03,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:27:03,191 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 12:27:03,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-04-15 12:27:03,196 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 12:27:03,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-04-15 12:27:03,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2022-04-15 12:27:03,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:03,240 INFO L225 Difference]: With dead ends: 48 [2022-04-15 12:27:03,240 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 12:27:03,240 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 12:27:03,243 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:27:03,244 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 23 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:27:03,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 12:27:03,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-04-15 12:27:03,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:27:03,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:27:03,256 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:27:03,256 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:27:03,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:03,267 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-15 12:27:03,267 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-15 12:27:03,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:03,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:03,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-15 12:27:03,272 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-15 12:27:03,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:03,276 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-15 12:27:03,276 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-15 12:27:03,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:03,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:03,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:27:03,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:27:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:27:03,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-15 12:27:03,285 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2022-04-15 12:27:03,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:27:03,285 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-15 12:27:03,286 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 12:27:03,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-15 12:27:03,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:03,315 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 12:27:03,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:27:03,316 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:27:03,316 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:27:03,317 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:27:03,317 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:27:03,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:27:03,318 INFO L85 PathProgramCache]: Analyzing trace with hash -446317518, now seen corresponding path program 1 times [2022-04-15 12:27:03,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:03,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [216425533] [2022-04-15 12:27:03,333 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:27:03,333 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:27:03,333 INFO L85 PathProgramCache]: Analyzing trace with hash -446317518, now seen corresponding path program 2 times [2022-04-15 12:27:03,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:27:03,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39824305] [2022-04-15 12:27:03,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:27:03,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:27:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:03,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:27:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:03,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(29, 2); {457#true} is VALID [2022-04-15 12:27:03,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-15 12:27:03,483 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {457#true} {457#true} #71#return; {457#true} is VALID [2022-04-15 12:27:03,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:27:03,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(29, 2); {457#true} is VALID [2022-04-15 12:27:03,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-15 12:27:03,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #71#return; {457#true} is VALID [2022-04-15 12:27:03,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID [2022-04-15 12:27:03,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {462#(= main_~index~0 0)} is VALID [2022-04-15 12:27:03,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {462#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {463#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:27:03,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 10000); {458#false} is VALID [2022-04-15 12:27:03,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {458#false} ~index~0 := 0; {458#false} is VALID [2022-04-15 12:27:03,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {458#false} is VALID [2022-04-15 12:27:03,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {458#false} is VALID [2022-04-15 12:27:03,493 INFO L272 TraceCheckUtils]: 11: Hoare triple {458#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {458#false} is VALID [2022-04-15 12:27:03,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {458#false} ~cond := #in~cond; {458#false} is VALID [2022-04-15 12:27:03,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#false} assume 0 == ~cond; {458#false} is VALID [2022-04-15 12:27:03,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-15 12:27:03,494 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 12:27:03,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:27:03,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39824305] [2022-04-15 12:27:03,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39824305] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:27:03,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208208422] [2022-04-15 12:27:03,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:27:03,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:27:03,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:27:03,503 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:27:03,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 12:27:03,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:27:03,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:27:03,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 12:27:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:03,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:27:03,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-15 12:27:03,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2022-04-15 12:27:03,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(29, 2); {457#true} is VALID [2022-04-15 12:27:03,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-15 12:27:03,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #71#return; {457#true} is VALID [2022-04-15 12:27:03,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID [2022-04-15 12:27:03,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {483#(and (= main_~index~0 0) (= main_~tmp~0 0))} is VALID [2022-04-15 12:27:03,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {483#(and (= main_~index~0 0) (= main_~tmp~0 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {487#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 12:27:03,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {487#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 10000); {487#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 12:27:03,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {487#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {494#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-15 12:27:03,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {494#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {498#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} is VALID [2022-04-15 12:27:03,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {498#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {458#false} is VALID [2022-04-15 12:27:03,774 INFO L272 TraceCheckUtils]: 11: Hoare triple {458#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {458#false} is VALID [2022-04-15 12:27:03,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {458#false} ~cond := #in~cond; {458#false} is VALID [2022-04-15 12:27:03,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#false} assume 0 == ~cond; {458#false} is VALID [2022-04-15 12:27:03,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-15 12:27:03,775 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 12:27:03,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:27:03,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-04-15 12:27:03,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-04-15 12:27:04,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-15 12:27:04,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#false} assume 0 == ~cond; {458#false} is VALID [2022-04-15 12:27:04,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {458#false} ~cond := #in~cond; {458#false} is VALID [2022-04-15 12:27:04,051 INFO L272 TraceCheckUtils]: 11: Hoare triple {458#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {458#false} is VALID [2022-04-15 12:27:04,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {526#|main_#t~short4|} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {458#false} is VALID [2022-04-15 12:27:04,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {530#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (not (< (mod main_~index~0 4294967296) 10000)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {526#|main_#t~short4|} is VALID [2022-04-15 12:27:04,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {534#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} ~index~0 := 0; {530#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (not (< (mod main_~index~0 4294967296) 10000)))} is VALID [2022-04-15 12:27:04,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {534#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} assume !(~index~0 % 4294967296 < 10000); {534#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-15 12:27:04,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {541#(and (= (mod main_~tmp~0 4294967296) 0) (forall ((|main_~#array~0.offset| Int)) (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) |main_~#array~0.offset|)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {534#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-15 12:27:04,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {541#(and (= (mod main_~tmp~0 4294967296) 0) (forall ((|main_~#array~0.offset| Int)) (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) |main_~#array~0.offset|)))} is VALID [2022-04-15 12:27:04,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID [2022-04-15 12:27:04,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #71#return; {457#true} is VALID [2022-04-15 12:27:04,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-15 12:27:04,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(29, 2); {457#true} is VALID [2022-04-15 12:27:04,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2022-04-15 12:27:04,060 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 12:27:04,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208208422] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:27:04,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:27:04,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2022-04-15 12:27:04,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:27:04,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [216425533] [2022-04-15 12:27:04,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [216425533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:27:04,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:27:04,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:27:04,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068794210] [2022-04-15 12:27:04,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:27:04,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:27:04,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:27:04,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:04,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:04,076 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:27:04,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:04,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:27:04,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:27:04,077 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:04,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:04,258 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-15 12:27:04,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:27:04,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:27:04,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:27:04,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:04,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-15 12:27:04,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-15 12:27:04,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-15 12:27:04,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:04,313 INFO L225 Difference]: With dead ends: 55 [2022-04-15 12:27:04,313 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 12:27:04,313 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:27:04,314 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:27:04,315 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 28 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:27:04,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 12:27:04,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2022-04-15 12:27:04,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:27:04,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:27:04,329 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:27:04,329 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:27:04,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:04,331 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-04-15 12:27:04,332 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-04-15 12:27:04,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:04,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:04,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 38 states. [2022-04-15 12:27:04,333 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 38 states. [2022-04-15 12:27:04,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:04,335 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-04-15 12:27:04,335 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-04-15 12:27:04,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:04,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:04,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:27:04,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:27:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:27:04,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-15 12:27:04,337 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 15 [2022-04-15 12:27:04,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:27:04,338 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-15 12:27:04,338 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:04,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-15 12:27:04,371 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 12:27:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 12:27:04,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:27:04,372 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:27:04,372 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:27:04,395 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 12:27:04,587 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 12:27:04,588 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:27:04,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:27:04,588 INFO L85 PathProgramCache]: Analyzing trace with hash -815661078, now seen corresponding path program 3 times [2022-04-15 12:27:04,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:04,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [526607026] [2022-04-15 12:27:04,592 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:27:04,592 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:27:04,592 INFO L85 PathProgramCache]: Analyzing trace with hash -815661078, now seen corresponding path program 4 times [2022-04-15 12:27:04,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:27:04,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367783941] [2022-04-15 12:27:04,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:27:04,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:27:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:04,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:27:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:04,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {812#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(29, 2); {804#true} is VALID [2022-04-15 12:27:04,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {804#true} assume true; {804#true} is VALID [2022-04-15 12:27:04,671 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {804#true} {804#true} #71#return; {804#true} is VALID [2022-04-15 12:27:04,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {804#true} call ULTIMATE.init(); {812#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:27:04,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {812#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(29, 2); {804#true} is VALID [2022-04-15 12:27:04,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {804#true} assume true; {804#true} is VALID [2022-04-15 12:27:04,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {804#true} {804#true} #71#return; {804#true} is VALID [2022-04-15 12:27:04,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {804#true} call #t~ret5 := main(); {804#true} is VALID [2022-04-15 12:27:04,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {804#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {809#(= main_~index~0 0)} is VALID [2022-04-15 12:27:04,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {809#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {810#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-15 12:27:04,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {810#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {811#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:27:04,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {811#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 10000); {805#false} is VALID [2022-04-15 12:27:04,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {805#false} ~index~0 := 0; {805#false} is VALID [2022-04-15 12:27:04,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {805#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {805#false} is VALID [2022-04-15 12:27:04,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {805#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {805#false} is VALID [2022-04-15 12:27:04,676 INFO L272 TraceCheckUtils]: 12: Hoare triple {805#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {805#false} is VALID [2022-04-15 12:27:04,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {805#false} ~cond := #in~cond; {805#false} is VALID [2022-04-15 12:27:04,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {805#false} assume 0 == ~cond; {805#false} is VALID [2022-04-15 12:27:04,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {805#false} assume !false; {805#false} is VALID [2022-04-15 12:27:04,677 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 12:27:04,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:27:04,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367783941] [2022-04-15 12:27:04,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367783941] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:27:04,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527697042] [2022-04-15 12:27:04,678 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:27:04,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:27:04,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:27:04,679 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:27:04,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 12:27:04,732 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:27:04,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:27:04,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 12:27:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:04,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:27:04,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-04-15 12:27:04,877 INFO L356 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-04-15 12:27:04,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 28 [2022-04-15 12:27:04,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {804#true} call ULTIMATE.init(); {804#true} is VALID [2022-04-15 12:27:04,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {804#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(29, 2); {804#true} is VALID [2022-04-15 12:27:04,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {804#true} assume true; {804#true} is VALID [2022-04-15 12:27:04,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {804#true} {804#true} #71#return; {804#true} is VALID [2022-04-15 12:27:04,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {804#true} call #t~ret5 := main(); {804#true} is VALID [2022-04-15 12:27:04,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {804#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {831#(and (= main_~index~0 0) (= main_~tmp~0 0))} is VALID [2022-04-15 12:27:04,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {831#(and (= main_~index~0 0) (= main_~tmp~0 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {835#(and (= (+ (- 2) main_~tmp~0) 0) (= (+ (- 2) main_~tmp~0) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= main_~index~0 1))} is VALID [2022-04-15 12:27:04,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {835#(and (= (+ (- 2) main_~tmp~0) 0) (= (+ (- 2) main_~tmp~0) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= main_~index~0 1))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {839#(and (= (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-15 12:27:04,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {839#(and (= (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !(~index~0 % 4294967296 < 10000); {805#false} is VALID [2022-04-15 12:27:04,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {805#false} ~index~0 := 0; {805#false} is VALID [2022-04-15 12:27:04,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {805#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {805#false} is VALID [2022-04-15 12:27:04,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {805#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {805#false} is VALID [2022-04-15 12:27:04,939 INFO L272 TraceCheckUtils]: 12: Hoare triple {805#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {805#false} is VALID [2022-04-15 12:27:04,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {805#false} ~cond := #in~cond; {805#false} is VALID [2022-04-15 12:27:04,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {805#false} assume 0 == ~cond; {805#false} is VALID [2022-04-15 12:27:04,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {805#false} assume !false; {805#false} is VALID [2022-04-15 12:27:04,940 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 12:27:04,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:27:05,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-04-15 12:27:05,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 214 [2022-04-15 12:27:05,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {805#false} assume !false; {805#false} is VALID [2022-04-15 12:27:05,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {805#false} assume 0 == ~cond; {805#false} is VALID [2022-04-15 12:27:05,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {805#false} ~cond := #in~cond; {805#false} is VALID [2022-04-15 12:27:05,301 INFO L272 TraceCheckUtils]: 12: Hoare triple {805#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {805#false} is VALID [2022-04-15 12:27:05,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {876#|main_#t~short4|} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {805#false} is VALID [2022-04-15 12:27:05,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {880#(= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {876#|main_#t~short4|} is VALID [2022-04-15 12:27:05,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {884#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} ~index~0 := 0; {880#(= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296))} is VALID [2022-04-15 12:27:05,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {888#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0) (< (mod main_~index~0 4294967296) 10000))} assume !(~index~0 % 4294967296 < 10000); {884#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-15 12:27:05,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {892#(or (< (mod (+ main_~index~0 1) 4294967296) 10000) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) main_~tmp~0) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {888#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0) (< (mod main_~index~0 4294967296) 10000))} is VALID [2022-04-15 12:27:05,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {896#(or (<= 10000 (mod main_~index~0 4294967296)) (< (mod (+ 2 main_~index~0) 4294967296) 10000))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {892#(or (< (mod (+ main_~index~0 1) 4294967296) 10000) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) main_~tmp~0) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-15 12:27:05,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {804#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {896#(or (<= 10000 (mod main_~index~0 4294967296)) (< (mod (+ 2 main_~index~0) 4294967296) 10000))} is VALID [2022-04-15 12:27:05,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {804#true} call #t~ret5 := main(); {804#true} is VALID [2022-04-15 12:27:05,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {804#true} {804#true} #71#return; {804#true} is VALID [2022-04-15 12:27:05,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {804#true} assume true; {804#true} is VALID [2022-04-15 12:27:05,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {804#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(29, 2); {804#true} is VALID [2022-04-15 12:27:05,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {804#true} call ULTIMATE.init(); {804#true} is VALID [2022-04-15 12:27:05,324 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 12:27:05,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527697042] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:27:05,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:27:05,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 8] total 15 [2022-04-15 12:27:05,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:27:05,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [526607026] [2022-04-15 12:27:05,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [526607026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:27:05,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:27:05,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:27:05,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376138105] [2022-04-15 12:27:05,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:27:05,326 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 12:27:05,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:27:05,326 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 12:27:05,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:05,339 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:27:05,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:05,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:27:05,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:27:05,340 INFO L87 Difference]: Start difference. First operand 26 states and 28 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 12:27:05,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:05,604 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2022-04-15 12:27:05,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:27:05,605 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 12:27:05,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:27:05,605 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 12:27:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-04-15 12:27:05,607 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 12:27:05,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-04-15 12:27:05,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2022-04-15 12:27:05,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:05,665 INFO L225 Difference]: With dead ends: 62 [2022-04-15 12:27:05,665 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 12:27:05,666 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:27:05,666 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:27:05,667 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 26 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:27:05,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 12:27:05,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 27. [2022-04-15 12:27:05,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:27:05,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:27:05,697 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:27:05,697 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:27:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:05,702 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-15 12:27:05,702 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-15 12:27:05,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:05,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:05,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 45 states. [2022-04-15 12:27:05,706 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 45 states. [2022-04-15 12:27:05,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:05,709 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-15 12:27:05,709 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-15 12:27:05,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:05,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:05,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:27:05,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:27:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:27:05,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-15 12:27:05,712 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 16 [2022-04-15 12:27:05,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:27:05,712 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-15 12:27:05,712 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 12:27:05,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-15 12:27:05,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:05,744 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:27:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:27:05,745 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:27:05,745 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:27:05,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 12:27:05,959 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 12:27:05,960 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:27:05,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:27:05,960 INFO L85 PathProgramCache]: Analyzing trace with hash 619590450, now seen corresponding path program 5 times [2022-04-15 12:27:05,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:05,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2055818343] [2022-04-15 12:27:05,964 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:27:05,964 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:27:05,964 INFO L85 PathProgramCache]: Analyzing trace with hash 619590450, now seen corresponding path program 6 times [2022-04-15 12:27:05,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:27:05,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359658333] [2022-04-15 12:27:05,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:27:05,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:27:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:06,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:27:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:06,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {1200#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(29, 2); {1191#true} is VALID [2022-04-15 12:27:06,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-15 12:27:06,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1191#true} {1191#true} #71#return; {1191#true} is VALID [2022-04-15 12:27:06,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {1191#true} call ULTIMATE.init(); {1200#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:27:06,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {1200#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(29, 2); {1191#true} is VALID [2022-04-15 12:27:06,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-15 12:27:06,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#true} {1191#true} #71#return; {1191#true} is VALID [2022-04-15 12:27:06,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#true} call #t~ret5 := main(); {1191#true} is VALID [2022-04-15 12:27:06,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {1191#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1196#(= main_~index~0 0)} is VALID [2022-04-15 12:27:06,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {1196#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1197#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-15 12:27:06,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {1197#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1198#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-15 12:27:06,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {1198#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1199#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:27:06,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {1199#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 10000); {1192#false} is VALID [2022-04-15 12:27:06,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {1192#false} ~index~0 := 0; {1192#false} is VALID [2022-04-15 12:27:06,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {1192#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1192#false} is VALID [2022-04-15 12:27:06,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {1192#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1192#false} is VALID [2022-04-15 12:27:06,101 INFO L272 TraceCheckUtils]: 13: Hoare triple {1192#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1192#false} is VALID [2022-04-15 12:27:06,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {1192#false} ~cond := #in~cond; {1192#false} is VALID [2022-04-15 12:27:06,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {1192#false} assume 0 == ~cond; {1192#false} is VALID [2022-04-15 12:27:06,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {1192#false} assume !false; {1192#false} is VALID [2022-04-15 12:27:06,102 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 12:27:06,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:27:06,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359658333] [2022-04-15 12:27:06,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359658333] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:27:06,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005763610] [2022-04-15 12:27:06,103 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:27:06,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:27:06,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:27:06,108 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:27:06,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 12:27:06,163 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:27:06,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:27:06,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 12:27:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:06,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:27:06,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-04-15 12:27:06,271 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-15 12:27:06,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-04-15 12:27:06,310 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-15 12:27:06,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-04-15 12:27:06,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {1191#true} call ULTIMATE.init(); {1191#true} is VALID [2022-04-15 12:27:06,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {1191#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(29, 2); {1191#true} is VALID [2022-04-15 12:27:06,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-15 12:27:06,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#true} {1191#true} #71#return; {1191#true} is VALID [2022-04-15 12:27:06,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#true} call #t~ret5 := main(); {1191#true} is VALID [2022-04-15 12:27:06,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {1191#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1219#(and (= main_~index~0 0) (= main_~tmp~0 0))} is VALID [2022-04-15 12:27:06,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {1219#(and (= main_~index~0 0) (= main_~tmp~0 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1223#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)) 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-15 12:27:06,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {1223#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)) 0) (= (+ (- 1) main_~index~0) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1227#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-15 12:27:06,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {1227#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1231#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 12:27:06,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {1231#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 10000); {1231#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 12:27:06,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {1231#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {1238#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-15 12:27:06,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {1238#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1242#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} is VALID [2022-04-15 12:27:06,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {1242#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1192#false} is VALID [2022-04-15 12:27:06,388 INFO L272 TraceCheckUtils]: 13: Hoare triple {1192#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1192#false} is VALID [2022-04-15 12:27:06,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {1192#false} ~cond := #in~cond; {1192#false} is VALID [2022-04-15 12:27:06,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {1192#false} assume 0 == ~cond; {1192#false} is VALID [2022-04-15 12:27:06,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {1192#false} assume !false; {1192#false} is VALID [2022-04-15 12:27:06,388 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 12:27:06,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:27:06,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2022-04-15 12:27:06,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 470 treesize of output 466 [2022-04-15 12:27:07,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {1192#false} assume !false; {1192#false} is VALID [2022-04-15 12:27:07,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {1192#false} assume 0 == ~cond; {1192#false} is VALID [2022-04-15 12:27:07,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {1192#false} ~cond := #in~cond; {1192#false} is VALID [2022-04-15 12:27:07,242 INFO L272 TraceCheckUtils]: 13: Hoare triple {1192#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1192#false} is VALID [2022-04-15 12:27:07,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {1270#|main_#t~short4|} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1192#false} is VALID [2022-04-15 12:27:07,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {1274#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (not (< (mod main_~index~0 4294967296) 10000)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1270#|main_#t~short4|} is VALID [2022-04-15 12:27:07,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {1278#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} ~index~0 := 0; {1274#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (not (< (mod main_~index~0 4294967296) 10000)))} is VALID [2022-04-15 12:27:07,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {1278#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} assume !(~index~0 % 4294967296 < 10000); {1278#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-15 12:27:07,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {1285#(forall ((v_ArrVal_52 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_52) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1278#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-15 12:27:07,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {1289#(forall ((v_ArrVal_50 Int) (v_ArrVal_52 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_50) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_52) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1285#(forall ((v_ArrVal_52 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_52) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-15 12:27:07,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {1293#(and (= (mod main_~tmp~0 4294967296) 0) (= (* (mod main_~index~0 4294967296) 4) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1289#(forall ((v_ArrVal_50 Int) (v_ArrVal_52 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_50) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_52) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-15 12:27:07,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {1191#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1293#(and (= (mod main_~tmp~0 4294967296) 0) (= (* (mod main_~index~0 4294967296) 4) 0))} is VALID [2022-04-15 12:27:07,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#true} call #t~ret5 := main(); {1191#true} is VALID [2022-04-15 12:27:07,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#true} {1191#true} #71#return; {1191#true} is VALID [2022-04-15 12:27:07,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-15 12:27:07,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {1191#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(29, 2); {1191#true} is VALID [2022-04-15 12:27:07,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {1191#true} call ULTIMATE.init(); {1191#true} is VALID [2022-04-15 12:27:07,252 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 12:27:07,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005763610] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:27:07,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:27:07,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2022-04-15 12:27:07,252 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:27:07,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2055818343] [2022-04-15 12:27:07,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2055818343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:27:07,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:27:07,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:27:07,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500874567] [2022-04-15 12:27:07,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:27:07,253 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 12:27:07,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:27:07,254 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 12:27:07,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:07,270 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:27:07,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:07,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:27:07,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:27:07,271 INFO L87 Difference]: Start difference. First operand 27 states and 29 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 12:27:07,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:07,726 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2022-04-15 12:27:07,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:27:07,727 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 12:27:07,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:27:07,727 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 12:27:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-15 12:27:07,729 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 12:27:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-15 12:27:07,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-15 12:27:07,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:07,794 INFO L225 Difference]: With dead ends: 69 [2022-04-15 12:27:07,794 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 12:27:07,795 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:27:07,796 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 50 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:27:07,796 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 39 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:27:07,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 12:27:07,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 28. [2022-04-15 12:27:07,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:27:07,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:27:07,826 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:27:07,826 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:27:07,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:07,828 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 12:27:07,828 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 12:27:07,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:07,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:07,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 52 states. [2022-04-15 12:27:07,829 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 52 states. [2022-04-15 12:27:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:07,831 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 12:27:07,831 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 12:27:07,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:07,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:07,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:27:07,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:27:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:27:07,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-04-15 12:27:07,833 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 17 [2022-04-15 12:27:07,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:27:07,833 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-04-15 12:27:07,834 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 12:27:07,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2022-04-15 12:27:07,866 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 12:27:07,866 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 12:27:07,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:27:07,866 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:27:07,866 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:27:07,891 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 12:27:08,091 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 12:27:08,092 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:27:08,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:27:08,092 INFO L85 PathProgramCache]: Analyzing trace with hash -2132252438, now seen corresponding path program 7 times [2022-04-15 12:27:08,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:08,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1835555782] [2022-04-15 12:27:08,103 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:27:08,104 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:27:08,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2132252438, now seen corresponding path program 8 times [2022-04-15 12:27:08,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:27:08,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900287848] [2022-04-15 12:27:08,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:27:08,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:27:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:08,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:27:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:08,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {1630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(29, 2); {1620#true} is VALID [2022-04-15 12:27:08,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-04-15 12:27:08,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1620#true} {1620#true} #71#return; {1620#true} is VALID [2022-04-15 12:27:08,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {1620#true} call ULTIMATE.init(); {1630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:27:08,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {1630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(29, 2); {1620#true} is VALID [2022-04-15 12:27:08,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-04-15 12:27:08,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1620#true} {1620#true} #71#return; {1620#true} is VALID [2022-04-15 12:27:08,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {1620#true} call #t~ret5 := main(); {1620#true} is VALID [2022-04-15 12:27:08,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {1620#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1625#(= main_~index~0 0)} is VALID [2022-04-15 12:27:08,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {1625#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1626#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-15 12:27:08,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {1626#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1627#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-15 12:27:08,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {1627#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1628#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-15 12:27:08,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {1628#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1629#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 4))} is VALID [2022-04-15 12:27:08,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {1629#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 4))} assume !(~index~0 % 4294967296 < 10000); {1621#false} is VALID [2022-04-15 12:27:08,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {1621#false} ~index~0 := 0; {1621#false} is VALID [2022-04-15 12:27:08,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {1621#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1621#false} is VALID [2022-04-15 12:27:08,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {1621#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1621#false} is VALID [2022-04-15 12:27:08,238 INFO L272 TraceCheckUtils]: 14: Hoare triple {1621#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1621#false} is VALID [2022-04-15 12:27:08,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {1621#false} ~cond := #in~cond; {1621#false} is VALID [2022-04-15 12:27:08,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {1621#false} assume 0 == ~cond; {1621#false} is VALID [2022-04-15 12:27:08,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {1621#false} assume !false; {1621#false} is VALID [2022-04-15 12:27:08,238 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 12:27:08,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:27:08,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900287848] [2022-04-15 12:27:08,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900287848] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:27:08,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261676034] [2022-04-15 12:27:08,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:27:08,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:27:08,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:27:08,240 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:27:08,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 12:27:08,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:27:08,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:27:08,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 12:27:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:08,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:27:08,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-04-15 12:27:08,402 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-15 12:27:08,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-04-15 12:27:08,445 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-04-15 12:27:08,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-04-15 12:27:08,480 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-15 12:27:08,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-04-15 12:27:08,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {1620#true} call ULTIMATE.init(); {1620#true} is VALID [2022-04-15 12:27:08,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {1620#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(29, 2); {1620#true} is VALID [2022-04-15 12:27:08,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-04-15 12:27:08,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1620#true} {1620#true} #71#return; {1620#true} is VALID [2022-04-15 12:27:08,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {1620#true} call #t~ret5 := main(); {1620#true} is VALID [2022-04-15 12:27:08,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {1620#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1649#(and (= main_~index~0 0) (= main_~tmp~0 0))} is VALID [2022-04-15 12:27:08,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {1649#(and (= main_~index~0 0) (= main_~tmp~0 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1653#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)) 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-15 12:27:08,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {1653#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)) 0) (= (+ (- 1) main_~index~0) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1657#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-15 12:27:08,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {1657#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1661#(and (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-15 12:27:08,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {1661#(and (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1665#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 12:27:08,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {1665#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 10000); {1665#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 12:27:08,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {1665#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {1672#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-15 12:27:08,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {1672#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1676#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} is VALID [2022-04-15 12:27:08,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {1676#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1621#false} is VALID [2022-04-15 12:27:08,561 INFO L272 TraceCheckUtils]: 14: Hoare triple {1621#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1621#false} is VALID [2022-04-15 12:27:08,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {1621#false} ~cond := #in~cond; {1621#false} is VALID [2022-04-15 12:27:08,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {1621#false} assume 0 == ~cond; {1621#false} is VALID [2022-04-15 12:27:08,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {1621#false} assume !false; {1621#false} is VALID [2022-04-15 12:27:08,562 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 12:27:08,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:27:09,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2022-04-15 12:27:09,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14886 treesize of output 14822